Lines Matching defs:find
633 // find mask of free blocks from tree
657 // eagerly find next off so an alloc ack can
1076 // we can find tag very efficiently during a fetch, since we're already
1087 // find the block with the most recent revision
1110 // now scan tags to fetch the actual dir and find possible match
1369 // xor together to find resulting gstate
1443 // we reduce path to a single name if we can find it
1514 // find entry matching name
1663 // find the expected fcrc, don't bother avoiding a reread
2078 // find size of first split, we do this by halving the split until
2441 // find parent
2491 // find pred
2498 // if we can't find dir, it must be new
2596 // find end of list
3524 // find out which block we're extending from
3633 // find new pos
3905 // find old entry
3912 // find new entry
4691 struct lfs_fs_parent_match *find = data;
4692 lfs_t *lfs = find->lfs;
4705 return (lfs_pair_cmp(child, find->pair) == 0) ? LFS_CMP_EQ : LFS_CMP_LT;
4712 // use fetchmatch with callback to find pairs
5619 // find last block and update tail to thread into fs