size 1855 global/global.c encode(char *to, int size, const char *from) size 1862 global/global.c if (size <= 3) size 1864 global/global.c snprintf(e, size, "%%%02x", *p); size 1866 global/global.c size -= 3; size 1868 global/global.c if (size <= 1) size 1871 global/global.c size--; size 66 gtags-cscope/alloc.c mymalloc(size_t size) size 68 gtags-cscope/alloc.c return(alloctest(malloc((unsigned) size))); size 74 gtags-cscope/alloc.c mycalloc(size_t nelem, size_t size) size 76 gtags-cscope/alloc.c return(alloctest(calloc((unsigned) nelem, (unsigned) size))); size 82 gtags-cscope/alloc.c myrealloc(void *p, size_t size) size 84 gtags-cscope/alloc.c return(alloctest(realloc(p, (unsigned) size))); size 41 gtags-cscope/alloc.h void *mycalloc(size_t nelem, size_t size); size 42 gtags-cscope/alloc.h void *mymalloc(size_t size); size 43 gtags-cscope/alloc.h void *myrealloc(void *p, size_t size); size 351 gtags-cscope/global-cscope.h int mygetline(char p[], char s[], unsigned size, int firstchar, BOOL iscaseless); size 113 gtags-cscope/input.c mygetline(char p[], char s[], unsigned size, int firstchar, BOOL iscaseless) size 129 gtags-cscope/input.c sright = calloc(sizeof(char), size ); size 150 gtags-cscope/input.c if (i < size && ri > 0) { size 206 gtags-cscope/input.c if (i < size) { size 89 htags-refkit/htags_path2url.c load_filemap_contents(const char *file, char **area, int *size) size 111 htags-refkit/htags_path2url.c *size = st.st_size; size 141 htags-refkit/htags_path2url.c create_filemap_index(char *area, int size, struct map **map, int *lines) size 143 htags-refkit/htags_path2url.c char *p, *endp = area + size; size 222 htags-refkit/htags_path2url.c int size, lines; size 225 htags-refkit/htags_path2url.c status = load_filemap_contents(filemap, &area, &size); size 228 htags-refkit/htags_path2url.c status = create_filemap_index(area, size, &map, &lines); size 266 htags-refkit/htags_path2url.c htags_path2url(const char *path, int line, char *url, int size) size 278 htags-refkit/htags_path2url.c snprintf(url, size, "%s#L%d", result->path, line); size 280 htags-refkit/htags_path2url.c snprintf(url, size, "%s", result->path); size 308 htags/asm.c YY_BUFFER_STATE asm__create_buffer (FILE *file,int size ); size 320 htags/asm.c YY_BUFFER_STATE asm__scan_buffer (char *base,yy_size_t size ); size 1580 htags/asm.c YY_BUFFER_STATE asm__create_buffer (FILE * file, int size ) size 1588 htags/asm.c b->yy_buf_size = size; size 1782 htags/asm.c YY_BUFFER_STATE asm__scan_buffer (char * base, yy_size_t size ) size 1786 htags/asm.c if ( size < 2 || size 1787 htags/asm.c base[size-2] != YY_END_OF_BUFFER_CHAR || size 1788 htags/asm.c base[size-1] != YY_END_OF_BUFFER_CHAR ) size 1796 htags/asm.c b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ size 2083 htags/asm.c void *asm_alloc (yy_size_t size ) size 2085 htags/asm.c return (void *) malloc( size ); size 2088 htags/asm.c void *asm_realloc (void * ptr, yy_size_t size ) size 2097 htags/asm.c return (void *) realloc( (char *) ptr, size ); size 308 htags/c.c YY_BUFFER_STATE c__create_buffer (FILE *file,int size ); size 320 htags/c.c YY_BUFFER_STATE c__scan_buffer (char *base,yy_size_t size ); size 1713 htags/c.c YY_BUFFER_STATE c__create_buffer (FILE * file, int size ) size 1721 htags/c.c b->yy_buf_size = size; size 1915 htags/c.c YY_BUFFER_STATE c__scan_buffer (char * base, yy_size_t size ) size 1919 htags/c.c if ( size < 2 || size 1920 htags/c.c base[size-2] != YY_END_OF_BUFFER_CHAR || size 1921 htags/c.c base[size-1] != YY_END_OF_BUFFER_CHAR ) size 1929 htags/c.c b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ size 2216 htags/c.c void *c_alloc (yy_size_t size ) size 2218 htags/c.c return (void *) malloc( size ); size 2221 htags/c.c void *c_realloc (void * ptr, yy_size_t size ) size 2230 htags/c.c return (void *) realloc( (char *) ptr, size ); size 308 htags/cpp.c YY_BUFFER_STATE cpp__create_buffer (FILE *file,int size ); size 320 htags/cpp.c YY_BUFFER_STATE cpp__scan_buffer (char *base,yy_size_t size ); size 1578 htags/cpp.c YY_BUFFER_STATE cpp__create_buffer (FILE * file, int size ) size 1586 htags/cpp.c b->yy_buf_size = size; size 1780 htags/cpp.c YY_BUFFER_STATE cpp__scan_buffer (char * base, yy_size_t size ) size 1784 htags/cpp.c if ( size < 2 || size 1785 htags/cpp.c base[size-2] != YY_END_OF_BUFFER_CHAR || size 1786 htags/cpp.c base[size-1] != YY_END_OF_BUFFER_CHAR ) size 1794 htags/cpp.c b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ size 2081 htags/cpp.c void *cpp_alloc (yy_size_t size ) size 2083 htags/cpp.c return (void *) malloc( size ); size 2086 htags/cpp.c void *cpp_realloc (void * ptr, yy_size_t size ) size 2095 htags/cpp.c return (void *) realloc( (char *) ptr, size ); size 440 htags/fileindex.c int size = filesize(path); size 444 htags/fileindex.c if (size > 1) size 445 htags/fileindex.c snprintf(tips, sizeof(tips), "%s bytes", insert_comma(size)); size 447 htags/fileindex.c snprintf(tips, sizeof(tips), "%s byte", insert_comma(size)); size 601 htags/fileindex.c int size = filesize(path); size 620 htags/fileindex.c if (size > 1) size 621 htags/fileindex.c snprintf(tips, sizeof(tips), "%s bytes", insert_comma(size)); size 623 htags/fileindex.c snprintf(tips, sizeof(tips), "%s byte", insert_comma(size)); size 1002 htags/htags.c int ip, op, size; size 1014 htags/htags.c while ((size = read(ip, buf, sizeof(buf))) != 0) { size 1015 htags/htags.c if (size < 0) size 1017 htags/htags.c if (write(op, buf, size) != size) size 308 htags/java.c YY_BUFFER_STATE java__create_buffer (FILE *file,int size ); size 320 htags/java.c YY_BUFFER_STATE java__scan_buffer (char *base,yy_size_t size ); size 1481 htags/java.c YY_BUFFER_STATE java__create_buffer (FILE * file, int size ) size 1489 htags/java.c b->yy_buf_size = size; size 1683 htags/java.c YY_BUFFER_STATE java__scan_buffer (char * base, yy_size_t size ) size 1687 htags/java.c if ( size < 2 || size 1688 htags/java.c base[size-2] != YY_END_OF_BUFFER_CHAR || size 1689 htags/java.c base[size-1] != YY_END_OF_BUFFER_CHAR ) size 1697 htags/java.c b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ size 1984 htags/java.c void *java_alloc (yy_size_t size ) size 1986 htags/java.c return (void *) malloc( size ); size 1989 htags/java.c void *java_realloc (void * ptr, yy_size_t size ) size 1998 htags/java.c return (void *) realloc( (char *) ptr, size ); size 308 htags/php.c YY_BUFFER_STATE php__create_buffer (FILE *file,int size ); size 320 htags/php.c YY_BUFFER_STATE php__scan_buffer (char *base,yy_size_t size ); size 1756 htags/php.c YY_BUFFER_STATE php__create_buffer (FILE * file, int size ) size 1764 htags/php.c b->yy_buf_size = size; size 1958 htags/php.c YY_BUFFER_STATE php__scan_buffer (char * base, yy_size_t size ) size 1962 htags/php.c if ( size < 2 || size 1963 htags/php.c base[size-2] != YY_END_OF_BUFFER_CHAR || size 1964 htags/php.c base[size-1] != YY_END_OF_BUFFER_CHAR ) size 1972 htags/php.c b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ size 2259 htags/php.c void *php_alloc (yy_size_t size ) size 2261 htags/php.c return (void *) malloc( size ); size 2264 htags/php.c void *php_realloc (void * ptr, yy_size_t size ) size 2273 htags/php.c return (void *) realloc( (char *) ptr, size ); size 110 htags/src2html.c int i, size = sizeof(lang_switch) / sizeof(struct lang_entry); size 117 htags/src2html.c for (i = 0; i < size; i++) size 99 libdb/bt_close.c t->bt_cursor.key.size = 0; size 104 libdb/bt_close.c t->bt_rkey.size = 0; size 109 libdb/bt_close.c t->bt_rdata.size = 0; size 156 libdb/bt_overflow.c for (last = NULL, p = dbt->data, sz = dbt->size;; size 129 libdb/bt_put.c if (key->size + data->size > t->bt_ovflsize) { size 130 libdb/bt_put.c if (key->size > t->bt_ovflsize) { size 134 libdb/bt_put.c tkey.size = NOVFLSIZE; size 137 libdb/bt_put.c &key->size, sizeof(u_int32_t)); size 141 libdb/bt_put.c if (key->size + data->size > t->bt_ovflsize) { size 145 libdb/bt_put.c tdata.size = NOVFLSIZE; size 148 libdb/bt_put.c &data->size, sizeof(u_int32_t)); size 152 libdb/bt_put.c if (key->size + data->size > t->bt_ovflsize) size 207 libdb/bt_put.c nbytes = NBLEAFDBT(key->size, data->size); size 288 libdb/bt_put.c nbytes = NBLEAFDBT(key->size, data->size); size 173 libdb/bt_seq.c if (key->data == NULL || key->size == 0) { size 449 libdb/bt_seq.c t->bt_cursor.key.size = 0; size 193 libdb/bt_split.c a.size = tbl->ksize; size 195 libdb/bt_split.c b.size = bl->ksize; size 90 libdb/bt_utils.c &key->size, &rkey->data, &rkey->size)) size 94 libdb/bt_utils.c if (bl->ksize > rkey->size) { size 100 libdb/bt_utils.c rkey->size = bl->ksize; size 103 libdb/bt_utils.c key->size = bl->ksize; size 106 libdb/bt_utils.c key->size = bl->ksize; size 116 libdb/bt_utils.c &data->size, &rdata->data, &rdata->size)) size 121 libdb/bt_utils.c if (bl->dsize + 1 > rdata->size) { size 128 libdb/bt_utils.c rdata->size = bl->dsize + 1; size 131 libdb/bt_utils.c data->size = bl->dsize; size 134 libdb/bt_utils.c data->size = bl->dsize; size 183 libdb/bt_utils.c k2.size = bl->ksize; size 191 libdb/bt_utils.c k2.size = bi->ksize; size 197 libdb/bt_utils.c &k2.size, &t->bt_rdata.data, &t->bt_rdata.size)) size 228 libdb/bt_utils.c len = MIN(a->size, b->size); size 232 libdb/bt_utils.c return ((int)a->size - (int)b->size); size 252 libdb/bt_utils.c len = MIN(a->size, b->size); size 258 libdb/bt_utils.c return (a->size < b->size ? a->size + 1 : a->size); size 155 libdb/btree.h #define WR_BINTERNAL(p, size, pgno, flags) { \ size 156 libdb/btree.h *(u_int32_t *)p = size; \ size 210 libdb/btree.h *(u_int32_t *)p = key->size; \ size 212 libdb/btree.h *(u_int32_t *)p = data->size; \ size 216 libdb/btree.h memmove(p, key->data, key->size); \ size 217 libdb/btree.h p += key->size; \ size 218 libdb/btree.h memmove(p, data->data, data->size); \ size 241 libdb/btree.h *(u_int32_t *)p = data->size; \ size 245 libdb/btree.h memmove(p, data->data, data->size); \ size 74 libdb/db.h size_t size; /**< data length */ size 118 libglibc/obstack.c # define CALL_CHUNKFUN(h, size) \ size 120 libglibc/obstack.c ? (*(h)->chunkfun) ((h)->extra_arg, (size)) \ size 121 libglibc/obstack.c : (*(struct _obstack_chunk *(*) (long)) (h)->chunkfun) ((size))) size 142 libglibc/obstack.c int size, int alignment, size 150 libglibc/obstack.c if (size == 0) size 164 libglibc/obstack.c size = 4096 - extra; size 169 libglibc/obstack.c h->chunk_size = size; size 187 libglibc/obstack.c _obstack_begin_1 (struct obstack *h, int size, int alignment, size 196 libglibc/obstack.c if (size == 0) size 210 libglibc/obstack.c size = 4096 - extra; size 215 libglibc/obstack.c h->chunk_size = size; size 217 libglibc/obstack.h #define obstack_begin(h, size) \ size 218 libglibc/obstack.h _obstack_begin ((h), (size), 0, \ size 222 libglibc/obstack.h #define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \ size 223 libglibc/obstack.h _obstack_begin ((h), (size), (alignment), \ size 227 libglibc/obstack.h #define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \ size 228 libglibc/obstack.h _obstack_begin_1 ((h), (size), (alignment), \ size 70 libglibc/regex.c # define re_match(bufp, string, size, pos, regs) \ size 71 libglibc/regex.c __re_match (bufp, string, size, pos, regs) size 72 libglibc/regex.c # define re_search(bufp, string, size, startpos, range, regs) \ size 73 libglibc/regex.c __re_search (bufp, string, size, startpos, range, regs) size 324 libglibc/regex.c # define REGEX_ALLOCATE_STACK(size) \ size 325 libglibc/regex.c r_alloc (&failure_stack_ptr, (size)) size 1164 libglibc/regex.c unsigned long int size; size 1189 libglibc/regex.c unsigned size; size 1197 libglibc/regex.c #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size) size 1212 libglibc/regex.c fail_stack.size = INIT_FAILURE_ALLOC; \ size 1235 libglibc/regex.c ((fail_stack).size > (unsigned) (re_max_failures * MAX_FAILURE_ITEMS) \ size 1239 libglibc/regex.c (fail_stack).size * sizeof (fail_stack_elt_t), \ size 1240 libglibc/regex.c ((fail_stack).size << 1) * sizeof (fail_stack_elt_t)), \ size 1244 libglibc/regex.c : ((fail_stack).size <<= 1, \ size 1315 libglibc/regex.c DEBUG_PRINT2 (" size: %d\n", (fail_stack).size);\ size 1327 libglibc/regex.c (fail_stack).size); \ size 1405 libglibc/regex.c #define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail) size 1431 libglibc/regex.c DEBUG_PRINT2 (" size: %d\n", fail_stack.size); \ size 1554 libglibc/regex.c static reg_errcode_t regex_compile _RE_ARGS ((const char *pattern, size_t size, size 1741 libglibc/regex.c unsigned size; size 1749 libglibc/regex.c #define COMPILE_STACK_FULL (compile_stack.avail == compile_stack.size) size 1881 libglibc/regex.c regex_compile (pattern, size, syntax, bufp) size 1883 libglibc/regex.c size_t size; size 1903 libglibc/regex.c const char *pend = pattern + size; size 1942 libglibc/regex.c for (debug_count = 0; debug_count < size; debug_count++) size 1953 libglibc/regex.c compile_stack.size = INIT_COMPILE_STACK_SIZE; size 2448 libglibc/regex.c RETALLOC (compile_stack.stack, compile_stack.size << 1, size 2452 libglibc/regex.c compile_stack.size <<= 1; size 2959 libglibc/regex.c if (fail_stack.size < (2 * re_max_failures * MAX_FAILURE_ITEMS)) size 2961 libglibc/regex.c fail_stack.size = (2 * re_max_failures * MAX_FAILURE_ITEMS); size 2966 libglibc/regex.c = (fail_stack_elt_t *) xmalloc (fail_stack.size size 2971 libglibc/regex.c (fail_stack.size size 2976 libglibc/regex.c = (fail_stack_elt_t *) malloc (fail_stack.size size 2981 libglibc/regex.c (fail_stack.size size 3533 libglibc/regex.c re_search (bufp, string, size, startpos, range, regs) size 3536 libglibc/regex.c int size, startpos, range; size 3539 libglibc/regex.c return re_search_2 (bufp, NULL, 0, string, size, startpos, range, size 3540 libglibc/regex.c regs, size); size 3794 libglibc/regex.c re_match (bufp, string, size, pos, regs) size 3797 libglibc/regex.c int size, pos; size 3800 libglibc/regex.c int result = re_match_2_internal (bufp, NULL, 0, string, size, size 3801 libglibc/regex.c pos, regs, size); size 321 libparser/asm_scan.c YY_BUFFER_STATE asm__create_buffer (FILE *file,int size ); size 333 libparser/asm_scan.c YY_BUFFER_STATE asm__scan_buffer (char *base,yy_size_t size ); size 1812 libparser/asm_scan.c YY_BUFFER_STATE asm__create_buffer (FILE * file, int size ) size 1820 libparser/asm_scan.c b->yy_buf_size = size; size 2014 libparser/asm_scan.c YY_BUFFER_STATE asm__scan_buffer (char * base, yy_size_t size ) size 2018 libparser/asm_scan.c if ( size < 2 || size 2019 libparser/asm_scan.c base[size-2] != YY_END_OF_BUFFER_CHAR || size 2020 libparser/asm_scan.c base[size-1] != YY_END_OF_BUFFER_CHAR ) size 2028 libparser/asm_scan.c b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ size 2318 libparser/asm_scan.c void *asm_alloc (yy_size_t size ) size 2320 libparser/asm_scan.c return (void *) malloc( size ); size 2323 libparser/asm_scan.c void *asm_realloc (void * ptr, yy_size_t size ) size 2332 libparser/asm_scan.c return (void *) realloc( (char *) ptr, size ); size 239 libparser/parser.c int i, size = sizeof(lang_switch) / sizeof(struct lang_entry); size 254 libparser/parser.c for (i = 0; i < size; i++) size 367 libparser/parser.c param.size = sizeof(param); size 58 libparser/parser.h int size; /**< size of this structure */ size 321 libparser/php.c YY_BUFFER_STATE php__create_buffer (FILE *file,int size ); size 333 libparser/php.c YY_BUFFER_STATE php__scan_buffer (char *base,yy_size_t size ); size 1866 libparser/php.c YY_BUFFER_STATE php__create_buffer (FILE * file, int size ) size 1874 libparser/php.c b->yy_buf_size = size; size 2068 libparser/php.c YY_BUFFER_STATE php__scan_buffer (char * base, yy_size_t size ) size 2072 libparser/php.c if ( size < 2 || size 2073 libparser/php.c base[size-2] != YY_END_OF_BUFFER_CHAR || size 2074 libparser/php.c base[size-1] != YY_END_OF_BUFFER_CHAR ) size 2082 libparser/php.c b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ size 2332 libparser/php.c void *php_alloc (yy_size_t size ) size 2334 libparser/php.c return (void *) malloc( size ); size 2337 libparser/php.c void *php_realloc (void * ptr, yy_size_t size ) size 2346 libparser/php.c return (void *) realloc( (char *) ptr, size ); size 188 libutil/abs2rel.c normalize(const char *path, const char *root, const char *cwd, char *result, const int size) size 192 libutil/abs2rel.c if (normalize_pathname(path, result, size) == NULL) size 218 libutil/abs2rel.c strlimcpy(result, "./", size); size 219 libutil/abs2rel.c strlimcpy(result + 2, p, size - 2); size 249 libutil/abs2rel.c normalize_pathname(const char *path, char *result, const int size) size 253 libutil/abs2rel.c char *endp = result + size - 1; size 335 libutil/abs2rel.c abs2rel(const char *path, const char *base, char *result, const int size) size 341 libutil/abs2rel.c const char *endp = result + size - 1; size 345 libutil/abs2rel.c if (strlen(path) >= size) size 349 libutil/abs2rel.c } else if (!isabspath(base) || !size) { size 352 libutil/abs2rel.c } else if (size == 1) size 416 libutil/abs2rel.c rel2abs(const char *path, const char *base, char *result, const int size) size 422 libutil/abs2rel.c const char *endp = result + size - 1; size 427 libutil/abs2rel.c if (strlen(path) >= size) size 431 libutil/abs2rel.c } else if (!isabspath(base) || !size) { size 434 libutil/abs2rel.c } else if (size == 1) size 440 libutil/abs2rel.c if (length >= size) size 491 libutil/abs2rel.c if (length >= size) size 42 libutil/checkalloc.c check_malloc(size_t size) size 44 libutil/checkalloc.c void *p = (void *)malloc(size); size 59 libutil/checkalloc.c check_calloc(size_t number, size_t size) size 61 libutil/checkalloc.c void *p = (void *)calloc(number, size); size 75 libutil/checkalloc.c check_realloc(void *area, size_t size) size 77 libutil/checkalloc.c void *p = (void *)realloc(area, size); size 335 libutil/dbop.c key.size = strlen(name)+1; size 339 libutil/dbop.c dbop->lastsize = dat.size; size 378 libutil/dbop.c key.size = strlen(name)+1; size 380 libutil/dbop.c dat.size = strlen(data)+1; size 414 libutil/dbop.c key.size = strlen(name)+1; size 416 libutil/dbop.c dat.size = length; size 442 libutil/dbop.c key.size = strlen(path)+1; size 489 libutil/dbop.c key.size = strlen(name); size 494 libutil/dbop.c key.size++; size 495 libutil/dbop.c dbop->keylen = key.size; size 524 libutil/dbop.c dbop->lastsize = dat.size; size 526 libutil/dbop.c dbop->lastkeysize = key.size; size 579 libutil/dbop.c dbop->lastsize = dat.size; size 581 libutil/dbop.c dbop->lastkeysize = key.size; size 617 libutil/dbop.c dbop_lastdat(DBOP *dbop, int *size) size 619 libutil/dbop.c if (size) size 620 libutil/dbop.c *size = dbop->lastsize; size 629 libutil/dbop.c int size; size 630 libutil/dbop.c const char *dat = dbop_lastdat(dbop, &size); size 639 libutil/dbop.c if (size > i) size 87 libutil/env.c int size = 0; size 90 libutil/env.c size += strlen(*e) + 1; size 92 libutil/env.c return size; size 141 libutil/getdbpath.c gtagsexist(const char *candidate, char *dbpath, int size, int verbose) size 162 libutil/getdbpath.c snprintf(dbpath, size, "%s", candidate); size 172 libutil/getdbpath.c snprintf(dbpath, size, "%s/%s", candidate_without_slash, makeobjdir); size 183 libutil/getdbpath.c snprintf(dbpath, size, "%s%s", makeobjdirprefix, candidate_without_slash); size 96 libutil/idset.c idset_open(unsigned int size) size 106 libutil/idset.c idset->set = (unsigned long *)check_calloc(sizeof(unsigned long), (size + LONG_BIT - 1) / LONG_BIT); size 107 libutil/idset.c idset->size = size; size 137 libutil/idset.c if (id >= idset->size) size 28 libutil/idset.h unsigned int size; size 101 libutil/linetable.c linetable_read(char *buf, int size) size 107 libutil/linetable.c if (size > leaved) size 108 libutil/linetable.c size = leaved; size 109 libutil/linetable.c memcpy(buf, curp, size); size 110 libutil/linetable.c curp += size; size 112 libutil/linetable.c return size; size 72 libutil/pool.c pool_malloc(POOL *pool, int size) size 74 libutil/pool.c return obstack_alloc(&pool->obstack, size); size 85 libutil/pool.c pool_strdup(POOL *pool, const char *string, int size) size 87 libutil/pool.c if (size == 0) size 88 libutil/pool.c size = strlen(string); size 89 libutil/pool.c return obstack_copy0(&pool->obstack, string, size); size 103 libutil/pool.c int size = p ? p - string : strlen(string); size 104 libutil/pool.c return obstack_copy0(&pool->obstack, string, size); size 144 libutil/strhash.c strhash_strdup(STRHASH *sh, const char *string, int size) size 146 libutil/strhash.c return pool_strdup(sh->pool, string, size); size 165 libutil/strmake.c strcpy_withterm(char *b, const char *s, int size, int term) size 167 libutil/strmake.c char *endp = b + size - 1; size 75 libutil/tab.c int n = (spaces < size) ? spaces : size; \ size 77 libutil/tab.c size -= n; \ size 84 libutil/tab.c read_file_detabing(char *buf, size_t size, FILE *ip, int *dest_saved, int *spaces_saved) size 89 libutil/tab.c if (size == 0) size 96 libutil/tab.c while (size > 0) { size 111 libutil/tab.c size--; size 56 libutil/test.c int i, size; size 61 libutil/test.c size = read(ip, buf, sizeof(buf)); size 63 libutil/test.c if (size < 0) size 65 libutil/test.c if (size >= 7 && locatestring(buf, "!<arch>", MATCH_AT_FIRST)) /* ar */ size 67 libutil/test.c if (size >= 4 && locatestring(buf, "%PDF", MATCH_AT_FIRST)) /* PDF */ size 69 libutil/test.c for (i = 0; i < size; i++) { size 91 libutil/varray.c varray_open(int size, int expand) size 95 libutil/varray.c if (size < 1) size 99 libutil/varray.c vb->size = size; size 144 libutil/varray.c vb->vbuf = (char *)check_malloc(vb->size * vb->alloced); size 146 libutil/varray.c vb->vbuf = (char *)check_realloc(vb->vbuf, vb->size * vb->alloced); size 150 libutil/varray.c return (void *)(vb->vbuf + vb->size * index); size 24 libutil/varray.h int size; size 253 plugin-factory/exuberant-ctags.c assert(param->size >= sizeof(*param));