Lines Matching refs:entry
557 * NOTE: This function should never return 'END' entry NULL returns on error.
575 /* We must not return END entry. */
708 * hdr_find_e - Locate an entry the index buffer.
710 * If no matching entry is found, it returns the first entry which is greater
711 * than the desired entry If the search key is greater than all the entries the
712 * buffer, it returns the 'end' entry. This function does a binary search of the
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.
834 /* Now we just make room for the entry and jam it in. */
844 * hdr_delete_de - Remove an entry from the index buffer.
1137 * indx_find - Scan NTFS directory for given entry.
1141 const void *ctx, int *diff, struct NTFS_DE **entry,
1160 *entry = e;
1168 /* Lookup entry that is <= to the search value. */
1187 /* Lookup entry that is <= to the search value. */
1198 *entry = e;
1203 const struct INDEX_ROOT *root, struct NTFS_DE **entry,
1212 if (!*entry) {
1221 *entry = NULL;
1274 *entry = e;
1299 *entry = NULL;
1304 *entry = e;
1313 const struct INDEX_ROOT *root, struct NTFS_DE **entry,
1326 if (!*entry) {
1348 /* Check if current entry can be used. */
1396 *entry = NULL;
1424 *entry = e;
1563 * indx_insert_into_root - Attempt to insert an entry into the index root.
1596 * room the root for the new entry.
1673 /* Fill first entry (vcn will be set later). */
1732 /* Check if we can insert new entry new index buffer. */
1737 * new entry classic case when MFT record is 1K and index
1777 * Attempt to insert an entry into an Index Allocation Buffer.
1873 * Insert new entry into left or right buffer
1893 * insert the promoted entry into the parent.
1924 * indx_insert_entry - Insert new entry into index.
1956 * insert the new entry.
1973 * new entry into it.
1979 * Found a leaf buffer, so we'll insert the new entry into it.
2151 * Find a replacement entry for a deleted entry.
2152 * Always returns a node entry:
2170 /* Find first leaf entry down from de_next. */
2183 * This buffer is non-empty, so its first entry
2184 * could be used as the replacement entry.
2201 /* Copy the candidate entry into the replacement entry buffer. */
2213 * The replacement entry we found doesn't have a sub_vcn.
2220 * The replacement entry we found was a node entry, which
2228 * Expunge the replacement entry from its former location,
2248 * indx_delete_entry - Delete an entry from the index.
2286 /* Locate the entry to remove. */
2312 /* The entry to delete is a leaf, so we can just rip it out. */
2326 * Check to see if removing that entry made
2335 * The entry we wish to delete is a node buffer, so we
2360 * There is no replacement for the current entry.
2364 * entry sub_vcn.
2477 * Didn't find the parent entry, although this buffer
2486 * Since we can't remove the end entry, we'll remove
2488 * transfer the predecessor's sub_vcn to the end entry.
2508 * Copy the current entry into a temporary buffer (stripping
2555 * Re-insert the entry into the tree.
2556 * Find the spot the tree where we want to insert the new entry.
2607 /* Fill first entry. */
2633 * Update duplicated information in directory entry
2658 /* Find entry in directory. */
2686 /* Directory entry in index. */
2689 /* Directory entry in directory MFT record. */