paul@92 | 1 | #!/usr/bin/env python |
paul@92 | 2 | |
paul@92 | 3 | """ |
paul@95 | 4 | Optimise object layouts and generate access instruction plans. |
paul@92 | 5 | |
paul@92 | 6 | Copyright (C) 2014, 2015, 2016 Paul Boddie <paul@boddie.org.uk> |
paul@92 | 7 | |
paul@92 | 8 | This program is free software; you can redistribute it and/or modify it under |
paul@92 | 9 | the terms of the GNU General Public License as published by the Free Software |
paul@92 | 10 | Foundation; either version 3 of the License, or (at your option) any later |
paul@92 | 11 | version. |
paul@92 | 12 | |
paul@92 | 13 | This program is distributed in the hope that it will be useful, but WITHOUT |
paul@92 | 14 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS |
paul@92 | 15 | FOR A PARTICULAR PURPOSE. See the GNU General Public License for more |
paul@92 | 16 | details. |
paul@92 | 17 | |
paul@92 | 18 | You should have received a copy of the GNU General Public License along with |
paul@92 | 19 | this program. If not, see <http://www.gnu.org/licenses/>. |
paul@92 | 20 | """ |
paul@92 | 21 | |
paul@92 | 22 | from common import add_counter_item, get_attrname_from_location, init_item, \ |
paul@92 | 23 | sorted_output |
paul@94 | 24 | from encoders import encode_access_location, encode_instruction, get_kinds |
paul@92 | 25 | from os.path import exists, join |
paul@92 | 26 | from os import makedirs |
paul@92 | 27 | from referencing import Reference |
paul@92 | 28 | |
paul@92 | 29 | class Optimiser: |
paul@92 | 30 | |
paul@92 | 31 | "Optimise objects in a program." |
paul@92 | 32 | |
paul@92 | 33 | def __init__(self, importer, deducer, output): |
paul@92 | 34 | |
paul@92 | 35 | """ |
paul@92 | 36 | Initialise an instance using the given 'importer' and 'deducer' that |
paul@92 | 37 | will perform the arrangement of attributes for program objects, writing |
paul@92 | 38 | the results to the given 'output' directory. |
paul@92 | 39 | """ |
paul@92 | 40 | |
paul@92 | 41 | self.importer = importer |
paul@92 | 42 | self.deducer = deducer |
paul@92 | 43 | self.output = output |
paul@92 | 44 | |
paul@92 | 45 | # Locations/offsets of attributes in objects. |
paul@92 | 46 | |
paul@92 | 47 | self.locations = None |
paul@92 | 48 | self.attr_locations = None |
paul@92 | 49 | self.all_attrnames = None |
paul@92 | 50 | |
paul@92 | 51 | # Locations of parameters in parameter tables. |
paul@92 | 52 | |
paul@92 | 53 | self.arg_locations = None |
paul@92 | 54 | self.param_locations = None |
paul@92 | 55 | self.all_paramnames = None |
paul@92 | 56 | |
paul@92 | 57 | # Specific attribute access information. |
paul@92 | 58 | |
paul@92 | 59 | self.access_plans = {} |
paul@94 | 60 | self.access_instructions = {} |
paul@92 | 61 | |
paul@92 | 62 | # Object structure information. |
paul@92 | 63 | |
paul@92 | 64 | self.structures = {} |
paul@92 | 65 | self.attr_table = {} |
paul@92 | 66 | |
paul@92 | 67 | # Parameter list information. |
paul@92 | 68 | |
paul@92 | 69 | self.parameters = {} |
paul@92 | 70 | self.param_table = {} |
paul@92 | 71 | |
paul@92 | 72 | # Constant literal information. |
paul@92 | 73 | |
paul@92 | 74 | self.constants = [] |
paul@92 | 75 | self.constant_numbers = {} |
paul@92 | 76 | |
paul@92 | 77 | # Optimiser activities. |
paul@92 | 78 | |
paul@92 | 79 | self.populate_objects() |
paul@92 | 80 | self.position_attributes() |
paul@92 | 81 | self.populate_parameters() |
paul@92 | 82 | self.position_parameters() |
paul@92 | 83 | self.populate_tables() |
paul@92 | 84 | self.populate_constants() |
paul@92 | 85 | self.refine_access_plans() |
paul@94 | 86 | self.initialise_access_instructions() |
paul@92 | 87 | |
paul@92 | 88 | def to_output(self): |
paul@92 | 89 | |
paul@92 | 90 | "Write the output files using optimisation information." |
paul@92 | 91 | |
paul@92 | 92 | if not exists(self.output): |
paul@92 | 93 | makedirs(self.output) |
paul@92 | 94 | |
paul@92 | 95 | self.write_objects() |
paul@92 | 96 | |
paul@92 | 97 | def write_objects(self): |
paul@92 | 98 | |
paul@92 | 99 | """ |
paul@92 | 100 | Write object-related output. |
paul@92 | 101 | |
paul@92 | 102 | The locations are a list of positions indicating the attributes residing |
paul@92 | 103 | at each position in the different structures in a program. |
paul@92 | 104 | |
paul@92 | 105 | ---- |
paul@92 | 106 | |
paul@92 | 107 | The parameter locations are a list of positions indicating the parameters |
paul@92 | 108 | residing at each position in the different parameter lists in a program. |
paul@92 | 109 | |
paul@92 | 110 | ---- |
paul@92 | 111 | |
paul@92 | 112 | Each attribute plan provides attribute details in the following format: |
paul@92 | 113 | |
paul@92 | 114 | location " " name " " test " " test type " " base |
paul@92 | 115 | " " traversed attributes " " traversed attribute ambiguity |
paul@92 | 116 | " " attributes to traverse " " attribute ambiguity |
paul@92 | 117 | " " context " " access method " " static attribute |
paul@92 | 118 | |
paul@92 | 119 | Locations have the following format: |
paul@92 | 120 | |
paul@92 | 121 | qualified name of scope "." local name ":" name version |
paul@92 | 122 | |
paul@92 | 123 | ---- |
paul@92 | 124 | |
paul@92 | 125 | The structures are presented as a table in the following format: |
paul@92 | 126 | |
paul@92 | 127 | qualified name " " attribute names |
paul@92 | 128 | |
paul@92 | 129 | The attribute names are separated by ", " characters and indicate the |
paul@92 | 130 | attribute provided at each position in the structure associated with the |
paul@92 | 131 | given type. Where no attribute is provided at a particular location |
paul@92 | 132 | within a structure, "-" is given. |
paul@92 | 133 | |
paul@92 | 134 | ---- |
paul@92 | 135 | |
paul@92 | 136 | The parameters are presented as a table in the following format: |
paul@92 | 137 | |
paul@92 | 138 | qualified name " " parameter details |
paul@92 | 139 | |
paul@92 | 140 | The parameter details are separated by ", " characters and indicate |
paul@92 | 141 | the parameter name and list position for each parameter described at |
paul@92 | 142 | each location in the parameter table associated with the given |
paul@92 | 143 | function. Where no parameter details are provided at a particular |
paul@92 | 144 | location within a parameter table, "-" is given. The name and list |
paul@92 | 145 | position are separated by a colon (":"). |
paul@92 | 146 | |
paul@92 | 147 | ---- |
paul@92 | 148 | |
paul@92 | 149 | The attribute table is presented as a table in the following format: |
paul@92 | 150 | |
paul@92 | 151 | qualified name " " attribute identifiers |
paul@92 | 152 | |
paul@92 | 153 | Instead of attribute names, identifiers defined according to the order |
paul@92 | 154 | given in the "attrnames" file are employed to denote the attributes |
paul@92 | 155 | featured in each type's structure. Where no attribute is provided at a |
paul@92 | 156 | particular location within a structure, "-" is given. |
paul@92 | 157 | |
paul@92 | 158 | ---- |
paul@92 | 159 | |
paul@92 | 160 | The parameter table is presented as a table in the following format: |
paul@92 | 161 | |
paul@92 | 162 | qualified name " " parameter details |
paul@92 | 163 | |
paul@92 | 164 | Instead of parameter names, identifiers defined according to the order |
paul@92 | 165 | given in the "paramnames" file are employed to denote the parameters |
paul@92 | 166 | featured in each function's parameter table. Where no parameter is |
paul@92 | 167 | provided at a particular location within a table, "-" is given. |
paul@92 | 168 | |
paul@92 | 169 | ---- |
paul@92 | 170 | |
paul@92 | 171 | The ordered list of attribute names is given in the "attrnames" file. |
paul@92 | 172 | |
paul@92 | 173 | ---- |
paul@92 | 174 | |
paul@92 | 175 | The ordered list of parameter names is given in the "paramnames" file. |
paul@92 | 176 | |
paul@92 | 177 | ---- |
paul@92 | 178 | |
paul@92 | 179 | The ordered list of constant literals is given in the "constants" file. |
paul@92 | 180 | """ |
paul@92 | 181 | |
paul@92 | 182 | f = open(join(self.output, "locations"), "w") |
paul@92 | 183 | try: |
paul@92 | 184 | for attrnames in self.locations: |
paul@92 | 185 | print >>f, sorted_output(attrnames) |
paul@92 | 186 | |
paul@92 | 187 | finally: |
paul@92 | 188 | f.close() |
paul@92 | 189 | |
paul@92 | 190 | f = open(join(self.output, "parameter_locations"), "w") |
paul@92 | 191 | try: |
paul@92 | 192 | for argnames in self.arg_locations: |
paul@92 | 193 | print >>f, sorted_output(argnames) |
paul@92 | 194 | |
paul@92 | 195 | finally: |
paul@92 | 196 | f.close() |
paul@92 | 197 | |
paul@92 | 198 | f = open(join(self.output, "attribute_plans"), "w") |
paul@92 | 199 | try: |
paul@92 | 200 | access_plans = self.access_plans.items() |
paul@92 | 201 | access_plans.sort() |
paul@92 | 202 | |
paul@92 | 203 | for location, (name, test, test_type, base, |
paul@92 | 204 | traversed, traversed_ambiguity, |
paul@94 | 205 | attrnames, attrnames_ambiguity, context, |
paul@94 | 206 | first_method, final_method, attr) in access_plans: |
paul@92 | 207 | |
paul@92 | 208 | print >>f, encode_access_location(location), \ |
paul@92 | 209 | name, test, test_type or "{}", \ |
paul@92 | 210 | base or "{}", \ |
paul@92 | 211 | ".".join(traversed) or "{}", \ |
paul@92 | 212 | ".".join(map(str, traversed_ambiguity)) or "{}", \ |
paul@92 | 213 | ".".join(map(str, attrnames_ambiguity)) or "{}", \ |
paul@92 | 214 | ".".join(attrnames) or "{}", \ |
paul@94 | 215 | context, first_method, final_method, attr or "{}" |
paul@94 | 216 | |
paul@94 | 217 | finally: |
paul@94 | 218 | f.close() |
paul@94 | 219 | |
paul@94 | 220 | f = open(join(self.output, "instruction_plans"), "w") |
paul@94 | 221 | try: |
paul@94 | 222 | access_instructions = self.access_instructions.items() |
paul@94 | 223 | access_instructions.sort() |
paul@94 | 224 | |
paul@94 | 225 | for location, instructions in access_instructions: |
paul@94 | 226 | print >>f, encode_access_location(location), "..." |
paul@94 | 227 | for instruction in instructions: |
paul@94 | 228 | print >>f, encode_instruction(instruction) |
paul@94 | 229 | print >>f |
paul@92 | 230 | |
paul@92 | 231 | finally: |
paul@92 | 232 | f.close() |
paul@92 | 233 | |
paul@92 | 234 | f = open(join(self.output, "structures"), "w") |
paul@92 | 235 | try: |
paul@92 | 236 | structures = self.structures.items() |
paul@92 | 237 | structures.sort() |
paul@92 | 238 | |
paul@92 | 239 | for name, attrnames in structures: |
paul@92 | 240 | print >>f, name, ", ".join([s or "-" for s in attrnames]) |
paul@92 | 241 | |
paul@92 | 242 | finally: |
paul@92 | 243 | f.close() |
paul@92 | 244 | |
paul@92 | 245 | f = open(join(self.output, "parameters"), "w") |
paul@92 | 246 | try: |
paul@92 | 247 | parameters = self.parameters.items() |
paul@92 | 248 | parameters.sort() |
paul@92 | 249 | |
paul@92 | 250 | for name, argnames in parameters: |
paul@92 | 251 | print >>f, name, ", ".join([s and ("%s:%d" % s) or "-" for s in argnames]) |
paul@92 | 252 | |
paul@92 | 253 | finally: |
paul@92 | 254 | f.close() |
paul@92 | 255 | |
paul@92 | 256 | f = open(join(self.output, "attrtable"), "w") |
paul@92 | 257 | try: |
paul@92 | 258 | attr_table = self.attr_table.items() |
paul@92 | 259 | attr_table.sort() |
paul@92 | 260 | |
paul@92 | 261 | for name, attrcodes in attr_table: |
paul@92 | 262 | print >>f, name, ", ".join([i is not None and str(i) or "-" for i in attrcodes]) |
paul@92 | 263 | |
paul@92 | 264 | finally: |
paul@92 | 265 | f.close() |
paul@92 | 266 | |
paul@92 | 267 | f = open(join(self.output, "paramtable"), "w") |
paul@92 | 268 | try: |
paul@92 | 269 | param_table = self.param_table.items() |
paul@92 | 270 | param_table.sort() |
paul@92 | 271 | |
paul@92 | 272 | for name, paramcodes in param_table: |
paul@92 | 273 | print >>f, name, ", ".join([s and ("%d:%d" % s) or "-" for s in paramcodes]) |
paul@92 | 274 | |
paul@92 | 275 | finally: |
paul@92 | 276 | f.close() |
paul@92 | 277 | |
paul@92 | 278 | f = open(join(self.output, "attrnames"), "w") |
paul@92 | 279 | try: |
paul@92 | 280 | for name in self.all_attrnames: |
paul@92 | 281 | print >>f, name |
paul@92 | 282 | |
paul@92 | 283 | finally: |
paul@92 | 284 | f.close() |
paul@92 | 285 | |
paul@92 | 286 | f = open(join(self.output, "paramnames"), "w") |
paul@92 | 287 | try: |
paul@92 | 288 | for name in self.all_paramnames: |
paul@92 | 289 | print >>f, name |
paul@92 | 290 | |
paul@92 | 291 | finally: |
paul@92 | 292 | f.close() |
paul@92 | 293 | |
paul@92 | 294 | f = open(join(self.output, "constants"), "w") |
paul@92 | 295 | try: |
paul@92 | 296 | constants = [(n, value) for (value, n) in self.constants.items()] |
paul@92 | 297 | constants.sort() |
paul@92 | 298 | for n, value in constants: |
paul@92 | 299 | print >>f, repr(value) |
paul@92 | 300 | |
paul@92 | 301 | finally: |
paul@92 | 302 | f.close() |
paul@92 | 303 | |
paul@92 | 304 | def populate_objects(self): |
paul@92 | 305 | |
paul@92 | 306 | "Populate objects using attribute and usage information." |
paul@92 | 307 | |
paul@92 | 308 | all_attrs = {} |
paul@92 | 309 | |
paul@92 | 310 | # Partition attributes into separate sections so that class and instance |
paul@92 | 311 | # attributes are treated separately. |
paul@92 | 312 | |
paul@92 | 313 | for source, objtype in [ |
paul@92 | 314 | (self.importer.all_class_attrs, "<class>"), |
paul@92 | 315 | (self.importer.all_instance_attrs, "<instance>"), |
paul@92 | 316 | (self.importer.all_module_attrs, "<module>") |
paul@92 | 317 | ]: |
paul@92 | 318 | for name, attrs in source.items(): |
paul@92 | 319 | all_attrs[(objtype, name)] = attrs |
paul@92 | 320 | |
paul@92 | 321 | self.locations = get_allocated_locations(all_attrs, get_attributes_and_sizes) |
paul@92 | 322 | |
paul@92 | 323 | def populate_parameters(self): |
paul@92 | 324 | |
paul@92 | 325 | "Populate parameter tables using parameter information." |
paul@92 | 326 | |
paul@92 | 327 | self.arg_locations = get_allocated_locations(self.importer.function_parameters, get_parameters_and_sizes) |
paul@92 | 328 | |
paul@92 | 329 | def position_attributes(self): |
paul@92 | 330 | |
paul@92 | 331 | "Position specific attribute references." |
paul@92 | 332 | |
paul@92 | 333 | # Reverse the location mappings. |
paul@92 | 334 | |
paul@92 | 335 | attr_locations = self.attr_locations = {} |
paul@92 | 336 | |
paul@92 | 337 | for i, attrnames in enumerate(self.locations): |
paul@92 | 338 | for attrname in attrnames: |
paul@92 | 339 | attr_locations[attrname] = i |
paul@92 | 340 | |
paul@92 | 341 | # Record the structures. |
paul@92 | 342 | |
paul@92 | 343 | for source, objtype in [ |
paul@92 | 344 | (self.importer.all_class_attrs, "<class>"), |
paul@92 | 345 | (self.importer.all_instance_attrs, "<instance>"), |
paul@92 | 346 | (self.importer.all_module_attrs, "<module>") |
paul@92 | 347 | ]: |
paul@92 | 348 | |
paul@92 | 349 | for name, attrnames in source.items(): |
paul@92 | 350 | key = Reference(objtype, name) |
paul@92 | 351 | l = self.structures[key] = [None] * len(attrnames) |
paul@92 | 352 | for attrname in attrnames: |
paul@92 | 353 | position = attr_locations[attrname] |
paul@92 | 354 | if position >= len(l): |
paul@92 | 355 | l.extend([None] * (position - len(l) + 1)) |
paul@92 | 356 | l[position] = attrname |
paul@92 | 357 | |
paul@92 | 358 | def refine_access_plans(self): |
paul@92 | 359 | |
paul@92 | 360 | "Augment deduced access plans with attribute position information." |
paul@92 | 361 | |
paul@92 | 362 | for access_location, access_plan in self.deducer.access_plans.items(): |
paul@92 | 363 | |
paul@92 | 364 | # Obtain the access details. |
paul@92 | 365 | |
paul@92 | 366 | name, test, test_type, base, traversed, attrnames, \ |
paul@94 | 367 | context, first_method, final_method, origin = access_plan |
paul@92 | 368 | |
paul@92 | 369 | traversed_ambiguity = self.get_ambiguity_for_attributes(traversed) |
paul@92 | 370 | attrnames_ambiguity = self.get_ambiguity_for_attributes(attrnames) |
paul@92 | 371 | |
paul@92 | 372 | self.access_plans[access_location] = \ |
paul@92 | 373 | name, test, test_type, base, traversed, traversed_ambiguity, \ |
paul@94 | 374 | attrnames, attrnames_ambiguity, context, \ |
paul@94 | 375 | first_method, final_method, origin |
paul@94 | 376 | |
paul@94 | 377 | def initialise_access_instructions(self): |
paul@94 | 378 | |
paul@94 | 379 | "Expand access plans into instruction sequences." |
paul@94 | 380 | |
paul@94 | 381 | for access_location, access_plan in self.access_plans.items(): |
paul@94 | 382 | |
paul@94 | 383 | # Obtain the access details. |
paul@94 | 384 | |
paul@94 | 385 | name, test, test_type, base, traversed, traversed_ambiguity, \ |
paul@94 | 386 | attrnames, attrnames_ambiguity, context, \ |
paul@94 | 387 | first_method, final_method, origin = access_plan |
paul@94 | 388 | |
paul@94 | 389 | instructions = [] |
paul@94 | 390 | emit = instructions.append |
paul@94 | 391 | |
paul@94 | 392 | if base: |
paul@94 | 393 | original_accessor = base |
paul@94 | 394 | else: |
paul@95 | 395 | original_accessor = "<expr>" # use a generic placeholder |
paul@94 | 396 | |
paul@94 | 397 | # Prepare for any first attribute access. |
paul@94 | 398 | |
paul@94 | 399 | if traversed: |
paul@94 | 400 | attrname = traversed[0] |
paul@94 | 401 | del traversed[0] |
paul@94 | 402 | elif attrnames: |
paul@94 | 403 | attrname = attrnames[0] |
paul@94 | 404 | del attrnames[0] |
paul@94 | 405 | |
paul@94 | 406 | access_first_attribute = final_method == "access" or traversed or attrnames |
paul@94 | 407 | |
paul@94 | 408 | # Set the context if already available. |
paul@94 | 409 | |
paul@94 | 410 | if context == "original-accessor": |
paul@94 | 411 | emit(("set_context", original_accessor)) |
paul@95 | 412 | accessor = "context" |
paul@94 | 413 | elif context == "base": |
paul@94 | 414 | emit(("set_context", base)) |
paul@95 | 415 | accessor = "context" |
paul@95 | 416 | elif context == "final-accessor" or access_first_attribute: |
paul@95 | 417 | emit(("set_accessor", original_accessor)) |
paul@95 | 418 | accessor = "accessor" |
paul@94 | 419 | |
paul@94 | 420 | # Apply any test. |
paul@94 | 421 | |
paul@95 | 422 | if test == "specific-type": |
paul@94 | 423 | emit(("test_specific_type", accessor, test_type)) |
paul@95 | 424 | elif test == "specific-instance": |
paul@94 | 425 | emit(("test_specific_instance", accessor, test_type)) |
paul@95 | 426 | elif test == "specific-object": |
paul@94 | 427 | emit(("test_specific_object", accessor, test_type)) |
paul@95 | 428 | elif test == "common-type": |
paul@94 | 429 | emit(("test_common_type", accessor, test_type)) |
paul@95 | 430 | elif test == "common-instance": |
paul@94 | 431 | emit(("test_common_instance", accessor, test_type)) |
paul@95 | 432 | elif test == "common-object": |
paul@94 | 433 | emit(("test_common_object", accessor, test_type)) |
paul@94 | 434 | |
paul@94 | 435 | # Perform the first or final access. |
paul@94 | 436 | # The access only needs performing if the resulting accessor is used. |
paul@94 | 437 | |
paul@94 | 438 | if access_first_attribute: |
paul@94 | 439 | |
paul@94 | 440 | if first_method == "relative-class": |
paul@95 | 441 | emit(("set_accessor", ("load_via_class", accessor, attrname))) |
paul@94 | 442 | elif first_method == "relative-object": |
paul@95 | 443 | emit(("set_accessor", ("load_via_object", accessor, attrname))) |
paul@94 | 444 | elif first_method == "relative-object-class": |
paul@95 | 445 | emit(("set_accessor", ("get_class_and_load", accessor, attrname))) |
paul@94 | 446 | elif first_method == "check-class": |
paul@95 | 447 | emit(("set_accessor", ("check_and_load_via_class", accessor, attrname))) |
paul@94 | 448 | elif first_method == "check-object": |
paul@95 | 449 | emit(("set_accessor", ("check_and_load_via_object", accessor, attrname))) |
paul@94 | 450 | elif first_method == "check-object-class": |
paul@95 | 451 | emit(("set_accessor", ("get_class_check_and_load", accessor, attrname))) |
paul@94 | 452 | |
paul@94 | 453 | # Obtain an accessor. |
paul@94 | 454 | |
paul@94 | 455 | remaining = len(traversed + attrnames) |
paul@94 | 456 | |
paul@94 | 457 | if traversed: |
paul@94 | 458 | for attrname in traversed: |
paul@94 | 459 | |
paul@94 | 460 | # Set the context, if appropriate. |
paul@94 | 461 | |
paul@94 | 462 | if remaining == 1 and context == "final-accessor": |
paul@94 | 463 | emit(("set_context", "accessor")) |
paul@94 | 464 | |
paul@94 | 465 | # Perform the access only if not achieved directly. |
paul@94 | 466 | |
paul@94 | 467 | if remaining > 1 or final_method == "access": |
paul@94 | 468 | emit(("set_accessor", ("load_unambiguous", "accessor", attrname))) |
paul@94 | 469 | |
paul@94 | 470 | remaining -= 1 |
paul@94 | 471 | |
paul@94 | 472 | if attrnames: |
paul@94 | 473 | for attrname, ambiguity in zip(attrnames, attrnames_ambiguity): |
paul@94 | 474 | |
paul@94 | 475 | # Set the context, if appropriate. |
paul@94 | 476 | |
paul@94 | 477 | if remaining == 1 and context == "final-accessor": |
paul@94 | 478 | emit(("set_context", "accessor")) |
paul@94 | 479 | |
paul@94 | 480 | # Perform the access only if not achieved directly. |
paul@94 | 481 | |
paul@94 | 482 | if remaining > 1 or final_method == "access": |
paul@94 | 483 | if ambiguity == 1: |
paul@94 | 484 | emit(("set_accessor", ("load_unambiguous", "accessor", attrname))) |
paul@94 | 485 | else: |
paul@94 | 486 | emit(("set_accessor", ("load_ambiguous", "accessor", attrname))) |
paul@94 | 487 | |
paul@94 | 488 | remaining -= 1 |
paul@94 | 489 | |
paul@94 | 490 | if final_method == "assign": |
paul@94 | 491 | emit(("store_member", origin, "<expr>")) |
paul@94 | 492 | elif final_method == "static": |
paul@94 | 493 | emit(("load_static", origin)) |
paul@94 | 494 | |
paul@94 | 495 | self.access_instructions[access_location] = instructions |
paul@92 | 496 | |
paul@92 | 497 | def get_ambiguity_for_attributes(self, attrnames): |
paul@92 | 498 | |
paul@92 | 499 | """ |
paul@92 | 500 | Return a list of attribute position alternatives corresponding to each |
paul@92 | 501 | of the given 'attrnames'. |
paul@92 | 502 | """ |
paul@92 | 503 | |
paul@92 | 504 | ambiguity = [] |
paul@92 | 505 | |
paul@92 | 506 | for attrname in attrnames: |
paul@92 | 507 | position = self.attr_locations[attrname] |
paul@92 | 508 | ambiguity.append(len(self.locations[position])) |
paul@92 | 509 | |
paul@92 | 510 | return ambiguity |
paul@92 | 511 | |
paul@92 | 512 | def position_parameters(self): |
paul@92 | 513 | |
paul@92 | 514 | "Position the parameters for each function's parameter table." |
paul@92 | 515 | |
paul@92 | 516 | # Reverse the location mappings. |
paul@92 | 517 | |
paul@92 | 518 | param_locations = self.param_locations = {} |
paul@92 | 519 | |
paul@92 | 520 | for i, argnames in enumerate(self.arg_locations): |
paul@92 | 521 | for argname in argnames: |
paul@92 | 522 | param_locations[argname] = i |
paul@92 | 523 | |
paul@92 | 524 | for name, argnames in self.importer.function_parameters.items(): |
paul@92 | 525 | l = self.parameters[name] = [None] * len(argnames) |
paul@92 | 526 | |
paul@92 | 527 | # Store an entry for the name along with the name's position in the |
paul@92 | 528 | # parameter list. |
paul@92 | 529 | |
paul@92 | 530 | for pos, argname in enumerate(argnames): |
paul@92 | 531 | position = param_locations[argname] |
paul@92 | 532 | if position >= len(l): |
paul@92 | 533 | l.extend([None] * (position - len(l) + 1)) |
paul@92 | 534 | l[position] = (argname, pos) |
paul@92 | 535 | |
paul@92 | 536 | def populate_tables(self): |
paul@92 | 537 | |
paul@92 | 538 | """ |
paul@92 | 539 | Assign identifiers to attributes and encode structure information using |
paul@92 | 540 | these identifiers. |
paul@92 | 541 | """ |
paul@92 | 542 | |
paul@92 | 543 | self.all_attrnames, d = self._get_name_mapping(self.attr_locations) |
paul@92 | 544 | |
paul@92 | 545 | # Record the numbers indicating the locations of the names. |
paul@92 | 546 | |
paul@92 | 547 | for key, attrnames in self.structures.items(): |
paul@92 | 548 | l = self.attr_table[key] = [] |
paul@92 | 549 | for attrname in attrnames: |
paul@92 | 550 | if attrname is None: |
paul@92 | 551 | l.append(None) |
paul@92 | 552 | else: |
paul@92 | 553 | l.append(d[attrname]) |
paul@92 | 554 | |
paul@92 | 555 | self.all_paramnames, d = self._get_name_mapping(self.param_locations) |
paul@92 | 556 | |
paul@92 | 557 | # Record the numbers indicating the locations of the names. |
paul@92 | 558 | |
paul@92 | 559 | for key, values in self.parameters.items(): |
paul@92 | 560 | l = self.param_table[key] = [] |
paul@92 | 561 | for value in values: |
paul@92 | 562 | if value is None: |
paul@92 | 563 | l.append(None) |
paul@92 | 564 | else: |
paul@92 | 565 | name, pos = value |
paul@92 | 566 | l.append((d[name], pos)) |
paul@92 | 567 | |
paul@92 | 568 | def _get_name_mapping(self, locations): |
paul@92 | 569 | |
paul@92 | 570 | """ |
paul@92 | 571 | Get a sorted list of names from 'locations', then map them to |
paul@92 | 572 | identifying numbers. Return the list and the mapping. |
paul@92 | 573 | """ |
paul@92 | 574 | |
paul@92 | 575 | all_names = locations.keys() |
paul@92 | 576 | all_names.sort() |
paul@92 | 577 | return all_names, dict([(name, i) for i, name in enumerate(all_names)]) |
paul@92 | 578 | |
paul@92 | 579 | def populate_constants(self): |
paul@92 | 580 | |
paul@92 | 581 | """ |
paul@92 | 582 | Obtain a collection of distinct constant literals, building a mapping |
paul@92 | 583 | from constant references to those in this collection. |
paul@92 | 584 | """ |
paul@92 | 585 | |
paul@92 | 586 | # Obtain mappings from constant values to identifiers. |
paul@92 | 587 | |
paul@92 | 588 | self.constants = {} |
paul@92 | 589 | |
paul@92 | 590 | for path, constants in self.importer.all_constants.items(): |
paul@92 | 591 | for constant, n in constants.items(): |
paul@92 | 592 | |
paul@92 | 593 | # Record constants and obtain a number for them. |
paul@92 | 594 | |
paul@92 | 595 | add_counter_item(self.constants, constant) |
paul@92 | 596 | |
paul@92 | 597 | self.constant_numbers = {} |
paul@92 | 598 | |
paul@92 | 599 | for name, (value, value_type) in self.importer.all_constant_values.items(): |
paul@92 | 600 | self.constant_numbers[name] = self.constants[value] |
paul@92 | 601 | |
paul@92 | 602 | def combine_rows(a, b): |
paul@92 | 603 | c = [] |
paul@92 | 604 | for i, j in zip(a, b): |
paul@92 | 605 | if i is None or j is None: |
paul@92 | 606 | c.append(i or j) |
paul@92 | 607 | else: |
paul@92 | 608 | return None |
paul@92 | 609 | return c |
paul@92 | 610 | |
paul@92 | 611 | def get_attributes_and_sizes(d): |
paul@92 | 612 | |
paul@92 | 613 | """ |
paul@92 | 614 | Return a matrix of attributes, a list of type names corresponding to columns |
paul@92 | 615 | in the matrix, and a list of ranked sizes each indicating... |
paul@92 | 616 | |
paul@92 | 617 | * a weighted size depending on the kind of object |
paul@92 | 618 | * the minimum size of an object employing an attribute |
paul@92 | 619 | * the number of free columns in the matrix for the attribute |
paul@92 | 620 | * the attribute name itself |
paul@92 | 621 | """ |
paul@92 | 622 | |
paul@92 | 623 | attrs = {} |
paul@92 | 624 | sizes = {} |
paul@92 | 625 | objtypes = {} |
paul@92 | 626 | |
paul@92 | 627 | for name, attrnames in d.items(): |
paul@92 | 628 | objtype, _name = name |
paul@92 | 629 | |
paul@92 | 630 | for attrname in attrnames: |
paul@92 | 631 | |
paul@92 | 632 | # Record each type supporting the attribute. |
paul@92 | 633 | |
paul@92 | 634 | init_item(attrs, attrname, set) |
paul@92 | 635 | attrs[attrname].add(name) |
paul@92 | 636 | |
paul@92 | 637 | # Maintain a record of the smallest object size supporting the given |
paul@92 | 638 | # attribute. |
paul@92 | 639 | |
paul@92 | 640 | if not sizes.has_key(attrname): |
paul@92 | 641 | sizes[attrname] = len(attrnames) |
paul@92 | 642 | else: |
paul@92 | 643 | sizes[attrname] = min(sizes[attrname], len(attrnames)) |
paul@92 | 644 | |
paul@92 | 645 | # Record the object types/kinds supporting the attribute. |
paul@92 | 646 | |
paul@92 | 647 | init_item(objtypes, attrname, set) |
paul@92 | 648 | objtypes[attrname].add(objtype) |
paul@92 | 649 | |
paul@92 | 650 | # Obtain attribute details in order of size and occupancy. |
paul@92 | 651 | |
paul@92 | 652 | names = d.keys() |
paul@92 | 653 | |
paul@92 | 654 | rsizes = [] |
paul@92 | 655 | for attrname, size in sizes.items(): |
paul@92 | 656 | priority = "<instance>" in objtypes[attrname] and 0.5 or 1 |
paul@92 | 657 | occupied = len(attrs[attrname]) |
paul@92 | 658 | key = (priority * size, size, len(names) - occupied, attrname) |
paul@92 | 659 | rsizes.append(key) |
paul@92 | 660 | |
paul@92 | 661 | rsizes.sort() |
paul@92 | 662 | |
paul@92 | 663 | # Make a matrix of attributes. |
paul@92 | 664 | |
paul@92 | 665 | matrix = {} |
paul@92 | 666 | for attrname, types in attrs.items(): |
paul@92 | 667 | row = [] |
paul@92 | 668 | for name in names: |
paul@92 | 669 | if name in types: |
paul@92 | 670 | row.append(attrname) |
paul@92 | 671 | else: |
paul@92 | 672 | row.append(None) |
paul@92 | 673 | matrix[attrname] = row |
paul@92 | 674 | |
paul@92 | 675 | return matrix, names, rsizes |
paul@92 | 676 | |
paul@92 | 677 | def get_parameters_and_sizes(d): |
paul@92 | 678 | |
paul@92 | 679 | """ |
paul@92 | 680 | Return a matrix of parameters, a list of functions corresponding to columns |
paul@92 | 681 | in the matrix, and a list of ranked sizes each indicating... |
paul@92 | 682 | |
paul@92 | 683 | * a weighted size depending on the kind of object |
paul@92 | 684 | * the minimum size of a parameter list employing a parameter |
paul@92 | 685 | * the number of free columns in the matrix for the parameter |
paul@92 | 686 | * the parameter name itself |
paul@92 | 687 | |
paul@92 | 688 | This is a slightly simpler version of the above 'get_attributes_and_sizes' |
paul@92 | 689 | function. |
paul@92 | 690 | """ |
paul@92 | 691 | |
paul@92 | 692 | params = {} |
paul@92 | 693 | sizes = {} |
paul@92 | 694 | |
paul@92 | 695 | for name, argnames in d.items(): |
paul@92 | 696 | for argname in argnames: |
paul@92 | 697 | |
paul@92 | 698 | # Record each function supporting the parameter. |
paul@92 | 699 | |
paul@92 | 700 | init_item(params, argname, set) |
paul@92 | 701 | params[argname].add(name) |
paul@92 | 702 | |
paul@92 | 703 | # Maintain a record of the smallest parameter list supporting the |
paul@92 | 704 | # given parameter. |
paul@92 | 705 | |
paul@92 | 706 | if not sizes.has_key(argname): |
paul@92 | 707 | sizes[argname] = len(argnames) |
paul@92 | 708 | else: |
paul@92 | 709 | sizes[argname] = min(sizes[argname], len(argnames)) |
paul@92 | 710 | |
paul@92 | 711 | # Obtain attribute details in order of size and occupancy. |
paul@92 | 712 | |
paul@92 | 713 | names = d.keys() |
paul@92 | 714 | |
paul@92 | 715 | rsizes = [] |
paul@92 | 716 | for argname, size in sizes.items(): |
paul@92 | 717 | occupied = len(params[argname]) |
paul@92 | 718 | key = (size, size, len(names) - occupied, argname) |
paul@92 | 719 | rsizes.append(key) |
paul@92 | 720 | |
paul@92 | 721 | rsizes.sort() |
paul@92 | 722 | |
paul@92 | 723 | # Make a matrix of parameters. |
paul@92 | 724 | |
paul@92 | 725 | matrix = {} |
paul@92 | 726 | for argname, types in params.items(): |
paul@92 | 727 | row = [] |
paul@92 | 728 | for name in names: |
paul@92 | 729 | if name in types: |
paul@92 | 730 | row.append(argname) |
paul@92 | 731 | else: |
paul@92 | 732 | row.append(None) |
paul@92 | 733 | matrix[argname] = row |
paul@92 | 734 | |
paul@92 | 735 | return matrix, names, rsizes |
paul@92 | 736 | |
paul@92 | 737 | def get_allocated_locations(d, fn): |
paul@92 | 738 | |
paul@92 | 739 | """ |
paul@92 | 740 | Return a list where each element corresponds to a structure location and |
paul@92 | 741 | contains a set of attribute names that may be stored at that location, given |
paul@92 | 742 | a mapping 'd' whose keys are (object type, object name) tuples and whose |
paul@92 | 743 | values are collections of attributes. |
paul@92 | 744 | """ |
paul@92 | 745 | |
paul@92 | 746 | matrix, names, rsizes = fn(d) |
paul@92 | 747 | allocated = [] |
paul@92 | 748 | |
paul@92 | 749 | x = 0 |
paul@92 | 750 | while x < len(rsizes): |
paul@92 | 751 | weight, size, free, attrname = rsizes[x] |
paul@92 | 752 | base = matrix[attrname] |
paul@92 | 753 | y = x + 1 |
paul@92 | 754 | while y < len(rsizes): |
paul@92 | 755 | _weight, _size, _free, _attrname = rsizes[y] |
paul@92 | 756 | occupied = len(names) - _free |
paul@92 | 757 | if occupied > free: |
paul@92 | 758 | break |
paul@92 | 759 | new = combine_rows(base, matrix[_attrname]) |
paul@92 | 760 | if new: |
paul@92 | 761 | del matrix[_attrname] |
paul@92 | 762 | del rsizes[y] |
paul@92 | 763 | base = new |
paul@92 | 764 | free -= occupied |
paul@92 | 765 | else: |
paul@92 | 766 | y += 1 |
paul@92 | 767 | allocated.append(base) |
paul@92 | 768 | x += 1 |
paul@92 | 769 | |
paul@92 | 770 | # Return the list of attribute names from each row of the allocated |
paul@92 | 771 | # attributes table. |
paul@92 | 772 | |
paul@92 | 773 | return [set([attrname for attrname in attrnames if attrname]) for attrnames in allocated] |
paul@92 | 774 | |
paul@92 | 775 | # vim: tabstop=4 expandtab shiftwidth=4 |