Lines Matching full:symbols

178   # Extract the list of symbols from the given file, which is assumed to be
214         # seems to have a bug where it prints the mangled version of symbols
219         # If we don't know all the symbols, or the symbol is one of them,
228         # Get all the symbols with this prefix.
233         # If we found too many possible symbols, ignore this as a prefix.
257   # Simply strategy, just return symbols in order of occurrence, even across
259   return uniq(s for symbols in symbol_lists for s in symbols)
267   uniq_lists = [list(uniq(symbols)) for symbols in symbol_lists]
271   for symbols in uniq_lists:
272     for a,b in zip(symbols[:-1], symbols[1:]):
277   # Emit all the symbols, but make sure to always emit all successors from any
284     for symbols in symbol_lists
285     for node in symbols
289   # Form the order file by just putting the most commonly occurring symbols
293   for symbols in symbol_lists:
294     for a in symbols:
302   # Randomize the symbols.
303   merged_symbols = uniq(s for symbols in symbol_lists
304                           for s in symbols)
309   # Alphabetize the symbols.
310   merged_symbols = list(set(s for symbols in symbol_lists for s in symbols))
322     help="Path to the binary being ordered (for getting all symbols)",
327   parser.add_argument("--show-missing-symbols", dest="show_missing_symbols",
328     help="show symbols which are 'fixed up' to a valid name (requires --binary)",
330   parser.add_argument("--output-unordered-symbols",
332     help="write a list of the unordered symbols to PATH (requires --binary)",
339   # If the user gave us a binary, get all the symbols in the binary by
347      print("found %d symbols in binary" % len(all_symbols))
376   # Report to the user on what percentage of symbols are present in the order
380     print("note: order file contains %d/%d symbols (%.2f%%)" % (