Lines Matching refs:index
174 /* path points to leaf/index in inode body */
201 /* path points to leaf/index in inode body */
246 /* it looks like index is empty;
247 * try to find starting block from index itself */
407 * the number in the index block.
431 * the number in the parent index block.
440 /* Check for overlapping index extents */
634 * the index block, go up
718 ext_debug(inode, "%d: move %d:%llu in new index %llu\n",
747 * binary search for the closest index of the given block
971 * insert new index [@logical;@ptr] into the block at @curp;
1003 ext_debug(inode, "insert new index %d after: %llu\n",
1008 ext_debug(inode, "insert new index %d before: %llu\n",
1021 ext_debug(inode, "insert new index %d: "
1044 * inserts new subtree into the path, using free index entry
1046 * - allocates all needed blocks (new leaf and all intermediate index blocks)
1048 * - moves remaining extents and index entries (right to the split point)
1095 * and mark filesystem read-only. index won't
1199 /* insert new index into current index block */
1227 ext_debug(inode, "int.index at %d (block %llu): %u -> %llu\n",
1230 /* move remainder of path[i] to the new index block */
1264 /* correct old index */
1278 /* insert new index */
1307 * - moves top-level data (index block or leaf) into the new block
1308 * - initializes new top-level, creating index that points to the
1321 /* Try to prepend new index to old one */
1347 /* move top-level index/leaf into new block */
1370 /* Update top-level index: num,max,pointer */
1375 /* Root extent block becomes index block */
1395 * finds empty index and adds new leaf.
1396 * if no free index is found, then it requests in-depth growing.
1411 /* walk up to the tree and look for free index entry */
1418 /* we use already allocated block for index block,
1421 /* if we found index with free entry, then use that
1594 /* go up and search for index to the right */
1601 /* we've gone up to the root and found no index to the right */
1605 /* we've found index to the right, let's
1637 * NOTE: it considers block number from index entry as
1638 * allocated block. Thus, index entries have to be consistent
1660 /* index */
1685 /* go to index block */
2275 * removes index from the index block.
2283 /* free index block */
2305 ext_debug(inode, "index is empty, remove it, free block %llu\n", leaf);
2362 * How many index/leaf blocks need to change/allocate to add @extents extents?
2365 * index/leaf need to be changed in case of the tree split.
2372 int index;
2382 index = depth * 2;
2384 index = depth * 3;
2386 return index;
2665 * We may end up freeing some index blocks and data from the
2760 * remove it from index block above */
2770 * returns 1 if current index has to be freed (even partial)
2782 * so we have to consider current index for truncation
2943 /* this is index block */
2953 ext_debug(inode, "init index ptr: hdr 0x%p, num %d\n",
2957 /* we were already here, see at next index */
2961 ext_debug(inode, "level %d - index, first 0x%p, cur 0x%p\n",
2992 /* we finished processing this index, go up */
2994 /* index is empty, remove it;
3639 * One of more index blocks maybe needed if the extent tree grow after
5121 /* Update index too */
5134 /* we are done if current index is not a starting index */