Lines Matching defs:string
1 // stringpool.h -- a string pool for gold -*- C++ -*-
23 #include <string>
35 // Return the length of a string in units of Char_type.
60 // Every string in the pool is unique. Thus, if you have two strings
62 // pointer comparison rather than string comparison.
64 // There is a key associated with every string in the pool. If you
66 // each string will always be the same for any run of the linker.
67 // This is not true of the string pointers themselves, as they may
70 // string pointer so that repeated runs of the linker will generate
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
78 // of null terminated strings. The first string may optionally be a
82 // offset of any string (or any key) in the stringpool in the string
83 // table, and you can write the resulting string table to an output
86 // When a Stringpool is turned into a string table, then as an
87 // optimization it will reuse string suffixes to avoid duplicating
89 // string "abc" will be stored, and "bc" will be represented by an
90 // offset into the middle of the string "abc".
171 // are used for merging wide string constants.
198 // string when converting the stringpool to a string table. This
209 // Indicate that this string pool should be optimized, even if not
215 // Add the string S to the pool. This returns a canonical permanent
216 // pointer to the string in the pool. If COPY is true, the string
218 // *PKEY to the key for the string.
222 // Add the string S to the pool.
227 // Add string S of length LEN characters to the pool. If COPY is
232 // If the string S is present in the pool, return the canonical
233 // string pointer. Otherwise, return NULL. If PKEY is not NULL,
238 // Turn the stringpool into a string table: determine the offsets of
244 // Get the offset of the string S in the string table. This returns
250 // Get the offset of the string S in the string table.
255 // Get the offset of string S, with length LENGTH characters, in the
256 // string table.
260 // Get the offset of the string with key K.
268 // Get the size of the string table. This returns the number of
277 // Write the string table into the output file at the specified
282 // Write the string table into the specified buffer, of the
300 // Compute a hash code for a string. LENGTH is the length of the
301 // string in characters.
320 // Copy a string into the buffers, returning a canonical string.
329 // The hash table key includes the string, the length of the string,
330 // and the hash code for the string. We put the hash code
336 const Stringpool_char* string;
344 : string(NULL), length(0), hash_code(0)
350 : string(s), length(string_length(s)), hash_code(string_hash(s, length))
354 : string(s), length(len), hash_code(string_hash(s, len))
381 // Comparison routine used when sorting into a string table.
392 // offsets if we turn this into an string table section.
400 // Mapping from Key to string table offset.
404 // Size of string table.
406 // Whether to reserve offset 0 to hold the null string.
408 // Whether to optimize the string table.
410 // offset of the next string.
