paul@261 | 1 | #!/usr/bin/env python |
paul@261 | 2 | |
paul@261 | 3 | """ |
paul@261 | 4 | A native function library for a really simple virtual processor. |
paul@261 | 5 | |
paul@261 | 6 | Copyright (C) 2007, 2008, 2009 Paul Boddie <paul@boddie.org.uk> |
paul@261 | 7 | |
paul@261 | 8 | This program is free software; you can redistribute it and/or modify it under |
paul@261 | 9 | the terms of the GNU General Public License as published by the Free Software |
paul@261 | 10 | Foundation; either version 3 of the License, or (at your option) any later |
paul@261 | 11 | version. |
paul@261 | 12 | |
paul@261 | 13 | This program is distributed in the hope that it will be useful, but WITHOUT |
paul@261 | 14 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS |
paul@261 | 15 | FOR A PARTICULAR PURPOSE. See the GNU General Public License for more |
paul@261 | 16 | details. |
paul@261 | 17 | |
paul@261 | 18 | You should have received a copy of the GNU General Public License along with |
paul@261 | 19 | this program. If not, see <http://www.gnu.org/licenses/>. |
paul@261 | 20 | """ |
paul@261 | 21 | |
paul@264 | 22 | from micropython.program import DataValue |
paul@261 | 23 | import operator |
paul@261 | 24 | |
paul@261 | 25 | class Library: |
paul@261 | 26 | |
paul@261 | 27 | "Native function implementations." |
paul@261 | 28 | |
paul@261 | 29 | def __init__(self, machine, true_constant, false_constant): |
paul@261 | 30 | |
paul@261 | 31 | """ |
paul@261 | 32 | Initialise the library with the 'machine' and the addresses |
paul@261 | 33 | 'true_constant' and 'false_constant'. |
paul@261 | 34 | """ |
paul@261 | 35 | |
paul@261 | 36 | self.machine = machine |
paul@261 | 37 | self.true_constant = true_constant |
paul@261 | 38 | self.false_constant = false_constant |
paul@261 | 39 | |
paul@261 | 40 | # Native class constants. |
paul@261 | 41 | |
paul@261 | 42 | cls = self.machine._get_class("__builtins__", "int") |
paul@261 | 43 | self.int_class = cls.location |
paul@261 | 44 | self.int_instance = cls.instance_template_location |
paul@261 | 45 | cls = self.machine._get_class("__builtins__", "list") |
paul@261 | 46 | self.list_class = cls.location |
paul@261 | 47 | self.list_instance = cls.instance_template_location |
paul@261 | 48 | cls = self.machine._get_class("__builtins__", "IndexError") |
paul@261 | 49 | self.index_error = cls.location |
paul@261 | 50 | self.index_error_instance = cls.instance_template_location |
paul@262 | 51 | cls = self.machine._get_class("__builtins__", "basestring") |
paul@262 | 52 | self.str_class = cls.location |
paul@262 | 53 | self.str_instance = cls.instance_template_location |
paul@261 | 54 | |
paul@261 | 55 | self.tuple_class = self.machine.tuple_class |
paul@261 | 56 | self.type_error_instance = self.machine.type_error_instance |
paul@261 | 57 | |
paul@261 | 58 | self.frame_stack = self.machine.frame_stack |
paul@261 | 59 | self.local_sp_stack = self.machine.local_sp_stack |
paul@261 | 60 | |
paul@261 | 61 | def builtins_int_arithmetic_op(self, op): |
paul@261 | 62 | frame = self.local_sp_stack[-1] |
paul@261 | 63 | |
paul@261 | 64 | # Get operands addresses. |
paul@261 | 65 | |
paul@264 | 66 | left_value = self.frame_stack[frame] |
paul@264 | 67 | right_value = self.frame_stack[frame + 1] |
paul@261 | 68 | |
paul@261 | 69 | # Test operand suitability. |
paul@261 | 70 | # NOTE: Support other types. |
paul@261 | 71 | |
paul@264 | 72 | if not (self.machine._CheckInstance(left_value.ref, self.int_class) and |
paul@264 | 73 | self.machine._CheckInstance(right_value.ref, self.int_class)): |
paul@264 | 74 | |
paul@261 | 75 | self.machine.exception = self.machine._MakeObject(2, self.type_error_instance) |
paul@261 | 76 | return self.machine.RaiseException() |
paul@261 | 77 | |
paul@261 | 78 | # NOTE: Assume single location for data. |
paul@261 | 79 | |
paul@264 | 80 | left_data = left_value.ref + 1 |
paul@264 | 81 | right_data = right_value.ref + 1 |
paul@261 | 82 | |
paul@261 | 83 | # Make a new object. |
paul@261 | 84 | |
paul@261 | 85 | addr = self.machine._MakeObject(2, self.int_instance) |
paul@261 | 86 | |
paul@261 | 87 | # Store the result. |
paul@261 | 88 | # NOTE: The data is considered ready to use. |
paul@261 | 89 | |
paul@261 | 90 | self.machine.save(addr + 1, op(self.machine.load(left_data), self.machine.load(right_data))) |
paul@261 | 91 | |
paul@261 | 92 | # Return the new object. |
paul@261 | 93 | # Introduce object as context for the new object. |
paul@261 | 94 | |
paul@264 | 95 | self.machine.result = DataValue(addr, addr) |
paul@261 | 96 | |
paul@262 | 97 | def builtins_logical_op(self, operand_class, op, true_if_incompatible): |
paul@262 | 98 | frame = self.local_sp_stack[-1] |
paul@262 | 99 | |
paul@262 | 100 | # Get operands addresses. |
paul@262 | 101 | |
paul@264 | 102 | left_value = self.frame_stack[frame] |
paul@264 | 103 | right_value = self.frame_stack[frame + 1] |
paul@262 | 104 | |
paul@262 | 105 | # Test operand suitability. |
paul@262 | 106 | # NOTE: Handle comparisons of incompatible types more appropriately. |
paul@262 | 107 | |
paul@264 | 108 | if not (self.machine._CheckInstance(left_value.ref, operand_class) and |
paul@264 | 109 | self.machine._CheckInstance(right_value.ref, operand_class)): |
paul@264 | 110 | |
paul@262 | 111 | if true_if_incompatible: |
paul@264 | 112 | self.machine.result = DataValue(self.true_constant, self.true_constant) |
paul@262 | 113 | else: |
paul@264 | 114 | self.machine.result = DataValue(self.false_constant, self.false_constant) |
paul@262 | 115 | return |
paul@262 | 116 | |
paul@262 | 117 | # NOTE: Assume single location for data. |
paul@262 | 118 | |
paul@264 | 119 | left_data = left_value.ref + 1 |
paul@264 | 120 | right_data = right_value.ref + 1 |
paul@262 | 121 | |
paul@262 | 122 | # Test the data. |
paul@262 | 123 | # NOTE: The data is considered ready to use. |
paul@262 | 124 | |
paul@262 | 125 | if op(self.machine.load(left_data), self.machine.load(right_data)): |
paul@264 | 126 | self.machine.result = DataValue(self.true_constant, self.true_constant) |
paul@262 | 127 | else: |
paul@264 | 128 | self.machine.result = DataValue(self.false_constant, self.false_constant) |
paul@262 | 129 | |
paul@262 | 130 | # Operators. |
paul@262 | 131 | # Although this takes a short-cut by using the operator module, testing is |
paul@262 | 132 | # still performed on the operands to ensure that they qualify for these |
paul@262 | 133 | # native operations. |
paul@262 | 134 | |
paul@262 | 135 | def builtins_int_add(self): |
paul@262 | 136 | return self.builtins_int_arithmetic_op(operator.add) |
paul@262 | 137 | |
paul@262 | 138 | def builtins_int_sub(self): |
paul@262 | 139 | return self.builtins_int_arithmetic_op(operator.sub) |
paul@262 | 140 | |
paul@262 | 141 | def builtins_int_pow(self): |
paul@262 | 142 | return self.builtins_int_arithmetic_op(operator.pow) |
paul@262 | 143 | |
paul@262 | 144 | def builtins_int_lt(self): |
paul@262 | 145 | return self.builtins_logical_op(self.int_class, operator.lt, 0) |
paul@262 | 146 | |
paul@262 | 147 | def builtins_int_le(self): |
paul@262 | 148 | return self.builtins_logical_op(self.int_class, operator.le, 0) |
paul@262 | 149 | |
paul@262 | 150 | def builtins_int_gt(self): |
paul@262 | 151 | return self.builtins_logical_op(self.int_class, operator.gt, 0) |
paul@262 | 152 | |
paul@262 | 153 | def builtins_int_ge(self): |
paul@262 | 154 | return self.builtins_logical_op(self.int_class, operator.ge, 0) |
paul@262 | 155 | |
paul@262 | 156 | def builtins_int_eq(self): |
paul@262 | 157 | return self.builtins_logical_op(self.int_class, operator.eq, 0) |
paul@262 | 158 | |
paul@262 | 159 | def builtins_int_ne(self): |
paul@262 | 160 | return self.builtins_logical_op(self.int_class, operator.ne, 1) |
paul@262 | 161 | |
paul@262 | 162 | def builtins_str_lt(self): |
paul@262 | 163 | return self.builtins_logical_op(self.str_class, operator.lt, 0) |
paul@262 | 164 | |
paul@262 | 165 | def builtins_str_le(self): |
paul@262 | 166 | return self.builtins_logical_op(self.str_class, operator.le, 0) |
paul@262 | 167 | |
paul@262 | 168 | def builtins_str_gt(self): |
paul@262 | 169 | return self.builtins_logical_op(self.str_class, operator.gt, 0) |
paul@262 | 170 | |
paul@262 | 171 | def builtins_str_ge(self): |
paul@262 | 172 | return self.builtins_logical_op(self.str_class, operator.ge, 0) |
paul@262 | 173 | |
paul@262 | 174 | def builtins_str_eq(self): |
paul@262 | 175 | return self.builtins_logical_op(self.str_class, operator.eq, 0) |
paul@262 | 176 | |
paul@262 | 177 | def builtins_str_ne(self): |
paul@262 | 178 | return self.builtins_logical_op(self.str_class, operator.ne, 1) |
paul@262 | 179 | |
paul@262 | 180 | def builtins_int_and(self): |
paul@262 | 181 | return self.builtins_int_arithmetic_op(operator.and_) |
paul@262 | 182 | |
paul@262 | 183 | def builtins_int_or(self): |
paul@262 | 184 | return self.builtins_int_arithmetic_op(operator.or_) |
paul@262 | 185 | |
paul@262 | 186 | # Specific operator methods. |
paul@262 | 187 | |
paul@261 | 188 | def builtins_int_bool(self): |
paul@261 | 189 | frame = self.local_sp_stack[-1] |
paul@261 | 190 | |
paul@261 | 191 | # Get operands addresses. |
paul@261 | 192 | |
paul@264 | 193 | left_value = self.frame_stack[frame] |
paul@261 | 194 | |
paul@261 | 195 | # Test operand suitability. |
paul@261 | 196 | |
paul@264 | 197 | if not self.machine._CheckInstance(left_value.ref, self.int_class): |
paul@261 | 198 | self.machine.exception = self.machine._MakeObject(2, self.type_error_instance) |
paul@261 | 199 | return self.machine.RaiseException() |
paul@261 | 200 | |
paul@261 | 201 | # NOTE: Assume single location for data. |
paul@261 | 202 | |
paul@264 | 203 | left_data = left_value.ref + 1 |
paul@261 | 204 | |
paul@261 | 205 | # Test the data. |
paul@261 | 206 | # NOTE: The data is considered ready to use. |
paul@261 | 207 | |
paul@261 | 208 | if self.machine.load(left_data) != 0: |
paul@264 | 209 | self.machine.result = DataValue(self.true_constant, self.true_constant) |
paul@261 | 210 | else: |
paul@264 | 211 | self.machine.result = DataValue(self.false_constant, self.false_constant) |
paul@261 | 212 | |
paul@261 | 213 | def builtins_int_neg(self): |
paul@261 | 214 | frame = self.local_sp_stack[-1] |
paul@261 | 215 | |
paul@261 | 216 | # Get operands addresses. |
paul@261 | 217 | |
paul@264 | 218 | left_value = self.frame_stack[frame] |
paul@261 | 219 | |
paul@261 | 220 | # Test operand suitability. |
paul@261 | 221 | |
paul@264 | 222 | if not self.machine._CheckInstance(left_value.ref, self.int_class): |
paul@261 | 223 | self.machine.exception = self.machine._MakeObject(2, self.type_error_instance) |
paul@261 | 224 | return self.machine.RaiseException() |
paul@261 | 225 | |
paul@261 | 226 | # NOTE: Assume single location for data. |
paul@261 | 227 | |
paul@264 | 228 | left_data = left_value.ref + 1 |
paul@261 | 229 | |
paul@261 | 230 | # Make a new object. |
paul@261 | 231 | |
paul@261 | 232 | addr = self.machine._MakeObject(2, self.int_instance) |
paul@261 | 233 | |
paul@261 | 234 | # Store the result. |
paul@261 | 235 | # NOTE: The data is considered ready to use. |
paul@261 | 236 | |
paul@261 | 237 | self.machine.save(addr + 1, -self.machine.load(left_data)) |
paul@261 | 238 | |
paul@261 | 239 | # Return the new object. |
paul@261 | 240 | # Introduce object as context for the new object. |
paul@261 | 241 | |
paul@264 | 242 | self.machine.result = DataValue(addr, addr) |
paul@261 | 243 | |
paul@262 | 244 | # Various built-in methods. |
paul@261 | 245 | |
paul@261 | 246 | def builtins_bool_bool(self): |
paul@261 | 247 | frame = self.local_sp_stack[-1] |
paul@261 | 248 | |
paul@261 | 249 | # Get operands addresses. |
paul@261 | 250 | |
paul@264 | 251 | left_value = self.frame_stack[frame] |
paul@264 | 252 | self.machine.result = DataValue(left_value.ref, left_value.ref) |
paul@261 | 253 | |
paul@261 | 254 | def builtins_list_new(self): |
paul@261 | 255 | frame = self.local_sp_stack[-1] |
paul@261 | 256 | |
paul@261 | 257 | # The first parameter should be empty. |
paul@261 | 258 | # NOTE: Specific copying of tuples/lists. |
paul@261 | 259 | |
paul@264 | 260 | args_value = self.frame_stack[frame + 1] |
paul@261 | 261 | |
paul@261 | 262 | # Test operand suitability. |
paul@261 | 263 | |
paul@264 | 264 | if self.machine._CheckInstance(args_value.ref, self.list_class): |
paul@264 | 265 | sequence = self.machine.load(args_value.ref + 1) |
paul@264 | 266 | header = self.machine.load(sequence.ref) |
paul@261 | 267 | size = header.occupied_size |
paul@264 | 268 | elif self.machine._CheckInstance(args_value.ref, self.tuple_class): |
paul@264 | 269 | sequence = args_value.ref |
paul@261 | 270 | header = self.machine.load(sequence) |
paul@261 | 271 | size = header.size |
paul@261 | 272 | else: |
paul@261 | 273 | self.machine.exception = self.machine._MakeObject(2, self.type_error_instance) |
paul@261 | 274 | return self.machine.RaiseException() |
paul@261 | 275 | |
paul@261 | 276 | # Copy the sequence contents. |
paul@261 | 277 | |
paul@261 | 278 | new_fragment = self.machine._MakeFragment(size) |
paul@261 | 279 | for i in range(1, size): |
paul@261 | 280 | self.machine.save(new_fragment + i, self.machine.load(sequence + i)) |
paul@261 | 281 | |
paul@261 | 282 | # Make the list instance. |
paul@261 | 283 | |
paul@261 | 284 | addr = self.machine._MakeObject(2, self.list_instance) |
paul@264 | 285 | self.machine.save(addr + 1, DataValue(None, new_fragment)) |
paul@261 | 286 | |
paul@264 | 287 | self.machine.result = DataValue(addr, addr) |
paul@261 | 288 | |
paul@261 | 289 | def builtins_list_getitem(self): |
paul@261 | 290 | frame = self.local_sp_stack[-1] |
paul@261 | 291 | |
paul@261 | 292 | # Get the operand address. |
paul@261 | 293 | |
paul@264 | 294 | item_value = self.frame_stack[frame + 1] |
paul@261 | 295 | |
paul@261 | 296 | # Get the list address. |
paul@261 | 297 | |
paul@264 | 298 | obj_value = self.frame_stack[frame] |
paul@261 | 299 | |
paul@261 | 300 | # Get the fragment address. |
paul@261 | 301 | # NOTE: Assume single location for header. |
paul@261 | 302 | |
paul@264 | 303 | fragment = self.machine.load(obj_value.ref + 1) |
paul@261 | 304 | |
paul@261 | 305 | # Get the fragment header. |
paul@261 | 306 | |
paul@264 | 307 | header = self.machine.load(fragment.ref) |
paul@261 | 308 | nelements = header.occupied_size - 1 |
paul@261 | 309 | |
paul@261 | 310 | # NOTE: Assume single location for data and header. |
paul@261 | 311 | |
paul@264 | 312 | item_pos = self.machine.load(item_value.ref + 1) |
paul@261 | 313 | |
paul@261 | 314 | if item_pos >= 0 and item_pos < nelements: |
paul@261 | 315 | pass |
paul@261 | 316 | elif item_pos < 0 and item_pos >= -nelements: |
paul@261 | 317 | item_pos = nelements + item_pos |
paul@261 | 318 | else: |
paul@261 | 319 | self.machine.exception = self.machine._MakeObject(2, self.index_error_instance) |
paul@261 | 320 | return self.machine.RaiseException() |
paul@261 | 321 | |
paul@261 | 322 | # NOTE: Assume single location for header. |
paul@261 | 323 | |
paul@264 | 324 | self.machine.result = self.machine.load(fragment.ref + 1 + item_pos) |
paul@261 | 325 | |
paul@261 | 326 | def builtins_list_len(self): |
paul@261 | 327 | frame = self.local_sp_stack[-1] |
paul@261 | 328 | |
paul@261 | 329 | # Get the list address. |
paul@261 | 330 | |
paul@264 | 331 | obj_value = self.frame_stack[frame] |
paul@261 | 332 | |
paul@261 | 333 | # Get the fragment address. |
paul@261 | 334 | # NOTE: Assume single location for header. |
paul@261 | 335 | |
paul@264 | 336 | fragment = self.machine.load(obj_value.ref + 1) |
paul@261 | 337 | |
paul@261 | 338 | # Get the fragment header. |
paul@261 | 339 | |
paul@264 | 340 | header = self.machine.load(fragment.ref) |
paul@261 | 341 | nelements = header.occupied_size - 1 |
paul@261 | 342 | |
paul@261 | 343 | # Make a new object. |
paul@261 | 344 | |
paul@261 | 345 | addr = self.machine._MakeObject(2, self.int_instance) |
paul@261 | 346 | |
paul@261 | 347 | # Store the result. |
paul@261 | 348 | # NOTE: The data is considered ready to use. |
paul@261 | 349 | |
paul@261 | 350 | self.machine.save(addr + 1, nelements) |
paul@261 | 351 | |
paul@261 | 352 | # Return the new object. |
paul@261 | 353 | # Introduce object as context for the new object. |
paul@261 | 354 | |
paul@264 | 355 | self.machine.result = DataValue(addr, addr) |
paul@261 | 356 | |
paul@261 | 357 | def builtins_list_append(self): |
paul@261 | 358 | frame = self.local_sp_stack[-1] |
paul@261 | 359 | |
paul@261 | 360 | # Get operand address. |
paul@261 | 361 | |
paul@264 | 362 | arg_value = self.frame_stack[frame + 1] |
paul@261 | 363 | |
paul@261 | 364 | # Get the list address. |
paul@261 | 365 | |
paul@264 | 366 | obj_value = self.frame_stack[frame] |
paul@261 | 367 | |
paul@261 | 368 | # Get the fragment address. |
paul@261 | 369 | # NOTE: Assume single location for header. |
paul@261 | 370 | |
paul@264 | 371 | fragment = self.machine.load(obj_value.ref + 1) |
paul@261 | 372 | |
paul@261 | 373 | # Get the fragment header. |
paul@261 | 374 | |
paul@264 | 375 | header = self.machine.load(fragment.ref) |
paul@261 | 376 | |
paul@261 | 377 | # Attempt to add the reference. |
paul@261 | 378 | |
paul@261 | 379 | if header.occupied_size < header.allocated_size: |
paul@264 | 380 | self.machine.save(fragment.ref + header.occupied_size, arg_value) |
paul@261 | 381 | header.occupied_size += 1 |
paul@261 | 382 | else: |
paul@261 | 383 | |
paul@261 | 384 | # Make a new fragment, maintaining more space than currently |
paul@261 | 385 | # occupied in order to avoid reallocation. |
paul@261 | 386 | |
paul@261 | 387 | new_fragment = self.machine._MakeFragment(header.allocated_size + 1) |
paul@261 | 388 | |
paul@261 | 389 | # Copy existing elements. |
paul@261 | 390 | |
paul@261 | 391 | for i in range(1, header.allocated_size): |
paul@264 | 392 | self.machine.save(new_fragment + i, self.machine.load(fragment.ref + i)) |
paul@261 | 393 | |
paul@264 | 394 | self.machine.save(new_fragment + header.allocated_size, arg_value) |
paul@261 | 395 | |
paul@261 | 396 | # Set the new fragment in the object. |
paul@261 | 397 | # NOTE: The old fragment could be deallocated. |
paul@261 | 398 | |
paul@264 | 399 | self.machine.save(obj_value.ref + 1, DataValue(None, new_fragment)) |
paul@261 | 400 | |
paul@261 | 401 | def builtins_tuple_len(self): |
paul@261 | 402 | frame = self.local_sp_stack[-1] |
paul@261 | 403 | |
paul@261 | 404 | # Get the tuple address. |
paul@261 | 405 | |
paul@264 | 406 | obj_value = self.frame_stack[frame] |
paul@261 | 407 | |
paul@261 | 408 | # Get the header. |
paul@261 | 409 | # NOTE: Assume single location for header. |
paul@261 | 410 | |
paul@264 | 411 | header = self.machine.load(obj_value.ref) |
paul@261 | 412 | nelements = header.size - 1 |
paul@261 | 413 | |
paul@261 | 414 | # Make a new object. |
paul@261 | 415 | |
paul@261 | 416 | addr = self.machine._MakeObject(2, self.int_instance) |
paul@261 | 417 | |
paul@261 | 418 | # Store the result. |
paul@261 | 419 | # NOTE: The data is considered ready to use. |
paul@261 | 420 | |
paul@261 | 421 | self.machine.save(addr + 1, nelements) |
paul@261 | 422 | |
paul@261 | 423 | # Return the new object. |
paul@261 | 424 | # Introduce object as context for the new object. |
paul@261 | 425 | |
paul@264 | 426 | self.machine.result = DataValue(addr, addr) |
paul@261 | 427 | |
paul@261 | 428 | def builtins_tuple_getitem(self): |
paul@261 | 429 | frame = self.local_sp_stack[-1] |
paul@261 | 430 | |
paul@261 | 431 | # Get the operand address. |
paul@261 | 432 | |
paul@264 | 433 | item_value = self.frame_stack[frame + 1] |
paul@261 | 434 | |
paul@261 | 435 | # Get the tuple address. |
paul@261 | 436 | |
paul@264 | 437 | obj_value = self.frame_stack[frame] |
paul@261 | 438 | |
paul@261 | 439 | # Get the header. |
paul@261 | 440 | # NOTE: Assume single location for header. |
paul@261 | 441 | |
paul@264 | 442 | header = self.machine.load(obj_value.ref) |
paul@261 | 443 | nelements = header.size - 1 |
paul@261 | 444 | |
paul@261 | 445 | # NOTE: Assume single location for data and header. |
paul@261 | 446 | |
paul@264 | 447 | item_pos = self.machine.load(item_value.ref + 1) |
paul@261 | 448 | |
paul@261 | 449 | if item_pos >= 0 and item_pos < nelements: |
paul@261 | 450 | pass |
paul@261 | 451 | elif item_pos < 0 and item_pos >= -nelements: |
paul@261 | 452 | item_pos = nelements + item_pos |
paul@261 | 453 | else: |
paul@261 | 454 | self.machine.exception = self.machine._MakeObject(2, self.index_error_instance) |
paul@261 | 455 | return self.machine.RaiseException() |
paul@261 | 456 | |
paul@261 | 457 | # NOTE: Assume single location for header. |
paul@261 | 458 | |
paul@264 | 459 | self.machine.result = self.machine.load(obj_value.ref + 1 + item_pos) |
paul@261 | 460 | |
paul@261 | 461 | def builtins_object_init(self): |
paul@261 | 462 | pass |
paul@261 | 463 | |
paul@261 | 464 | native_functions = { |
paul@261 | 465 | |
paul@261 | 466 | # Native method implementations: |
paul@261 | 467 | |
paul@261 | 468 | "__builtins__.int.__add__" : builtins_int_add, |
paul@261 | 469 | "__builtins__.int.__radd__" : builtins_int_add, # NOTE: To be made distinct. |
paul@261 | 470 | "__builtins__.int.__sub__" : builtins_int_sub, |
paul@262 | 471 | "__builtins__.int.__pow__" : builtins_int_pow, |
paul@261 | 472 | "__builtins__.int.__iadd__" : builtins_int_add, |
paul@261 | 473 | "__builtins__.int.__bool__" : builtins_int_bool, |
paul@261 | 474 | "__builtins__.int.__neg__" : builtins_int_neg, |
paul@261 | 475 | "__builtins__.int.__lt__" : builtins_int_lt, |
paul@261 | 476 | "__builtins__.int.__le__" : builtins_int_le, |
paul@261 | 477 | "__builtins__.int.__gt__" : builtins_int_gt, |
paul@261 | 478 | "__builtins__.int.__ge__" : builtins_int_ge, |
paul@261 | 479 | "__builtins__.int.__eq__" : builtins_int_eq, |
paul@261 | 480 | "__builtins__.int.__ne__" : builtins_int_ne, |
paul@261 | 481 | "__builtins__.int.__and__" : builtins_int_and, |
paul@261 | 482 | "__builtins__.int.__rand__" : builtins_int_and, |
paul@261 | 483 | "__builtins__.int.__or__" : builtins_int_or, |
paul@261 | 484 | "__builtins__.int.__ror__" : builtins_int_or, |
paul@261 | 485 | "__builtins__.bool.__bool__" : builtins_bool_bool, |
paul@261 | 486 | "__builtins__.list.__getitem__" : builtins_list_getitem, |
paul@261 | 487 | "__builtins__.list.__len__" : builtins_list_len, |
paul@261 | 488 | "__builtins__.list.append" : builtins_list_append, |
paul@261 | 489 | "__builtins__.tuple.__len__" : builtins_tuple_len, |
paul@261 | 490 | "__builtins__.tuple.__getitem__" : builtins_tuple_getitem, |
paul@262 | 491 | "__builtins__.basestring.__lt__" : builtins_str_lt, |
paul@262 | 492 | "__builtins__.basestring.__le__" : builtins_str_le, |
paul@262 | 493 | "__builtins__.basestring.__gt__" : builtins_str_gt, |
paul@262 | 494 | "__builtins__.basestring.__ge__" : builtins_str_ge, |
paul@262 | 495 | "__builtins__.basestring.__eq__" : builtins_str_eq, |
paul@262 | 496 | "__builtins__.basestring.__ne__" : builtins_str_ne, |
paul@261 | 497 | |
paul@261 | 498 | # Native initialisers: |
paul@261 | 499 | |
paul@261 | 500 | "__builtins__.object.__init__" : builtins_object_init, # NOTE: A no-operation. |
paul@261 | 501 | "__builtins__.BaseException.__init__" : builtins_object_init, # NOTE: To be made distinct, potentially in the builtins module. |
paul@261 | 502 | |
paul@261 | 503 | # Native instantiators: |
paul@261 | 504 | |
paul@261 | 505 | "__builtins__.list" : builtins_list_new, |
paul@261 | 506 | } |
paul@261 | 507 | |
paul@261 | 508 | # vim: tabstop=4 expandtab shiftwidth=4 |