sbin/restore/symtab.c

68  * HASHFACTOR. The variable "entry" points to the hash table;
72 static struct entry **entry;
75 static void		 addino(ino_t, struct entry *);
76 static struct entry	*lookupparent(char *);
77 static void		 removeentry(struct entry *);
80  * Look up an entry by inode number
82 struct entry *
85 	struct entry *ep;
89 	for (ep = entry[inum % entrytblsize]; ep != NULL; ep = ep->e_next)
96  * Add an entry into the entry table
99 addino(ino_t inum, struct entry *np)
101 	struct entry **epp;
105 	epp = &entry[inum % entrytblsize];
116  * Delete an entry from the entry table
121 	struct entry *next;
122 	struct entry **prev;
126 	prev = &entry[inum % entrytblsize];
139  * Look up an entry by name
141 struct entry *
144 	struct entry *ep;
170 static struct entry *
173 	struct entry *ep;
193 myname(struct entry *ep)
214 static struct entry *freelist = NULL;
217  * add an entry to the symbol table
219 struct entry *
222 	struct entry *np, *ep;
227 		memset(np, 0, (long)sizeof(struct entry));
229 		np = (struct entry *)calloc(1, sizeof(struct entry));
258 			panic("duplicate entry\n");
265  * delete an entry from the symbol table
268 freeentry(struct entry *ep)
270 	struct entry *np;
308  * Relocate an entry in the tree structure
311 moveentry(struct entry *ep, char *newname)
313 	struct entry *np;
336  * Remove an entry in the tree structure
339 removeentry(struct entry *ep)
341 	struct entry *np;
354 			badentry(ep, "cannot find entry in parent list");
362  * of similar lengths can use the same entry. The value of STRTBLINCR
363  * is chosen so that every entry has at least enough space to hold
364  * a "struct strtbl" header. Thus every entry can be linked onto an
381  * has an appropriate sized entry, and if not allocates a new one.
407  * Free space for a name. The resulting entry is linked onto the
440 	struct entry *ep, *tep;
442 	struct entry temp, *tentry;
458 	 * Assign indices to each entry
475 			memmove(tep, ep, (long)sizeof(struct entry));
478 			tep->e_parent = (struct entry *)ep->e_parent->e_index;
481 					(struct entry *)ep->e_links->e_index;
484 					(struct entry *)ep->e_sibling->e_index;
487 					(struct entry *)ep->e_entries->e_index;
490 					(struct entry *)ep->e_next->e_index;
491 			(void) fwrite((char *)tep, sizeof(struct entry), 1, fd);
495 	 * Convert entry pointers to indexes, and output
498 		if (entry[i] == NULL)
501 			tentry = (struct entry *)entry[i]->e_index;
502 		(void) fwrite((char *)&tentry, sizeof(struct entry *), 1, fd);
528 	struct entry *ep;
529 	struct entry *baseep, *lep;
538 		entry = (struct entry **)
539 			calloc((unsigned)entrytblsize, sizeof(struct entry *));
540 		if (entry == (struct entry **)NULL)
541 			panic("no memory for entry table\n");
595 	entry = (struct entry **)
596 		(base + tblsize - (entrytblsize * sizeof(struct entry *)));
597 	baseep = (struct entry *)(base + hdr.stringsize - sizeof(struct entry));
598 	lep = (struct entry *)entry;
600 		if (entry[i] == NULL)
602 		entry[i] = &baseep[(long)entry[i]];