Lines Matching refs:next
125 freede = de->next;
132 de->next = freede;
150 freedt = dt->next;
157 dt->next = freedt;
246 cl = fat[boot->RootCl].next;
260 fat[boot->RootCl].next = CLUST_FREE;
283 np = p->next;
292 if (!(nd = d->next))
348 startcl = fat[startcl].next;
425 cl = fat[cl].next;
426 clearchain(boot, fat, fat[cl].next);
427 fat[cl].next = CLUST_EOF;
503 } while ((cl = fat[cl].next) >= CLUST_FIRST && cl < boot->NumClusters);
748 dirent.next = dir->child;
790 || fat[dirent.head].next == CLUST_FREE
791 || (fat[dirent.head].next >= CLUST_RSRVD
792 && fat[dirent.head].next < CLUST_EOFS)
802 else if (fat[dirent.head].next == CLUST_FREE)
805 else if (fat[dirent.head].next >= CLUST_RSRVD)
808 rsrvdcltype(fat[dirent.head].next));
939 printf("%s: %s : 0x%02x:head %d, next 0x%0x parent 0x%0x child 0x%0x\n",
940 __func__,d->name,d->flags,d->head,d->next,d->parent,d->child);
947 n->next = pendingDirectories;
966 } while ((cl = fat[cl].next) >= CLUST_FIRST && cl < boot->NumClusters);
989 struct dirTodoNode *n = pendingDirectories->next;
1026 for (lostDir = rootDir->child; lostDir; lostDir = lostDir->next) {
1052 lfcl = p ? fat[lfcl].next : lostDir->head;
