ce_namelen 4075 builtin/apply.c ce->ce_namelen = namelen; ce_namelen 4198 builtin/apply.c ce->ce_namelen = namelen; ce_namelen 2390 builtin/blame.c ce->ce_namelen = len; ce_namelen 58 builtin/checkout-index.c if (ce_namelen(ce) != namelen || ce_namelen 103 builtin/checkout-index.c (ce_namelen(ce) <= prefix_length || ce_namelen 107 builtin/checkout-index.c if (ce_namelen(last_ce) != ce_namelen(ce) ce_namelen 108 builtin/checkout-index.c || memcmp(last_ce->name, ce->name, ce_namelen(ce))) ce_namelen 82 builtin/checkout.c ce->ce_namelen = len; ce_namelen 90 builtin/checkout.c pos = cache_name_pos(ce->name, ce->ce_namelen); ce_namelen 113 builtin/ls-files.c len = ce_namelen(active_cache[pos]); ce_namelen 139 builtin/ls-files.c if (len >= ce_namelen(ce)) ce_namelen 142 builtin/ls-files.c if (!match_pathspec(&pathspec, ce->name, ce_namelen(ce), ce_namelen 265 builtin/update-index.c ce->ce_namelen = len; ce_namelen 400 builtin/update-index.c ce->ce_namelen = len; ce_namelen 596 builtin/update-index.c ce->ce_namelen = namelen; ce_namelen 616 builtin/update-index.c ce_namelen(ce) == namelen && ce_namelen 629 builtin/update-index.c if (ce_namelen(ce) == namelen && ce_namelen 733 builtin/update-index.c ce->name, ce_namelen(ce), 0); ce_namelen 280 cache-tree.c pathlen = ce_namelen(ce); ce_namelen 332 cache-tree.c pathlen = ce_namelen(ce); ce_namelen 155 cache.h unsigned int ce_namelen; ce_namelen 238 cache.h #define ce_namelen(ce) ((ce)->ce_namelen) ce_namelen 239 cache.h #define ce_size(ce) cache_entry_size(ce_namelen(ce)) ce_namelen 36 diff-lib.c if (has_symlink_leading_path(ce->name, ce_namelen(ce))) ce_namelen 120 diff-lib.c path_len = ce_namelen(ce); ce_namelen 334 diff-lib.c int pathlen = ce_namelen(new); ce_namelen 289 dir.h return match_pathspec(pathspec, ce->name, ce_namelen(ce), 0, seen, ce_namelen 259 entry.c strbuf_add(&path, ce->name, ce_namelen(ce)); ce_namelen 260 merge-recursive.c (int)ce_namelen(ce), ce->name); ce_namelen 73 name-hash.c struct dir_entry *dir = hash_dir_entry(istate, ce, ce_namelen(ce)); ce_namelen 84 name-hash.c struct dir_entry *dir = hash_dir_entry(istate, ce, ce_namelen(ce)); ce_namelen 98 name-hash.c hashmap_entry_init(ce, memihash(ce->name, ce_namelen(ce))); ce_namelen 168 name-hash.c int len = ce_namelen(ce); ce_namelen 278 pathspec.c int ce_len = ce_namelen(ce); ce_namelen 58 preload-index.c if (threaded_has_symlink_leading_path(&cache, ce->name, ce_namelen(ce))) ce_namelen 79 read-cache.c new->ce_namelen = namelen; ce_namelen 493 read-cache.c int cmp = cache_name_stage_compare(name, namelen, stage, ce->name, ce_namelen(ce), ce_stage(ce)); ce_namelen 566 read-cache.c return namelen != ce_namelen(ce) || memcmp(path, ce->name, namelen); ce_namelen 594 read-cache.c int len = ce_namelen(ce); ce_namelen 595 read-cache.c return ce_namelen(alias) != len || memcmp(ce->name, alias->name, len); ce_namelen 618 read-cache.c len = ce_namelen(alias); ce_namelen 657 read-cache.c ce->ce_namelen = namelen; ce_namelen 685 read-cache.c alias = index_file_exists(istate, ce->name, ce_namelen(ce), ignore_case); ce_namelen 751 read-cache.c ce->ce_namelen = len; ce_namelen 762 read-cache.c int len = ce_namelen(a); ce_namelen 763 read-cache.c return ce_namelen(b) == len && !memcmp(a->name, b->name, len); ce_namelen 840 read-cache.c int len = ce_namelen(ce); ce_namelen 847 read-cache.c if (len >= ce_namelen(p)) ce_namelen 875 read-cache.c const char *slash = name + ce_namelen(ce); ce_namelen 916 read-cache.c if ((ce_namelen(p) <= len) || ce_namelen 979 read-cache.c pos = index_name_stage_pos(istate, ce->name, ce_namelen(ce), ce_stage(ce)); ce_namelen 1014 read-cache.c pos = index_name_stage_pos(istate, ce->name, ce_namelen(ce), ce_stage(ce)); ce_namelen 1089 read-cache.c if (has_symlink_leading_path(ce->name, ce_namelen(ce))) { ce_namelen 1346 read-cache.c ondisk_cache_entry_extended_size(ce_namelen(ce)) : \ ce_namelen 1347 read-cache.c ondisk_cache_entry_size(ce_namelen(ce))) ce_namelen 1426 read-cache.c ce->ce_namelen = len; ce_namelen 1833 read-cache.c flags |= (ce_namelen(ce) >= CE_NAMEMASK ? CE_NAMEMASK : ce_namelen(ce)); ce_namelen 1856 read-cache.c saved_namelen = ce_namelen(ce); ce_namelen 1857 read-cache.c ce->ce_namelen = 0; ce_namelen 1864 read-cache.c memcpy(name, ce->name, ce_namelen(ce)); ce_namelen 1881 read-cache.c size += prefix_size + (ce_namelen(ce) - common + 1); ce_namelen 1886 read-cache.c memcpy(name + prefix_size, ce->name + common, ce_namelen(ce) - common); ce_namelen 1889 read-cache.c ce->name + common, ce_namelen(ce) - common); ce_namelen 1892 read-cache.c ce->ce_namelen = saved_namelen; ce_namelen 2200 read-cache.c len = ce_namelen(ce); ce_namelen 2205 read-cache.c new_ce->ce_namelen = len; ce_namelen 2235 read-cache.c if (ce_namelen(ce) == namelen && ce_namelen 324 rerere.c if (ce_namelen(ce) != len || memcmp(ce->name, path, len)) ce_namelen 1298 sha1_name.c if (ce_namelen(ce) == namelen && ce_namelen 1316 sha1_name.c if (ce_namelen(ce) == fullnamelen && ce_namelen 1412 sha1_name.c if (ce_namelen(ce) != namelen || ce_namelen 120 split-index.c if (ce_namelen(src)) ce_namelen 125 split-index.c src->ce_namelen = dst->ce_namelen; ce_namelen 155 split-index.c if (!ce_namelen(si->saved_cache[i])) ce_namelen 213 split-index.c if (ce->ce_namelen != base->ce_namelen || ce_namelen 193 submodule.c if (ce_namelen(ce) == 11 && ce_namelen 26 tree.c ce->ce_namelen = baselen + len; ce_namelen 143 tree.c return cache_name_stage_compare(ce1->name, ce1->ce_namelen, ce_stage(ce1), ce_namelen 144 tree.c ce2->name, ce2->ce_namelen, ce_stage(ce2)); ce_namelen 180 unpack-trees.c if (!check_leading_path(ce->name, ce_namelen(ce))) ce_namelen 184 unpack-trees.c schedule_dir_for_removal(ce->name, ce_namelen(ce)); ce_namelen 343 unpack-trees.c int len = ce_namelen(ce); ce_namelen 359 unpack-trees.c int len = ce_namelen(ce); ce_namelen 364 unpack-trees.c if (len != ce_namelen(next) || ce_namelen 389 unpack-trees.c int len = ce_namelen(ce); ce_namelen 396 unpack-trees.c if (len != ce_namelen(next) || ce_namelen 512 unpack-trees.c ce_len = ce_namelen(ce); ce_namelen 535 unpack-trees.c return ce_namelen(ce) > traverse_path_len(info, n); ce_namelen 549 unpack-trees.c return (info->pathlen < ce_namelen(ce)); ce_namelen 559 unpack-trees.c ce->ce_namelen = len; ce_namelen 671 unpack-trees.c ce_len = ce_namelen(ce) - pfxlen; ce_namelen 946 unpack-trees.c ret = is_excluded_from_list(ce->name, ce_namelen(ce), ce_namelen 1326 unpack-trees.c namelen = ce_namelen(ce); ce_namelen 1331 unpack-trees.c int len = ce_namelen(ce2); ce_namelen 1450 unpack-trees.c len = check_leading_path(ce->name, ce_namelen(ce)); ce_namelen 1472 unpack-trees.c return check_ok_to_remove(ce->name, ce_namelen(ce),