Lines Matching defs:string
1 /* ELF/DWARF string table handling.
39 #include <string.h>
47 const char *string;
101 ret->null.string = "";
165 /* Create the reserved string. */
167 newstr->string = str;
200 /* We found a matching string. */
209 /* Add new string. The actual string is assumed to be permanent. */
215 if (len == 1 && st->null.string != NULL)
218 /* Allocate memory for the new string and its associated information. */
223 /* Search in the array for the place to insert the string. If there
224 is no string with matching prefix and no string with matching
232 /* Check whether we already know this string. */
246 string of this entry anymore. */
255 /* When we get here it means that the string we are about to
256 add has a common prefix with a string we already have but
299 *freep = (char *) mempcpy (*freep, nodep->string, nodep->len);
306 assert (subs->offset != 0 || subs->string[0] == '\0');
325 null string. */
335 /* Now run through the tree and add all the string while also updating
357 return se->string;