Home | History | Annotate | Download | only in libebl

Lines Matching defs:string

1 /* Generic string table handling.
39 #include <string.h>
52 const char *string;
109 ret->null.string = (char *) calloc (1, width);
147 if (st->null.string != NULL)
148 free ((char *) st->null.string);
170 /* Create the reserved string. */
172 newstr->string = str;
210 /* We found a matching string. */
219 /* Add new string. The actual string is assumed to be permanent. */
226 /* Compute the string length if the caller doesn't know it. */
240 if (len == 1 && st->null.string != NULL)
243 /* Allocate memory for the new string and its associated information. */
246 /* Search in the array for the place to insert the string. If there
247 is no string with matching prefix and no string with matching
257 /* Check whether we already know this string. */
270 string of this entry anymore. */
279 /* When we get here it means that the string we are about to
280 add has a common prefix with a string we already have but
314 *freep = (char *) mempcpy (*freep, nodep->string, nodep->len * nodep->width);
321 assert (subs->offset != 0 || subs->string[0] == '\0');
342 null string. */
352 /* Now run through the tree and add all the string while also updating