Home | History | Annotate | Download | only in libebl

Lines Matching defs:string

1 /* ELF string table handling.
39 #include <string.h>
53 const char *string;
108 ret->null.string = "";
172 /* Create the reserved string. */
174 newstr->string = str;
207 /* We found a matching string. */
216 /* Add new string. The actual string is assumed to be permanent. */
220 /* Compute the string length if the caller doesn't know it. */
226 if (len == 1 && st->null.string != NULL)
229 /* Allocate memory for the new string and its associated information. */
234 /* Search in the array for the place to insert the string. If there
235 is no string with matching prefix and no string with matching
243 /* Check whether we already know this string. */
257 string of this entry anymore. */
266 /* When we get here it means that the string we are about to
267 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
355 assert (se->string != NULL);
357 return se->string;