i 439 gozilla/gozilla.c int i, lim = sizeof(suffix)/sizeof(char *); i 458 gozilla/gozilla.c for (i = 0; i < lim; i++) { i 460 gozilla/gozilla.c strbuf_puts(sb, suffix[i]); i 475 gozilla/gozilla.c for (i = 0; i < lim; i++) { i 477 gozilla/gozilla.c strbuf_puts(sb, suffix[i]); i 285 gtags-parser/asm_parse.c YYID (int i) i 288 gtags-parser/asm_parse.c YYID (i) i 289 gtags-parser/asm_parse.c int i; i 292 gtags-parser/asm_parse.c return i; i 1343 gtags-parser/asm_scan.c register int number_to_move, i; i 1374 gtags-parser/asm_scan.c for ( i = 0; i < number_to_move; ++i ) i 1891 gtags-parser/asm_scan.c int i; i 1899 gtags-parser/asm_scan.c for ( i = 0; i < len; ++i ) i 1900 gtags-parser/asm_scan.c buf[i] = bytes[i]; i 2015 gtags-parser/asm_scan.c register int i; i 2016 gtags-parser/asm_scan.c for ( i = 0; i < n; ++i ) i 2017 gtags-parser/asm_scan.c s1[i] = s2[i]; i 105 gtags-parser/gctags.c int i, size = sizeof(lang_switch) / sizeof(struct lang_entry); i 112 gtags-parser/gctags.c for (i = 0; i < size; i++) i 113 gtags-parser/gctags.c if (!strcmp(lang, lang_switch[i].lang_name)) i 114 gtags-parser/gctags.c return &lang_switch[i]; i 243 gtags-parser/gctags.c int i; i 259 gtags-parser/gctags.c for (i = 0; i < tablesize; i++) { i 260 gtags-parser/gctags.c words[i].name = p; i 1382 gtags-parser/php.c register int number_to_move, i; i 1413 gtags-parser/php.c for ( i = 0; i < number_to_move; ++i ) i 1930 gtags-parser/php.c int i; i 1938 gtags-parser/php.c for ( i = 0; i < len; ++i ) i 1939 gtags-parser/php.c buf[i] = bytes[i]; i 2054 gtags-parser/php.c register int i; i 2055 gtags-parser/php.c for ( i = 0; i < n; ++i ) i 2056 gtags-parser/php.c s1[i] = s2[i]; i 141 htags-refkit/htags_path2url.c int i; i 155 htags-refkit/htags_path2url.c for (i = 0; i < n; i++) { i 156 htags-refkit/htags_path2url.c m[i].name = p; i 162 htags-refkit/htags_path2url.c m[i].path = p; i 192 htags/anchor.c int i, used = vb->length; i 201 htags/anchor.c for (i = 0; i < used; i++) i 202 htags/anchor.c if (table[i].type == 'D') i 204 htags/anchor.c if (i < used) i 205 htags/anchor.c FIRST = table[i].lineno; i 206 htags/anchor.c for (i = used - 1; i >= 0; i--) i 207 htags/anchor.c if (table[i].type == 'D') i 209 htags/anchor.c if (i >= 0) i 210 htags/anchor.c LAST = table[i].lineno; i 334 htags/anchor.c int i; i 336 htags/anchor.c for (i = 0; i < A_SIZE; i++) i 337 htags/anchor.c ref[i] = 0; i 1087 htags/asm.c register int number_to_move, i; i 1118 htags/asm.c for ( i = 0; i < number_to_move; ++i ) i 1637 htags/asm.c int i; i 1645 htags/asm.c for ( i = 0; i < len; ++i ) i 1646 htags/asm.c buf[i] = bytes[i]; i 1761 htags/asm.c register int i; i 1762 htags/asm.c for ( i = 0; i < n; ++i ) i 1763 htags/asm.c s1[i] = s2[i]; i 1218 htags/c.c register int number_to_move, i; i 1249 htags/c.c for ( i = 0; i < number_to_move; ++i ) i 1768 htags/c.c int i; i 1776 htags/c.c for ( i = 0; i < len; ++i ) i 1777 htags/c.c buf[i] = bytes[i]; i 1892 htags/c.c register int i; i 1893 htags/c.c for ( i = 0; i < n; ++i ) i 1894 htags/c.c s1[i] = s2[i]; i 102 htags/cache.c int i; i 104 htags/cache.c for (i = GTAGS; i < GTAGLIM; i++) { i 105 htags/cache.c if (assoc[i]) { i 106 htags/cache.c assoc_close(assoc[i]); i 107 htags/cache.c assoc[i] = NULL; i 1085 htags/cpp.c register int number_to_move, i; i 1116 htags/cpp.c for ( i = 0; i < number_to_move; ++i ) i 1635 htags/cpp.c int i; i 1643 htags/cpp.c for ( i = 0; i < len; ++i ) i 1644 htags/cpp.c buf[i] = bytes[i]; i 1759 htags/cpp.c register int i; i 1760 htags/cpp.c for ( i = 0; i < n; ++i ) i 1761 htags/cpp.c s1[i] = s2[i]; i 277 htags/fileindex.c int i = RESULTSIZE; i 284 htags/fileindex.c result[--i] = '\0'; i 289 htags/fileindex.c if (i <= 0) i 292 htags/fileindex.c result[--i] = ','; i 293 htags/fileindex.c result[--i] = n % 10 + '0'; i 296 htags/fileindex.c return (const char *)&result[i]; i 393 htags/htags.c int i; i 430 htags/htags.c for (i = 0; i < tabsize; i++) { i 431 htags/htags.c strbuf_puts(sb, tab[i].name); i 462 htags/htags.c for (i = 0; i < pmatch[0].rm_so; i++) i 463 htags/htags.c fputc(p[i], op); i 464 htags/htags.c for (i = 0; i < tabsize; i++) i 465 htags/htags.c if (!strncmp(start, tab[i].name, length)) i 467 htags/htags.c if (i >= tabsize) i 470 htags/htags.c if (i < tabsize) { i 475 htags/htags.c for (q = tab[i].value; *q; q++) { i 1046 htags/htags.c int i, n; i 1059 htags/htags.c for (i = 1; i < argc; i++) { i 1060 htags/htags.c if ((p = locatestring(argv[i], opt_gtagsconf, MATCH_AT_FIRST))) { i 1062 htags/htags.c if (++i >= argc) i 1064 htags/htags.c confpath = argv[i]; i 1069 htags/htags.c } else if ((p = locatestring(argv[i], opt_gtagslabel, MATCH_AT_FIRST))) { i 1071 htags/htags.c if (++i >= argc) i 1073 htags/htags.c label = argv[i]; i 1313 htags/htags.c int i; i 1348 htags/htags.c for (i = 1; i < argc; i++) { i 1355 htags/htags.c if ((p = locatestring(argv[i], opt_gtagsconf, MATCH_AT_FIRST))) { i 1357 htags/htags.c i++; i 1360 htags/htags.c blank = locatestring(argv[i], " ", MATCH_FIRST); i 1364 htags/htags.c strbuf_puts(save_a, argv[i]); i 1383 htags/htags.c int i = 0, j = 1; i 1412 htags/htags.c newargv[i++] = argv[0]; i 1415 htags/htags.c newargv[i++] = p; i 1419 htags/htags.c newargv[i++] = argv[j++]; i 1420 htags/htags.c newargv[i] = NULL; i 1422 htags/htags.c *argc = i; i 1424 htags/htags.c for (i = 0; i < *argc; i++) i 1425 htags/htags.c fprintf(stderr, "argv[%d] = '%s'\n", i, argv[i]); i 1726 htags/htags.c int i; i 1730 htags/htags.c for (i = GPATH; i < GTAGLIM; i++) { i 1731 htags/htags.c path = makepath(dbpath, dbname(i), NULL); i 1732 htags/htags.c gtags_exist[i] = test("fr", path); i 2009 htags/htags.c int i, count = sizeof(icon_files) / sizeof(char *); i 2011 htags/htags.c for (i = 0; i < count; i++) { i 2012 htags/htags.c snprintf(src, sizeof(src), "%s/gtags/icons/%s.%s", datadir, icon_files[i], icon_suffix); i 2013 htags/htags.c snprintf(dst, sizeof(dst), "%s/icons/%s.%s", distpath, icon_files[i], icon_suffix); i 991 htags/java.c register int number_to_move, i; i 1022 htags/java.c for ( i = 0; i < number_to_move; ++i ) i 1541 htags/java.c int i; i 1549 htags/java.c for ( i = 0; i < len; ++i ) i 1550 htags/java.c buf[i] = bytes[i]; i 1665 htags/java.c register int i; i 1666 htags/java.c for ( i = 0; i < n; ++i ) i 1667 htags/java.c s1[i] = s2[i]; i 1003 htags/php.c int brace = 0, i = 0; i 1013 htags/php.c buf[i++] = *p; i 1014 htags/php.c if (i >= sizeof(buf)) i 1017 htags/php.c buf[i] = '\0'; i 1020 htags/php.c i = LEXLENG - 1; i 1022 htags/php.c if ((a = anchor_get(p, i, 'Y', LINENO)) != NULL) { i 1234 htags/php.c register int number_to_move, i; i 1265 htags/php.c for ( i = 0; i < number_to_move; ++i ) i 1784 htags/php.c int i; i 1792 htags/php.c for ( i = 0; i < len; ++i ) i 1793 htags/php.c buf[i] = bytes[i]; i 1908 htags/php.c register int i; i 1909 htags/php.c for ( i = 0; i < n; ++i ) i 1910 htags/php.c s1[i] = s2[i]; i 96 htags/src2html.c int i, size = sizeof(lang_switch) / sizeof(struct lang_entry); i 103 htags/src2html.c for (i = 0; i < size; i++) i 104 htags/src2html.c if (!strcmp(lang, lang_switch[i].lang_name)) i 105 htags/src2html.c return &lang_switch[i]; i 221 htags/src2html.c int i; i 224 htags/src2html.c for (i = 0; i < A_LIMIT; i++) { i 225 htags/src2html.c if (i == A_INDEX) { i 227 htags/src2html.c } else if (i == A_HELP) { i 229 htags/src2html.c } else if (ref[i]) { i 232 htags/src2html.c if (ref[i] == -1) i 234 htags/src2html.c else if (ref[i] == -2) i 237 htags/src2html.c snprintf(tmp, sizeof(tmp), "%d", ref[i]); i 242 htags/src2html.c snprintf(tmp, sizeof(tmp), "%s%s", (i != A_INDEX && i != A_HELP && ref[i] == 0) ? "n_" : "", icons[i]); i 243 htags/src2html.c strbuf_puts(sb, gen_image(PARENT, tmp, label[i])); i 245 htags/src2html.c strbuf_sprintf(sb, "[%s]", label[i]); i 247 htags/src2html.c if (i == A_INDEX || i == A_HELP || ref[i] != 0) i 262 htags/src2html.c int i = 0; i 266 htags/src2html.c i = 4; i 268 htags/src2html.c i = ncol + 1; i 269 htags/src2html.c if (i > 0) i 270 htags/src2html.c for (; i > 0; i--) i 64 libdb/bt_conv.c indx_t i, top; i 85 libdb/bt_conv.c for (i = 0; i < top; i++) { i 86 libdb/bt_conv.c M_16_SWAP(h->linp[i]); i 87 libdb/bt_conv.c p = (char *)GETBINTERNAL(h, i); i 100 libdb/bt_conv.c for (i = 0; i < top; i++) { i 101 libdb/bt_conv.c M_16_SWAP(h->linp[i]); i 102 libdb/bt_conv.c p = (char *)GETBLEAF(h, i); i 132 libdb/bt_conv.c indx_t i, top; i 146 libdb/bt_conv.c for (i = 0; i < top; i++) { i 147 libdb/bt_conv.c p = (char *)GETBINTERNAL(h, i); i 158 libdb/bt_conv.c M_16_SWAP(h->linp[i]); i 161 libdb/bt_conv.c for (i = 0; i < top; i++) { i 162 libdb/bt_conv.c p = (char *)GETBLEAF(h, i); i 182 libdb/bt_conv.c M_16_SWAP(h->linp[i]); i 65 libdb/bt_debug.c pgno_t i; i 91 libdb/bt_debug.c for (i = P_ROOT; (h = mpool_get(t->bt_mp, i, 0)) != NULL; ++i) { i 260 libdb/bt_debug.c pgno_t i, pcont, pinternal, pleaf; i 267 libdb/bt_debug.c for (i = P_ROOT; (h = mpool_get(t->bt_mp, i, 0)) != NULL; ++i) { i 288 libdb/bt_debug.c for (i = P_ROOT, levels = 0 ;; ++levels) { i 289 libdb/bt_debug.c h = mpool_get(t->bt_mp, i, 0); i 296 libdb/bt_debug.c i = F_ISSET(t, R_RECNO) ? i 310 libdb/btree.h #define BT_PUSH(t, p, i) { \ i 312 libdb/btree.h t->bt_sp->index = i; \ i 252 libglibc/getopt.c register int i; i 255 libglibc/getopt.c for (i = 0; i < len; i++) i 257 libglibc/getopt.c tem = argv[bottom + i]; i 258 libglibc/getopt.c argv[bottom + i] = argv[top - (middle - bottom) + i]; i 259 libglibc/getopt.c argv[top - (middle - bottom) + i] = tem; i 268 libglibc/getopt.c register int i; i 271 libglibc/getopt.c for (i = 0; i < len; i++) i 273 libglibc/getopt.c tem = argv[bottom + i]; i 274 libglibc/getopt.c argv[bottom + i] = argv[middle + i]; i 275 libglibc/getopt.c argv[middle + i] = tem; i 246 libglibc/obstack.c register long i; i 273 libglibc/obstack.c for (i = obj_size / sizeof (COPYING_UNIT) - 1; i 274 libglibc/obstack.c i >= 0; i--) i 275 libglibc/obstack.c ((COPYING_UNIT *)object_base)[i] i 276 libglibc/obstack.c = ((COPYING_UNIT *)h->object_base)[i]; i 285 libglibc/obstack.c for (i = already; i < obj_size; i++) i 286 libglibc/obstack.c object_base[i] = h->object_base[i]; i 635 libglibc/regex.c unsigned i = 0; i 637 libglibc/regex.c while (i < (1 << BYTEWIDTH)) i 639 libglibc/regex.c if (fastmap[i++]) i 642 libglibc/regex.c putchar (i - 1); i 643 libglibc/regex.c while (i < (1 << BYTEWIDTH) && fastmap[i]) i 646 libglibc/regex.c i++; i 651 libglibc/regex.c putchar (i - 1); i 5677 libglibc/regex.c unsigned i; i 5686 libglibc/regex.c for (i = 0; i < CHAR_SET_SIZE; i++) i 5687 libglibc/regex.c preg->translate[i] = ISUPPER (i) ? TOLOWER (i) : i; i 85 libutil/compress.c int i, limit; i 98 libutil/compress.c for (i = 0; i < limit; i++) { i 99 libutil/compress.c ab2name[i].c = 0; i 100 libutil/compress.c ab2name[i].name = NULL; i 114 libutil/compress.c i = ab->c - 'a'; i 115 libutil/compress.c ab2name[i].c = ab->c; i 116 libutil/compress.c ab2name[i].name = ab->name; i 117 libutil/compress.c ab2name[i].length = ab->length; i 137 libutil/compress.c int i, limit = sizeof(ab2name) / sizeof(struct abbrmap); i 140 libutil/compress.c for (i = 0; i < limit; i++) { i 141 libutil/compress.c if (ab2name[i].c != 0) { i 142 libutil/compress.c fprintf(stderr, "ab2name[%d].c = %c\n", i, ab2name[i].c); i 143 libutil/compress.c fprintf(stderr, "ab2name[%d].name = %s\n", i, ab2name[i].name); i 149 libutil/compress.c for (i = 0; i < limit; i++) { i 150 libutil/compress.c if (ab[i].c != 0) { i 151 libutil/compress.c fprintf(stderr, "name2ab[%d].c = %c\n", i, ab[i].c); i 152 libutil/compress.c fprintf(stderr, "name2ab[%d].name = %s\n", i, ab[i].name); i 199 libutil/compress.c int i, limit = name2ab->length; i 202 libutil/compress.c for (i = 0; i < limit; i++) { i 203 libutil/compress.c if (!strncmp(p, ab[i].name, ab[i].length)) { i 205 libutil/compress.c strbuf_putc(sb, ab[i].c); i 206 libutil/compress.c p += ab[i].length; i 210 libutil/compress.c if (i >= limit) { i 244 libutil/compress.c int i; i 277 libutil/compress.c i = *p - 'a'; i 278 libutil/compress.c if (ab2name[i].name) i 279 libutil/compress.c strbuf_puts(sb, ab2name[i].name); i 432 libutil/dbop.c int i = strlen(dat) + 1; i 433 libutil/dbop.c if (size > i) i 434 libutil/dbop.c flag = dat + i; i 267 libutil/find.c int i; i 274 libutil/find.c for (i = 0; i < list_count; i++) { i 278 libutil/find.c if (i + 1 < list_count) i 282 libutil/find.c listarray[i] = p; i 303 libutil/find.c int i; i 315 libutil/find.c for (i = 0; i < list_count; i++) { i 316 libutil/find.c first = listarray[i]; i 540 libutil/gtagsop.c int i = 0; i 542 libutil/gtagsop.c while (*p && !isregexchar(*p) && i < IDENTLEN) i 543 libutil/gtagsop.c prefix[i++] = *p++; i 544 libutil/gtagsop.c prefix[i] = '\0'; i 562 libutil/gtagsop.c unsigned long i; i 602 libutil/gtagsop.c i = 0; i 604 libutil/gtagsop.c gtop->path_array[i++] = entry->value; i 605 libutil/gtagsop.c if (i != gtop->path_hash->entries) i 606 libutil/gtagsop.c die("Something is wrong. 'i = %lu, entries = %lu'" , i, gtop->path_hash->entries); i 719 libutil/gtagsop.c int i, last; i 770 libutil/gtagsop.c for (i = 0; i < vb->length; i++) { i 771 libutil/gtagsop.c int n = lno_array[i]; i 816 libutil/gtagsop.c for (i = 0; i < vb->length; i++) { i 817 libutil/gtagsop.c int n = lno_array[i]; i 92 libutil/idset.c int i; i 96 libutil/idset.c for (i = 0; i < LONG_BIT; i++) i 97 libutil/idset.c bit[i] = 1UL << i; i 180 libutil/idset.c unsigned int i, limit; i 190 libutil/idset.c for (i = ++index1; i < LONG_BIT; i++) i 191 libutil/idset.c if (bit[i] & idset->set[index0]) i 192 libutil/idset.c return idset->lastid = index0 * LONG_BIT + i; i 194 libutil/idset.c for (i = index0; i < limit && idset->set[i] == 0; i++) i 196 libutil/idset.c if (i >= limit) i 198 libutil/idset.c index0 = i; i 199 libutil/idset.c for (i = 0; i < LONG_BIT; i++) i 200 libutil/idset.c if (bit[i] & idset->set[index0]) i 201 libutil/idset.c return idset->lastid = index0 * LONG_BIT + i; i 135 libutil/split.c int i, c; i 136 libutil/split.c for (i = 0; i < list->npart; i++) { i 137 libutil/split.c if ((c = list->part[i].savec) != '\0') i 138 libutil/split.c *(list->part[i].end) = c; i 147 libutil/split.c int i; i 152 libutil/split.c for (i = 0; i < list->npart; i++) { i 153 libutil/split.c part = &list->part[i]; i 154 libutil/split.c fprintf(stderr, "string[%d]: |%s|\n", i, part->start); i 155 libutil/split.c fprintf(stderr, "savec[%d] : |%c|\n", i, part->savec); i 247 libutil/strbuf.c int i = 0; i 250 libutil/strbuf.c if (i >= sizeof(num)) i 252 libutil/strbuf.c num[i++] = n % 10 + '0'; i 255 libutil/strbuf.c while (--i >= 0) i 256 libutil/strbuf.c strbuf_putc(sb, num[i]); i 399 libutil/strbuf.c int i = 0; i 401 libutil/strbuf.c format[i++] = '%'; i 403 libutil/strbuf.c format[i++] = *s++; i 405 libutil/strbuf.c format[i++] = *s++; i 406 libutil/strbuf.c format[i++] = c = *s; i 407 libutil/strbuf.c format[i] = '\0'; i 87 libutil/strhash.c int i; i 90 libutil/strhash.c for (i = 0; i < buckets; i++) i 91 libutil/strhash.c SLIST_INIT(&sh->htab[i]); i 190 libutil/strhash.c int i; i 195 libutil/strhash.c for (i = 0; i < sh->buckets; i++) { i 196 libutil/strhash.c SLIST_INIT(&sh->htab[i]); i 55 libutil/test.c int i, c, size; i 66 libutil/test.c for (i = 0; i < size; i++) { i 67 libutil/test.c c = (unsigned char)buf[i]; i 63 libutil/usable.c int i, lim = sizeof(suffix)/sizeof(char *); i 99 libutil/usable.c for (i = 0; i < lim; i++) i 100 libutil/usable.c if (test("f", makepath(dir, command, suffix[i]))) { i 101 libutil/usable.c strlimcpy(path, makepath(dir, command, suffix[i]), sizeof(path));