HomeSort by relevance Sort by last modified time
    Searched refs:Stringpool (Results 1 - 19 of 19) sorted by null

  /toolchain/binutils/binutils-2.25/gold/
dynobj.h 28 #include "stringpool.h"
414 // canonicalized in the dynamic Stringpool.
443 write(const Stringpool*, bool is_last, unsigned char*) const;
450 // should be canonicalized in the dynamic Stringpool.
454 // dynamic Stringpool.
517 // dynamic Stringpool. If the name is already present, this does
530 write(const Stringpool*, bool is_last, unsigned char*) const;
537 // canonicalized in the dynamic Stringpool.
541 // canonicalized in the dynamic Stringpool.
553 Versions(const Version_script_info&, Stringpool*);
    [all...]
incremental.h 30 #include "stringpool.h"
100 Incremental_input_entry(Stringpool::Key filename_key, unsigned int arg_serial,
144 // Get the stringpool key for the input filename.
145 Stringpool::Key
234 Stringpool::Key filename_key_;
306 Incremental_script_entry(Stringpool::Key filename_key,
353 Incremental_object_entry(Stringpool::Key filename_key, Object* obj,
376 add_input_section(unsigned int shndx, Stringpool::Key name_key, off_t sh_size)
385 Stringpool::Key
389 // Return the stringpool key of the Nth input section
    [all...]
dynobj.cc     [all...]
symtab.h 35 #include "stringpool.h"
942 // Symbol name (expected to point into a Stringpool).
944 // Symbol version (expected to point into a Stringpool). This may
    [all...]
gdb-index.h 29 #include "stringpool.h"
202 Stringpool::Key name_key;
249 Stringpool stringpool_;
binary.cc 30 #include "stringpool.h"
150 // Build the stringpool for the symbol table.
163 Stringpool strtab;
169 // Build the stringpool for the section name table.
171 Stringpool shstrtab;
311 const Stringpool* shstrtab,
344 const Stringpool* strtab,
layout.h 37 #include "stringpool.h"
713 // Return the Stringpool used for symbol names.
714 const Stringpool*
718 // Return the Stringpool used for dynamic symbol names and dynamic
720 const Stringpool*
    [all...]
merge.h 30 #include "stringpool.h"
501 // Writes the stringpool to a buffer.
506 // Clears all the data in the stringpool, to save on memory.
535 // The key in the Stringpool.
536 Stringpool::Key stringpool_key;
538 Merged_string(section_offset_type offseta, Stringpool::Key stringpool_keya)
561 // As we see the strings, we add them to a Stringpool.
564 // Stringpool.
incremental.cc 90 Stringpool* strtab);
95 Stringpool* strtab, unsigned int* global_syms,
    [all...]
symtab.cc 578 // Stringpool keys.
699 Stringpool::Key name_key;
704 Stringpool::Key version_key = 0;
770 Symbol_table::wrap_symbol(const char* name, Stringpool::Key* name_key)
922 Stringpool::Key name_key,
924 Stringpool::Key version_key,
968 const Stringpool::Key vnull_key = 0;
    [all...]
stringpool.h 0 // stringpool.h -- a string pool for gold -*- C++ -*-
57 // A Stringpool is a pool of unique strings. It provides the
61 // in the Stringpool, you can compare them for equality by using
65 // add strings to the Stringpool in the same order, then the key for
73 // When you add a string to a Stringpool, Stringpool will optionally
77 // A Stringpool can be turned into a string table, a sequential series
81 // the Stringpool. After doing this conversion, you can ask for the
82 // offset of any string (or any key) in the stringpool in the string
86 // When a Stringpool is turned into a string table, then as a
    [all...]
output.h 484 const Stringpool*,
526 const Stringpool* secnamepool_;
961 Output_data_strtab(Stringpool* strtab)
973 // sure that the Stringpool is finalized.
992 Stringpool* strtab_;
    [all...]
target.h 39 #include "stringpool.h"
473 std::vector<Symbol*>* syms, Stringpool* dynpool,
774 std::vector<Symbol*>*, Stringpool*, Versions*,
    [all...]
dwp.cc 46 #include "stringpool.h"
669 Stringpool stringpool_;
671 Stringpool shstrtab_;
    [all...]
merge.cc 574 Stringpool::Key key;
object.cc     [all...]
output.cc 183 const Stringpool* secnamepool,
    [all...]
layout.cc 813 Layout::get_output_section(const char* name, Stringpool::Key name_key,
    [all...]
mips.cc     [all...]

Completed in 1131 milliseconds