Lines Matching defs:from
31 const struct item_head *from)
33 memcpy(to, from, IH_SIZE);
115 inline void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from)
118 to->on_disk_key.k_dir_id = le32_to_cpu(from->k_dir_id);
119 to->on_disk_key.k_objectid = le32_to_cpu(from->k_objectid);
122 version = le_key_version(from);
124 to->on_disk_key.k_offset = le_key_k_offset(version, from);
125 to->on_disk_key.k_type = le_key_k_type(version, from);
209 * path, starting from the bottom of the path, and going upwards. We must
313 * Check whether a key is contained in the tree rooted from a buffer at a path.
357 * This version should only be called from fix_nodes()
550 * high contention resulting from too much lock requests, especially
590 * This function fills up the path from the root to the leaf as it
593 * does not find them in the cache it reads them from disk. For each
709 * from the current buffer. If not then repeat search
710 * from the root.
724 * repeat the search starting from the root.
729 /* repeat search from the root */
969 /* Calculate first position and size for cutting from item. */
973 return M_CUT; /* Cut from this item. */
983 /* Calculate first position and size for cutting from item. */
987 return M_CUT; /* Cut from this item. */
1014 /* Cut one record from the directory item. */
1040 * which were removed from end
1356 * un_bh is from the page cache (all unformatted nodes are
1357 * from the page cache) and might be a highmem page. So, we
1394 * writes and truncates are protected from collisions by use of
1397 * creates, linking, and mknod are protected from collisions with other
1779 /* Calculate number of bytes that need to be cut from the item. */
1842 * data block was freed, it was removed from the list of