Home | History | Annotate | Download | only in libebl

Lines Matching defs:string

1 /* Generic string table handling.
60 #include <string.h>
73 const char *string;
130 ret->null.string = (char *) calloc (1, width);
168 if (st->null.string != NULL)
169 free ((char *) st->null.string);
191 /* Create the reserved string. */
193 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. */
261 if (len == 1 && st->null.string != NULL)
264 /* Allocate memory for the new string and its associated information. */
267 /* Search in the array for the place to insert the string. If there
268 is no string with matching prefix and no string with matching
278 /* Check whether we already know this string. */
291 string of this entry anymore. */
300 /* When we get here it means that the string we are about to
301 add has a common prefix with a string we already have but
335 *freep = (char *) mempcpy (*freep, nodep->string, nodep->len * nodep->width);
342 assert (subs->offset != 0 || subs->string[0] == '\0');
363 null string. */
373 /* Now run through the tree and add all the string while also updating