Lines Matching refs:i

90   register int c, i, len;  in search_forward()  local
105 for (i = 0; i < len; i++) in search_forward()
107 if (islower (alternate[i])) in search_forward()
108 alternate[i] = toupper (alternate[i]); in search_forward()
109 else if (isupper (alternate[i])) in search_forward()
110 alternate[i] = tolower (alternate[i]); in search_forward()
119 for (i = 0; i < len; i++) in search_forward()
121 c = buff[i]; in search_forward()
123 if ((c != string[i]) && (!alternate || c != alternate[i])) in search_forward()
127 if (!string[i]) in search_forward()
149 register int c, i, len; in search_backward() local
158 for (c = 0, i = len - 1; input_string[c]; c++, i--) in search_backward()
159 string[i] = input_string[c]; in search_backward()
172 for (i = 0; i < len; i++) in search_backward()
174 if (islower (alternate[i])) in search_backward()
175 alternate[i] = toupper (alternate[i]); in search_backward()
176 else if (isupper (alternate[i])) in search_backward()
177 alternate[i] = tolower (alternate[i]); in search_backward()
186 for (i = 0; i < len; i++) in search_backward()
188 c = *(buff - i); in search_backward()
190 if (c != string[i] && (!alternate || c != alternate[i])) in search_backward()
194 if (!string[i]) in search_backward()
266 register int i; in skip_whitespace() local
268 for (i = 0; string && whitespace (string[i]); i++); in skip_whitespace()
269 return (i); in skip_whitespace()
277 register int i; in skip_whitespace_and_newlines() local
279 for (i = 0; string && whitespace_or_newline (string[i]); i++); in skip_whitespace_and_newlines()
280 return (i); in skip_whitespace_and_newlines()
287 register int i; in skip_non_whitespace() local
289 for (i = 0; string && string[i] && !whitespace (string[i]); i++); in skip_non_whitespace()
290 return (i); in skip_non_whitespace()
303 register int c, i = 0; in skip_node_characters() local
318 i++; in skip_node_characters()
321 for (; string && (c = string[i]); i++) in skip_node_characters()
339 ((paren_seen && string[i - 1] == ')') && in skip_node_characters()
347 (!string[i + 1]) || in skip_node_characters()
349 (whitespace_or_newline (string[i + 1])) || in skip_node_characters()
350 (string[i + 1] == ')')))) in skip_node_characters()
353 return (i); in skip_node_characters()
369 register long i; in find_node_separator() local
378 for (i = binding->start; i < binding->end - 1; i++) in find_node_separator()
379 if (((body[i] == INFO_FF && body[i + 1] == INFO_COOKIE) && in find_node_separator()
380 (body[i + 2] == '\n' || in find_node_separator()
381 (body[i + 2] == INFO_FF && body[i + 3] == '\n'))) || in find_node_separator()
382 ((body[i] == INFO_COOKIE) && in find_node_separator()
383 (body[i + 1] == '\n' || in find_node_separator()
384 (body[i + 1] == INFO_FF && body[i + 2] == '\n')))) in find_node_separator()
385 return (i); in find_node_separator()
394 register int i; in skip_node_separator() local
396 i = 0; in skip_node_separator()
398 if (body[i] == INFO_FF) in skip_node_separator()
399 i++; in skip_node_separator()
401 if (body[i++] != INFO_COOKIE) in skip_node_separator()
404 if (body[i] == INFO_FF) in skip_node_separator()
405 i++; in skip_node_separator()
407 if (body[i++] != '\n') in skip_node_separator()
410 return (i); in skip_node_separator()
418 register int i; in skip_line() local
420 for (i = 0; string && string[i] && string[i] != '\n'; i++); in skip_line()
422 if (string[i] == '\n') in skip_line()
423 i++; in skip_line()
425 return (i); in skip_line()