Lines Matching defs:item
29 /* to get item head in le form */
140 * Search for an item in the array by the item key *
146 * For those not familiar with binary search: lbound is the leftmost item
147 * that it could be, rbound the rightmost item that it could be. We examine
148 * the item halfway between lbound and rbound, and that tells us either
155 const void *base, /* First item in the array. */
161 * specifically to the array of item headers in a
162 * node, width is actually the item header size
163 * not the item size.
426 /* item number is too big or too small */
445 /* check tables of item heads */
451 "wrong item type for item %h",
458 "item location seems wrong: %h",
465 "item length seems wrong: %h",
471 "item location seems wrong "
478 "item entry count seems wrong %h",
598 * bin_search will find the position of the item which has key either
605 * search_by_key - search for key (and item) in stree
782 * item has been found, so we choose the pointer which
789 * if item was not found we choose the position which is to
790 * the left of the found item. This requires no code,
838 * Form the path to an item and position in this item which contains
839 * file byte defined by key. If there is no such item
840 * corresponding to the key, we point the path to the item with
842 * past the last entry/byte in the item. If searching for entry in a
843 * directory item, and it is not found, *pos_in_item is set to one
873 /* If item is found. */
883 "PAP-5165: item length equals zero");
892 /* Item is not found. Set path to the previous item. */
906 /* Needed byte is contained in the item pointed to by the path. */
917 * Needed byte is not contained in the item pointed to by the
918 * path. Set pos_in_item out of the item.
929 /* Compare given item and item pointed to by the path. */
943 /* we need only to know, whether it is the same item */
948 /* prepare for delete or cut of direct item */
957 /* item has to be deleted */
967 return M_DELETE; /* Delete this item. */
969 /* Calculate first position and size for cutting from item. */
973 return M_CUT; /* Cut from this item. */
980 return M_DELETE; /* Delete this item. */
983 /* Calculate first position and size for cutting from item. */
987 return M_CUT; /* Cut from this item. */
999 "PAP-5220: incorrect empty directory item (%h)", le_ih);
1001 /* Delete the directory item containing "." and ".." entry. */
1007 * Delete the directory item such as there is one record only
1008 * in this item
1014 /* Cut one record from the directory item. */
1024 * If the path points to a directory or direct item, calculate mode
1026 * If the path points to an indirect item, remove some number of its
1028 * In case of file truncate calculate whether this item must be
1029 * deleted/truncated or last unformatted node of this item will be
1030 * converted to a direct item.
1055 /* Stat_data item. */
1065 /* Directory item. */
1071 /* Direct item. */
1076 /* Case of an indirect item. */
1155 * direct item?
1207 void padd_item(char *item, int total_length, int length)
1212 item[--i] = 0;
1244 * Delete object item.
1246 * path - path to the deleted item
1247 * item_key - key to search for the deleted item
1312 /* reiserfs_delete_item returns item length when success */
1343 * the only thing we really care about is the direct item's
1401 /* this deletes item which never gets split */
1430 * space to insert '..' item into the
1462 * Should we count quota for item? (we don't
1499 /* for directory this deletes item containing "." and ".." */
1591 * item successesfully, but there were no disk space to cut unfm
1593 * direct item(s)
1613 "found invalid item");
1624 "vs-5617: there was tail %d bytes, removed item length %d bytes",
1636 /* (Truncate or cut entry) or delete object item. Returns < 0 on failure */
1668 * Repeat this loop until we either cut the item without needing
1674 * be cut, and size to be cut. In case of the indirect item
1685 * convert last unformatted node to direct item or
1711 * inserting the new direct item. Now we are
1727 reiserfs_panic(sb, "PAP-5580", "item to "
1751 reiserfs_warning(sb, "PAP-5610", "item %K not found",
1762 * able to cut item
1777 /* Calculate number of bytes that need to be cut from the item. */
1789 * item.
1810 * of the item
1814 "item must be indirect %h", le_ih);
1819 "item %h being deleted must be of "
1831 * item is direct item of this file
1887 INITIALIZE_PATH(s_search_path); /* Path to the current object item. */
1888 struct item_head *p_le_ih; /* Pointer to an item header. */
1890 /* Key to search for a previous file item. */
1948 * this may mismatch with real file size: if last direct item
1965 /* Update key to search for the last file item. */
1969 /* Cut or delete file item. */
1984 /* Change key to search the last file item. */
1991 * file item is presented in the tree.
2056 reiserfs_panic(NULL, "PAP-5720", "found direct item "
2069 "item (%h) or position (%d) does not "
2077 * Paste bytes to the existing item.
2078 * Returns bytes number pasted into the item.
2081 /* Path to the pasted item. */
2083 /* Key to search for the needed item. */
2085 /* Inode item belongs to */
2177 * Insert new item into the buffer at the path.
2179 * path - path to the inserted item
2180 * ih - pointer to the item header to insert
2195 if (inode) { /* Do we count quotas for item? */
2214 * written but appropriate stat item isn't inserted yet...