Lines Matching defs:entry
33 * HASHFACTOR. The variable "entry" points to the hash table;
37 static struct entry **entry;
41 static void addino(ino_t, struct entry *);
42 static struct entry *lookupparent(char *);
43 static void removeentry(struct entry *);
46 static struct entry *lookupparent();
51 * Look up an entry by inode number
53 struct entry *
57 struct entry *ep;
61 for (ep = entry[inum % entrytblsize]; ep != NIL; ep = ep->e_next)
80 * Add an entry into the entry table
85 struct entry *np;
87 struct entry **epp;
97 epp = &entry[inum % entrytblsize];
108 * Delete an entry from the entry table. We assume our caller
115 struct entry *next;
116 struct entry **prev;
127 prev = &entry[inum % entrytblsize];
139 * Look up an entry by name.
145 struct entry *
149 struct entry *ep;
190 static struct entry *
194 struct entry *ep;
230 * ./<path>/entry\0<path>/attrentry\0<path>/...\0\0
232 * return pntr entry attr recursive attr terminator
239 struct entry *ep;
242 struct entry *root = lookupino(ROOTINO);
267 static struct entry *freelist = NIL;
270 * add an entry to the symbol table
272 struct entry *
278 struct entry *np, *ep;
286 np = (struct entry *)calloc(1, sizeof (*np));
338 /* add this entry to the entry list of the parent dir */
356 panic(gettext("duplicate entry\n"));
364 * delete an entry from the symbol table
368 struct entry *ep;
370 struct entry *np;
408 * Relocate an entry in the tree structure
412 struct entry *ep;
415 struct entry *np;
446 * Remove an entry in the tree structure
450 struct entry *ep;
452 struct entry *np;
472 "cannot find entry in parent list"));
480 * of similar lengths can use the same entry. The value of STRTBLINCR
481 * is chosen so that every entry has at least enough space to hold
482 * a "struct strtbl" header. Thus every entry can be linked onto an
501 * has an appropriate sized entry, and if not allocates a new one.
541 * Free space for a name. The resulting entry is linked onto the
581 struct entry *ep, *tep;
583 struct entry temp, *tentry;
599 * Assign an index to each entry
623 tep->e_parent = (struct entry *)ep->e_parent->e_index;
626 (struct entry *)ep->e_links->e_index;
629 (struct entry *)ep->e_sibling->e_index;
632 (struct entry *)ep->e_entries->e_index;
635 (struct entry *)ep->e_xattrs->e_index;
638 (struct entry *)ep->e_next->e_index;
643 * Convert entry pointers to indices, and output
646 if (entry[i] == NIL)
649 tentry = (struct entry *)entry[i]->e_index;
682 struct entry *ep;
683 struct entry *baseep, *lep;
698 entry = (struct entry **)
700 calloc((size_t)entrytblsize, sizeof (*entry));
701 if (entry == (struct entry **)NULL) {
703 gettext("no memory for entry table\n"));
796 entry = (struct entry **)
797 (base + tblsize - (entrytblsize * sizeof (*entry)));
798 if (((ulong_t)entry % 4) != 0) {
804 baseep = (struct entry *)
811 lep = (struct entry *)entry;
813 if (entry[i] == NIL)
815 entry[i] = &baseep[(long)entry[i]];