Lines Matching defs:item
69 // to gets item head in le form
175 * Search for an item in the array by the item key *
180 /* For those not familiar with binary search: lbound is the leftmost item that it
181 could be, rbound the rightmost item that it could be. We examine the item
188 const void *base, /* First item in the array. */
195 of item headers in a node, width
196 is actually the item header size not
197 the item size. */
414 /* item number is too big or too small */
429 /* check tables of item heads */
435 "wrong item type for item %h",
442 "item location seems wrong: %h",
449 "item length seems wrong: %h",
455 "item location seems wrong "
564 * look for item in the Disk S+Tree by its key *
579 bin_search will find the position of the item which has key either
748 /* item has been found, so we choose the pointer which is to the right of the found one */
751 /* if item was not found we choose the position which is to
752 the left of the found item. This requires no code,
793 /* Form the path to an item and position in this item which contains
794 file byte defined by key. If there is no such item
795 corresponding to the key, we point the path to the item with
797 past the last entry/byte in the item. If searching for entry in a
798 directory item, and it is not found, *pos_in_item is set to one
827 /* If item is found. */
837 "PAP-5165: item length equals zero");
846 /* Item is not found. Set path to the previous item. */
859 /* Needed byte is contained in the item pointed to by the path. */
869 /* Needed byte is not contained in the item pointed to by the
870 path. Set pos_in_item out of the item. */
880 /* Compare given item and item pointed to by the path. */
894 /* we need only to know, whether it is the same item */
907 // prepare for delete or cut of direct item
916 /* item has to be deleted */
927 return M_DELETE; /* Delete this item. */
929 /* Calculate first position and size for cutting from item. */
933 return M_CUT; /* Cut from this item. */
940 return M_DELETE; /* Delete this item. */
942 /* Calculate first position and size for cutting from item. */
946 return M_CUT; /* Cut from this item. */
958 "PAP-5220: incorrect empty directory item (%h)", le_ih);
960 return M_DELETE; /* Delete the directory item containing "." and ".." entry. */
964 /* Delete the directory item such as there is one record only
965 in this item */
970 /* Cut one record from the directory item. */
979 /* If the path points to a directory or direct item, calculate mode and the size cut, for balance.
980 If the path points to an indirect item, remove some number of its unformatted nodes.
981 In case of file truncate calculate whether this item must be deleted/truncated or last
982 unformatted node of this item will be converted to a direct item.
995 /* Stat_data item. */
1005 /* Directory item. */
1011 /* Direct item. */
1016 /* Case of an indirect item. */
1089 * direct item? */
1135 void padd_item(char *item, int total_length, int length)
1140 item[--i] = 0;
1171 /* Delete object item.
1173 * path - path to the deleted item
1174 * item_key - key to search for the deleted item
1239 // reiserfs_delete_item returns item length when success
1266 ** the only thing we really care about is the direct item's data
1319 /* this deletes item which never gets split */
1345 // No need for a warning, if there is just no free space to insert '..' item into the newly-created subdir
1374 if (inode) { /* Should we count quota for item? (we don't count quotas for save-links) */
1404 /* for directory this deletes item containing "." and ".." */
1493 item successesfully, but there were no disk space to cut unfm
1495 direct item(s) */
1514 "found invalid item");
1525 "vs-5617: there was tail %d bytes, removed item length %d bytes",
1538 /* (Truncate or cut entry) or delete object item. Returns < 0 on failure */
1565 /* Repeat this loop until we either cut the item without needing
1569 be cut, and size to be cut. In case of the indirect item
1578 /* convert last unformatted node to direct item or leave
1599 inserting the new direct item. Now we are removing the
1614 reiserfs_panic(sb, "PAP-5580", "item to "
1638 reiserfs_warning(sb, "PAP-5610", "item %K not found",
1647 // to cut item
1661 /* Calculate number of bytes that need to be cut from the item. */
1672 ** item.
1691 of the item */
1694 "item must be indirect %h", le_ih);
1699 "item %h being deleted must be of "
1710 item is direct item of this file */
1759 INITIALIZE_PATH(s_search_path); /* Path to the current object item. */
1760 struct item_head *p_le_ih; /* Pointer to an item header. */
1761 struct cpu_key s_item_key; /* Key to search for a previous file item. */
1816 /* this may mismatch with real file size: if last direct item
1832 /* Update key to search for the last file item. */
1836 /* Cut or delete file item. */
1851 /* Change key to search the last file item. */
1856 /* While there are bytes to truncate and previous file item is presented in the tree. */
1921 reiserfs_panic(NULL, "PAP-5720", "found direct item "
1934 "item (%h) or position (%d) does not "
1941 /* Paste bytes to the existing item. Returns bytes number pasted into the item. */
1942 int reiserfs_paste_into_item(struct reiserfs_transaction_handle *th, struct treepath *search_path, /* Path to the pasted item. */
1943 const struct cpu_key *key, /* Key to search for the needed item. */
1944 struct inode *inode, /* Inode item belongs to */
2024 /* Insert new item into the buffer at the path.
2026 * path - path to the inserted item
2027 * ih - pointer to the item header to insert
2042 if (inode) { /* Do we count quotas for item? */
2057 * appropriate stat item isn't inserted yet... */