Lines Matching defs:index

27  * cmp_fnames - Compare two names in index.
556 * Find a point at which the index allocation buffer would like to be split.
622 /* incorrect index buffer. */
644 /* Check index buffer vbn. */
648 /* incorrect index buffer. */
708 * hdr_find_e - Locate an entry the index buffer.
713 * current index buffer, for the first entry that is <= to the search value.
798 * hdr_insert_de - Insert an index entry into the buffer.
844 * hdr_delete_de - Remove an entry from the index buffer.
897 /* Check index record size. */
939 struct INDEX_BUFFER *index;
949 index = kzalloc(bytes, GFP_NOFS);
950 if (!index) {
958 kfree(index);
964 index->rhdr.sign = NTFS_INDX_SIGNATURE;
965 index->rhdr.fix_off = cpu_to_le16(sizeof(struct INDEX_BUFFER)); // 0x28
967 index->rhdr.fix_num = cpu_to_le16(fn);
968 index->vbn = cpu_to_le64(vbn);
969 hdr = &index->ihdr;
990 r->index = index;
1025 struct INDEX_BUFFER *ib = node->index;
1057 ib = in->index;
1108 /* check for index header length */
1115 in->index = ib;
1125 if (ib != in->index)
1188 e = hdr_find_e(indx, &node->index->ihdr, key, key_len, ctx,
1236 e = hdr_next_de(&n->index->ihdr, e);
1264 e = hdr_first_de(&n->index->ihdr);
1371 e = hdr_next_de(&n->index->ihdr, e2);
1378 /* Continue with next index. */
1379 next_vbn = le64_to_cpu(n->index->vbn) +
1384 /* Release current index. */
1407 e = hdr_first_de(&n->index->ihdr);
1419 /* 'e' points in index, */
1420 *off = (le64_to_cpu(n->index->vbn) << indx->vbn2vbo_bits) +
1421 record_size + PtrOffset(&n->index->ihdr, e);
1486 * indx_add_allocate - Add clusters to index.
1563 * indx_insert_into_root - Attempt to insert an entry into the index root.
1566 * If necessary, it will twiddle the index b-tree.
1627 * the index root to the new buffer.
1722 hdr = &n->index->ihdr;
1732 /* Check if we can insert new entry new index buffer. */
1735 * This occurs if MFT record is the same or bigger than index
1736 * buffer. Move all root new index and have no space to add
1737 * new entry classic case when MFT record is 1K and index
1750 * Now root is a parent for new index buffer.
1760 /* Just write updates index into disk. */
1790 struct INDEX_HDR *hdr1 = &n1->index->ihdr;
1803 /* Just write updated index into disk. */
1811 * - Save split point ('cause index buffers will be changed)
1845 /* Allocate on disk a new index allocation buffer. */
1850 /* Allocate and format memory a new index buffer. */
1857 hdr2 = &n2->index->ihdr;
1900 * The target buffer's parent is another index buffer.
1924 * indx_insert_entry - Insert new entry into index.
2002 const struct INDEX_HDR *hdr = n ? &n->index->ihdr : &root->ihdr;
2118 hdr = &n->index->ihdr;
2140 * If there are no used indexes after current free index
2178 e = hdr_first_de(&n->index->ihdr);
2200 te = hdr_first_de(&n->index->ihdr);
2231 ib = n->index;
2248 * indx_delete_entry - Delete an entry from the index.
2301 ib = n->index;
2393 sub_vbn = fnd2->nodes[0]->index->vbn;
2397 hdr = level ? &fnd->nodes[level - 1]->index->ihdr : &root->ihdr;
2442 ib = in->index;
2489 * Note: This index block is not empty, so the
2540 ib = fnd->nodes[level]->index;
2568 * Recreate the index root as an empty leaf and free all
2569 * the bits the index allocation bitmap.
2678 * Nothing to update in index! Try to avoid this call.
2686 /* Directory entry in index. */