fix_node.c (2d8ad8719591fa803b0d589ed057fa46f49b7155) fix_node.c (f466c6fdb3b1f043ff1977a8d2a1d0cd4dc164fa)
1/*
2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
3 */
4
5/**
6 ** old_item_num
7 ** old_entry_num
8 ** set_entry_sizes

--- 23 unchanged lines hidden (view full) ---

32 ** fix_nodes
33 **
34 **
35 **/
36
37#include <linux/time.h>
38#include <linux/slab.h>
39#include <linux/string.h>
1/*
2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
3 */
4
5/**
6 ** old_item_num
7 ** old_entry_num
8 ** set_entry_sizes

--- 23 unchanged lines hidden (view full) ---

32 ** fix_nodes
33 **
34 **
35 **/
36
37#include <linux/time.h>
38#include <linux/slab.h>
39#include <linux/string.h>
40#include <linux/reiserfs_fs.h>
40#include "reiserfs.h"
41#include <linux/buffer_head.h>
42
43/* To make any changes in the tree we find a node, that contains item
44 to be changed/deleted or position in the node we insert a new item
45 to. We call this node S. To do balancing we need to decide what we
46 will shift to left/right neighbor, or to a new node, where new item
47 will be etc. To make this analysis simpler we build virtual
48 node. Virtual node is an array of items, that will replace items of

--- 2545 unchanged lines hidden --- 		41#include <linux/buffer_head.h>
42
43/* To make any changes in the tree we find a node, that contains item
44 to be changed/deleted or position in the node we insert a new item
45 to. We call this node S. To do balancing we need to decide what we
46 will shift to left/right neighbor, or to a new node, where new item
47 will be etc. To make this analysis simpler we build virtual
48 node. Virtual node is an array of items, that will replace items of

--- 2545 unchanged lines hidden ---