Lines Matching defs:before
569 * we have to calculate each entries' hashvalue and sort them before
879 node->btree[0].before = cpu_to_be32(blkno);
1648 int before, after, smallest, entsize;
1676 before = after = -1;
1690 before = i;
1704 if ((before >= 0) || (after >= 0)) {
1705 if ((before >= 0) && (after >= 0)) {
1706 map = &hdr->freemap[before];
1712 } else if (before >= 0) {
1713 map = &hdr->freemap[before];
1902 * the found entry, or where the entry should have been (insert before
2216 * Return 0 unless leaf2 should go before leaf1.
2749 child_fsb = be32_to_cpu(node->btree[0].before);
2762 * before we come back to this one.
2809 child_fsb = be32_to_cpu(node->btree[i+1].before);