d_entry
while (d1->d_entry != 0 || d2->d_entry != 0) {
if (d1->d_entry && useless(d1->d_entry)) {
if (d2->d_entry && useless(d2->d_entry)) {
if (d1->d_entry == 0)
else if (d2->d_entry == 0)
cmp = strcmp(d1->d_entry, d2->d_entry);
for (d1 = dir1; d1->d_entry; d1++) {
(void) strcpy(efile1, d1->d_entry);
(void) strcpy(efile2, d1->d_entry);
for (; dp->d_entry; dp++) {
(void) printf("\t%s\n", dp->d_entry);
dp->d_entry);
ep->d_entry = 0;
ep->d_entry = (char *)malloc(size + 1);
if (ep->d_entry == 0)
(void) strcpy(ep->d_entry, rp->d_name);
dp[nitems].d_entry = 0; /* delimiter */
return (strcmp(d1->d_entry, d2->d_entry));
(void) strcpy(efile1, dp->d_entry);
(void) strcpy(efile2, dp->d_entry);
(void) printf("ed - %s << '-*-END-*-'\n", dp->d_entry);
char *d_entry;
print_dent(i_number << l2b, d_entry);
d_entry = value;
d_entry = 0;
uint32_t d_entry = 0;
d_entry = value;
d_entry + 1) == 0) {
d_entry ++;
d_entry);
d_entry - 1) == 0) {
d_entry --;
d_entry);
d_entry **dep;
dep = (d_entry **)get_hash(tbl, (char *)sym_name);
char *ptr = malloc(sizeof (d_entry));
(*dep) = (d_entry *)ptr;
scanlist(d_entry *dep, void *food, char *name)
d_entry *dep = cur->l_dep;
d_entry *l_dep;
list_insert(d_entry *dep)
d_list_entry_t *d_entry)
d_entry->prev = (d_list_entry_t *) 0;
d_entry->next = d_list->head;
d_list->tail = d_entry;
d_list->head->prev = d_entry;
d_list->head = d_entry;
d_list_entry_t *d_entry;
d_entry = d_list->head;
return d_entry;
d_list_entry_t *d_entry)
d_entry->next = (d_list_entry_t *) 0;
d_entry->prev = d_list->tail;
d_list->tail->next = d_entry;
d_list->head = d_entry;
d_list->tail = d_entry;
d_list_entry_t *d_entry;
d_entry = d_list->tail;
return d_entry;
d_list_entry_t *d_entry)
return d_entry->next;
d_list_entry_t *d_entry)
if(d_list->head == d_entry)
else if(d_list->tail == d_entry)
d_entry->prev->next = d_entry->next;
d_entry->next->prev = d_entry->prev;
d_list_entry_t *d_entry)
d_list_push_head(d_list, d_entry);
d_list_push_tail(d_list, d_entry);
d_entry->next = d_entry_next;
d_entry->prev = d_entry_prev;
d_entry_prev->next = d_entry;
d_entry_next->prev = d_entry;
d_list_entry_t *d_entry)
return d_entry->prev;
d_list_entry_t *d_entry)
d_entry->prev = (d_list_entry_t *) 0;
d_entry->next = d_list->head;
d_list->tail = d_entry;
d_list->head->prev = d_entry;
d_list->head = d_entry;
d_list_entry_t *d_entry;
d_entry = d_list->head;
return d_entry;
d_list_entry_t *d_entry)
d_entry->next = (d_list_entry_t *) 0;
d_entry->prev = d_list->tail;
d_list->tail->next = d_entry;
d_list->head = d_entry;
d_list->tail = d_entry;
d_list_entry_t *d_entry;
d_entry = d_list->tail;
return d_entry;
d_list_entry_t *d_entry)
return d_entry->next;
d_list_entry_t *d_entry)
if(d_list->head == d_entry)
else if(d_list->tail == d_entry)
d_entry->prev->next = d_entry->next;
d_entry->next->prev = d_entry->prev;
d_list_entry_t *d_entry)
d_list_push_head(d_list, d_entry);
d_list_push_tail(d_list, d_entry);
d_entry->next = d_entry_next;
d_entry->prev = d_entry_prev;
d_entry_prev->next = d_entry;
d_entry_next->prev = d_entry;
d_list_entry_t *d_entry)
return d_entry->prev;