ent 158 maint/gnulib/lib/di-set.c struct di_ent *ent; ent 175 maint/gnulib/lib/di-set.c ent = hash_insert (dis->dev_map, probe); ent 176 maint/gnulib/lib/di-set.c if (! ent) ent 179 maint/gnulib/lib/di-set.c if (ent != probe) ent 182 maint/gnulib/lib/di-set.c probe->ino_set = ent->ino_set; ent 31 maint/gnulib/lib/file-set.c struct F_triple *ent; ent 36 maint/gnulib/lib/file-set.c ent = xmalloc (sizeof *ent); ent 37 maint/gnulib/lib/file-set.c ent->name = xstrdup (file); ent 38 maint/gnulib/lib/file-set.c ent->st_ino = stats->st_ino; ent 39 maint/gnulib/lib/file-set.c ent->st_dev = stats->st_dev; ent 42 maint/gnulib/lib/file-set.c struct F_triple *ent_from_table = hash_insert (ht, ent); ent 49 maint/gnulib/lib/file-set.c if (ent_from_table != ent) ent 53 maint/gnulib/lib/file-set.c triple_free (ent); ent 74 maint/gnulib/lib/fts-cycle.c enter_dir (FTS *fts, FTSENT *ent) ent 78 maint/gnulib/lib/fts-cycle.c struct stat const *st = ent->fts_statp; ent 87 maint/gnulib/lib/fts-cycle.c ad->fts_ent = ent; ent 102 maint/gnulib/lib/fts-cycle.c ent->fts_cycle = ad_from_table->fts_ent; ent 103 maint/gnulib/lib/fts-cycle.c ent->fts_info = FTS_DC; ent 108 maint/gnulib/lib/fts-cycle.c if (cycle_check (fts->fts_cycle.state, ent->fts_statp)) ent 114 maint/gnulib/lib/fts-cycle.c ent->fts_cycle = ent; ent 115 maint/gnulib/lib/fts-cycle.c ent->fts_info = FTS_DC; ent 125 maint/gnulib/lib/fts-cycle.c leave_dir (FTS *fts, FTSENT *ent) ent 127 maint/gnulib/lib/fts-cycle.c struct stat const *st = ent->fts_statp; ent 141 maint/gnulib/lib/fts-cycle.c FTSENT *parent = ent->fts_parent; ent 706 maint/gnulib/lib/fts.c struct dev_type *ent; ent 722 maint/gnulib/lib/fts.c ent = hash_lookup (h, &tmp); ent 723 maint/gnulib/lib/fts.c if (ent) ent 724 maint/gnulib/lib/fts.c return ent->f_type; ent 739 maint/gnulib/lib/fts.c ent = hash_insert (h, t2); ent 740 maint/gnulib/lib/fts.c if (ent) ent 741 maint/gnulib/lib/fts.c fts_assert (ent == t2); ent 1626 maint/gnulib/lib/fts.c FTSENT const *ent; ent 1627 maint/gnulib/lib/fts.c for (ent = e_curr; ent->fts_level >= FTS_ROOTLEVEL; ent = ent->fts_parent) ent 1629 maint/gnulib/lib/fts.c if (ad->ino == ent->fts_statp->st_ino ent 1630 maint/gnulib/lib/fts.c && ad->dev == ent->fts_statp->st_dev) ent 1635 maint/gnulib/lib/fts.c for (ent = e_curr; ent 1636 maint/gnulib/lib/fts.c ent->fts_level >= FTS_ROOTLEVEL; ent = ent->fts_parent) ent 1641 maint/gnulib/lib/fts.c ent->fts_accpath, ent 1642 maint/gnulib/lib/fts.c (uintmax_t) ent->fts_statp->st_dev, ent 1643 maint/gnulib/lib/fts.c (uintmax_t) ent->fts_statp->st_ino); ent 1649 maint/gnulib/lib/fts.c FTSENT const *ent = sp->fts_cur; ent 1654 maint/gnulib/lib/fts.c Dprintf (("fts-cross-check cur=%s\n", ent->fts_path)); ent 1656 maint/gnulib/lib/fts.c for (t = ent->fts_parent; t->fts_level >= FTS_ROOTLEVEL; t = t->fts_parent) ent 1667 maint/gnulib/lib/fts.c if (ent->fts_parent->fts_level >= FTS_ROOTLEVEL ent 1668 maint/gnulib/lib/fts.c && (ent->fts_info == FTS_DP ent 1669 maint/gnulib/lib/fts.c || ent->fts_info == FTS_D)) ent 1675 maint/gnulib/lib/fts.c find_matching_ancestor (ent, ad); ent 121 maint/gnulib/lib/ino-map.c struct ino_map_ent *ent; ent 139 maint/gnulib/lib/ino-map.c ent = hash_insert (im->map, probe); ent 140 maint/gnulib/lib/ino-map.c if (! ent) ent 143 maint/gnulib/lib/ino-map.c if (ent != probe) ent 146 maint/gnulib/lib/ino-map.c probe->mapped_ino = ent->mapped_ino; ent 1843 maint/gnulib/lib/regexec.c struct re_backref_cache_entry *ent; ent 1844 maint/gnulib/lib/regexec.c ent = mctx->bkref_ents + limits->elems[lim_idx]; ent 1845 maint/gnulib/lib/regexec.c subexp_idx = dfa->nodes[ent->node].opr.idx; ent 1884 maint/gnulib/lib/regexec.c struct re_backref_cache_entry *ent = mctx->bkref_ents + bkref_idx; ent 1890 maint/gnulib/lib/regexec.c if (ent->node != node) ent 1894 maint/gnulib/lib/regexec.c && !(ent->eps_reachable_subexps_map ent 1922 maint/gnulib/lib/regexec.c ent->eps_reachable_subexps_map ent 1925 maint/gnulib/lib/regexec.c while (ent++->more); ent 1987 maint/gnulib/lib/regexec.c struct re_backref_cache_entry *ent; ent 1988 maint/gnulib/lib/regexec.c ent = bkref_ents + limits->elems[lim_idx]; ent 1990 maint/gnulib/lib/regexec.c if (str_idx <= ent->subexp_from || ent->str_idx < str_idx) ent 1993 maint/gnulib/lib/regexec.c subexp_idx = dfa->nodes[ent->node].opr.idx; ent 1994 maint/gnulib/lib/regexec.c if (ent->subexp_to == str_idx) ent 3152 maint/gnulib/lib/regexec.c struct re_backref_cache_entry *ent; ent 3158 maint/gnulib/lib/regexec.c ent = mctx->bkref_ents + cache_idx_start; ent 3164 maint/gnulib/lib/regexec.c if (!re_node_set_contains (cur_nodes, ent->node)) ent 3167 maint/gnulib/lib/regexec.c to_idx = cur_str + ent->subexp_to - ent->subexp_from; ent 3176 maint/gnulib/lib/regexec.c next_node = dfa->edests[ent->node].elems[0]; ent 3196 maint/gnulib/lib/regexec.c next_node = dfa->nexts[ent->node]; ent 3226 maint/gnulib/lib/regexec.c while (ent++->more); ent 49 maint/gnulib/tests/test-hash.c insert_new (Hash_table *ht, const void *ent) ent 51 maint/gnulib/tests/test-hash.c void *e = hash_insert (ht, ent); ent 52 maint/gnulib/tests/test-hash.c ASSERT (e == ent); ent 56 maint/gnulib/tests/test-hash.c walk (void *ent, void *data) ent 58 maint/gnulib/tests/test-hash.c char *str = ent;