Lines Matching defs:chain
193 add it to the chain */
194 /* We're passed the number of the last EUN in the chain, to save us from
366 fold-in-place of another chain to make room
368 which chain to fold, because makefreeblock will
376 /* We put a fold mark in the chain we are folding only if we
378 place, it is possible to find the valid chain by selecting the
390 pr_debug("Folding chain %d into unit %d\n", thisVUC, targetEUN);
427 /* add the header so that it is now a valid chain */
444 /* For each block in the old chain (except the targetEUN of course),
463 /* Make this the new start of chain for thisVUC */
481 u16 chain, EUN;
483 for (chain = 0; chain < le32_to_cpu(nftl->MediaHdr.FormattedSize) / nftl->EraseSize; chain++) {
484 EUN = nftl->EUNtable[chain];
489 //printk("VUC %d reaches len %d with EUN %d\n", chain, thislen, EUN);
493 chain, EUN);
496 /* Actually, don't return failure. Just ignore this chain and
504 //printk("New longest chain is %d with length %d\n", chain, thislen);
506 LongestChain = chain;
579 /* Skip to next block in chain */
583 /* OK. We didn't find one in the existing chain, or there
584 is no existing chain. */
592 a chain to make room.
595 /* First remember the start of this chain */
625 /* We've found a free block. Insert it into the chain. */
630 /* The first block in a new chain */
647 /* we link the new block to the chain only after the
648 block is ready. It avoids the case where the chain