length 198 htags/anchor.c if (vb->length == 0) { length 201 htags/anchor.c int i, used = vb->length; length 226 htags/anchor.c end = &table[vb->length]; length 285 htags/anchor.c anchor_get(const char *name, int length, int type, int lineno) length 302 htags/anchor.c if (!p->done && p->length == length && !strcmp(gettag(p), name)) length 38 htags/anchor.h int length; length 46 htags/anchor.h (a)->length = strlen(tag); \ length 47 htags/anchor.h if ((a)->length < ANCHOR_NAMELEN) { \ length 231 htags/fileindex.c int length = strlen(dir); length 233 htags/fileindex.c if (!strncmp(path, dir, length) && *(path + length) == '/') length 234 htags/fileindex.c return path + length + 1; length 538 htags/htags.c int length = pmatch[0].rm_eo - pmatch[0].rm_so; length 544 htags/htags.c if (!strncmp(start, tab[i].name, length)) length 526 htags/src2html.c put_anchor_force(char *name, int length, int lineno) length 532 htags/src2html.c strbuf_nputs(sb, name, length); length 240 libglibc/obstack.c _obstack_newchunk (struct obstack *h, int length) length 251 libglibc/obstack.c new_size = (obj_size + length) + (obj_size >> 3) + h->alignment_mask + 100; length 267 libglibc/obstack.h # define obstack_make_room(OBSTACK,length) \ length 270 libglibc/obstack.h int __len = (length); \ length 280 libglibc/obstack.h # define obstack_grow(OBSTACK,where,length) \ length 283 libglibc/obstack.h int __len = (length); \ length 290 libglibc/obstack.h # define obstack_grow0(OBSTACK,where,length) \ length 293 libglibc/obstack.h int __len = (length); \ length 341 libglibc/obstack.h # define obstack_blank(OBSTACK,length) \ length 344 libglibc/obstack.h int __len = (length); \ length 350 libglibc/obstack.h # define obstack_alloc(OBSTACK,length) \ length 353 libglibc/obstack.h obstack_blank (__h, (length)); \ length 356 libglibc/obstack.h # define obstack_copy(OBSTACK,where,length) \ length 359 libglibc/obstack.h obstack_grow (__h, (where), (length)); \ length 362 libglibc/obstack.h # define obstack_copy0(OBSTACK,where,length) \ length 365 libglibc/obstack.h obstack_grow0 (__h, (where), (length)); \ length 410 libglibc/obstack.h # define obstack_make_room(h,length) \ length 411 libglibc/obstack.h ( (h)->temp = (length), \ length 415 libglibc/obstack.h # define obstack_grow(h,where,length) \ length 416 libglibc/obstack.h ( (h)->temp = (length), \ length 422 libglibc/obstack.h # define obstack_grow0(h,where,length) \ length 423 libglibc/obstack.h ( (h)->temp = (length), \ length 451 libglibc/obstack.h # define obstack_blank(h,length) \ length 452 libglibc/obstack.h ( (h)->temp = (length), \ length 457 libglibc/obstack.h # define obstack_alloc(h,length) \ length 458 libglibc/obstack.h (obstack_blank ((h), (length)), obstack_finish ((h))) length 460 libglibc/obstack.h # define obstack_copy(h,where,length) \ length 461 libglibc/obstack.h (obstack_grow ((h), (where), (length)), obstack_finish ((h))) length 463 libglibc/obstack.h # define obstack_copy0(h,where,length) \ length 464 libglibc/obstack.h (obstack_grow0 ((h), (where), (length)), obstack_finish ((h))) length 74 libglibc/regex.c # define re_compile_pattern(pattern, length, bufp) \ length 75 libglibc/regex.c __re_compile_pattern (pattern, length, bufp) length 5517 libglibc/regex.c re_compile_pattern (pattern, length, bufp) length 5519 libglibc/regex.c size_t length; length 5536 libglibc/regex.c ret = regex_compile (pattern, length, re_syntax_options, bufp); length 450 libglibc/regex.h _RE_ARGS ((const char *pattern, size_t length, length 467 libglibc/regex.h int length, int start, int range, struct re_registers *regs)); length 482 libglibc/regex.h int length, int start, struct re_registers *regs)); length 53 libltdl/lt__strl.c size_t length; length 61 libltdl/lt__strl.c length=strlen(dst); length 67 libltdl/lt__strl.c for ( p = dst + length, q = src; length 68 libltdl/lt__strl.c (*q != 0) && (length < dstsize - 1) ; length 69 libltdl/lt__strl.c length++, p++, q++ ) length 72 libltdl/lt__strl.c dst[length]='\0'; length 78 libltdl/lt__strl.c length++; length 80 libltdl/lt__strl.c return length; length 101 libltdl/lt__strl.c size_t length=0; length 112 libltdl/lt__strl.c for ( p=dst, q=src, length=0 ; length 113 libltdl/lt__strl.c (*q != 0) && (length < dstsize-1) ; length 114 libltdl/lt__strl.c length++, p++, q++ ) length 117 libltdl/lt__strl.c dst[length]='\0'; length 123 libltdl/lt__strl.c length++; length 125 libltdl/lt__strl.c return length; length 424 libutil/abs2rel.c int length; length 437 libutil/abs2rel.c length = strlen(base); length 440 libutil/abs2rel.c if (length >= size) length 446 libutil/abs2rel.c rp = result + length - 1; length 451 libutil/abs2rel.c if (length > 1) length 467 libutil/abs2rel.c bp = base + length; length 490 libutil/abs2rel.c length = bp - base; length 491 libutil/abs2rel.c if (length >= size) length 493 libutil/abs2rel.c strncpy(result, base, length); length 494 libutil/abs2rel.c rp = result + length; length 495 libutil/abs2rel.c if (*pp || *(pp - 1) == '/' || length == 0) length 84 libutil/compress.c int length; length 123 libutil/compress.c ab->length = strlen(ab->name); length 129 libutil/compress.c ab2name[i].length = ab->length; length 163 libutil/compress.c limit = name2ab->length; length 184 libutil/compress.c int length = strlen(name); length 211 libutil/compress.c } else if (!strncmp(p, name, length)) { length 213 libutil/compress.c p += length; length 215 libutil/compress.c int i, limit = name2ab->length; length 219 libutil/compress.c if (!strncmp(p, ab[i].name, ab[i].length)) { length 222 libutil/compress.c p += ab[i].length; length 402 libutil/dbop.c dbop_put_withlen(DBOP *dbop, const char *name, const char *data, int length) length 416 libutil/dbop.c dat.size = length; length 846 libutil/gtagsop.c qsort(lno_array, vb->length, sizeof(int), compare_lineno); length 867 libutil/gtagsop.c for (i = 0; i < vb->length; i++) { length 913 libutil/gtagsop.c for (i = 0; i < vb->length; i++) { length 1003 libutil/gtagsop.c gtop->gtp_count = gtop->vb->length; length 173 libutil/linetable.c if (vb->length == lineno) { length 73 libutil/makepath.c int length; length 78 libutil/makepath.c if ((length = strlen(dir)) > MAXPATHLEN) length 96 libutil/makepath.c if ((length = strlen(strbuf_value(sb))) > MAXPATHLEN) length 98 libutil/strbuf.c __strbuf_expandbuf(STRBUF *sb, int length) length 101 libutil/strbuf.c int newsize = sb->sbufsize + (length > EXPANDSIZE ? length : EXPANDSIZE); length 100 libutil/varray.c vb->alloced = vb->length = 0; length 122 libutil/varray.c if (index >= vb->length) { length 124 libutil/varray.c vb->length = index + 1; length 125 libutil/varray.c else if (index == 0 && vb->length == 0) length 164 libutil/varray.c return varray_assign(vb, vb->length, 1); length 174 libutil/varray.c vb->length = 0; length 25 libutil/varray.h int length; length 79 libutil/xargs.c exec_line_limit(int length) length 103 libutil/xargs.c limit -= length + 80; length 113 libutil/xargs.c limit = 2047 - length - 80; length 154 libutil/xargs.c length = strlen(path);\ length 160 libutil/xargs.c if (strbuf_getlen(comline) + length + 2 > limit)\ length 197 libutil/xargs.c int length; length 247 libutil/xargs.c for (; LT_MAX && xp->curp < xp->endp; xp->curp += length + 1)