Lines Matching defs:string
48 #include <string.h>
58 look(u_char *string, u_char *front, u_char *back)
62 /* Convert string to lower case before searching. */
63 for (s = string; *s; s++) {
68 front = binary_search(string, front, back);
69 front = linear_search(string, front, back);
75 * Binary search for "string" in memory between "front" and "back".
78 * *or before* the first word matching "string". Relaxing the constraint
83 * matching string.
96 * If the string at "p" is not greater than the string to match,
105 * implies that there exists a string is least half as long as
107 * be no more expensive than the cost of simply printing a string or two.
117 binary_search(u_char *string, u_char *front, u_char *back)
129 if (compare(string, p, back) > 0)
140 * Find the first line that matches string, linearly searching from front
151 linear_search(u_char *string, u_char *front, u_char *back)
156 result = compare(string, front, back);