Home | History | Annotate | Download | only in libebl

Lines Matching defs:string

1 /* ELF string table handling.
60 #include <string.h>
75 const wchar_t *string;
128 ret->null.string = L"";
194 /* Create the reserved string. */
196 newstr->string = str;
231 /* We found a matching string. */
240 /* Add new string. The actual string is assumed to be permanent. */
247 /* Compute the string length if the caller doesn't know it. */
253 if (len == 1 && st->null.string != NULL)
256 /* Allocate memory for the new string and its associated information. */
261 /* Search in the array for the place to insert the string. If there
262 is no string with matching prefix and no string with matching
272 /* Check whether we already know this string. */
285 string of this entry anymore. */
294 /* When we get here it means that the string we are about to
295 add has a common prefix with a string we already have but
329 *freep = wmempcpy (*freep, nodep->string, nodep->len);
336 assert (subs->offset != 0 || subs->string[0] == '\0');
357 null string. */
367 /* Now run through the tree and add all the string while also updating