patch-2.4.3 linux/fs/reiserfs/fix_node.c

• Lines: 81
• Date: Fri Mar 2 18:38:39 2001
• Orig file: v2.4.2/linux/fs/reiserfs/fix_node.c
• Orig date: Sat Feb 3 19:51:31 2001

diff -u --recursive --new-file v2.4.2/linux/fs/reiserfs/fix_node.c linux/fs/reiserfs/fix_node.c
@@ -840,7 +840,7 @@
 
 
 /* Get new buffers for storing new nodes that are created while balancing.
- * Returns:	SCHEDULE_OCCURED - schedule occured while the function worked;
+ * Returns:	SCHEDULE_OCCURRED - schedule occurred while the function worked;
  *	        CARRY_ON - schedule didn't occur while the function worked;
  *	        NO_DISK_SPACE - no disk space.
  */
@@ -1077,7 +1077,7 @@
  * Calculate left/right common parent of the current node and L[h]/R[h].
  * Calculate left/right delimiting key position.
  * Returns:	PATH_INCORRECT   - path in the tree is not correct;
- 		SCHEDULE_OCCURRED - schedule occured while the function worked;
+ 		SCHEDULE_OCCURRED - schedule occurred while the function worked;
  *	        CARRY_ON         - schedule didn't occur while the function worked;
  */
 static int  get_far_parent (struct tree_balance *   p_s_tb,
@@ -1198,7 +1198,7 @@
  * S[n_path_offset] and L[n_path_offset]/R[n_path_offset]: F[n_path_offset], FL[n_path_offset],
  * FR[n_path_offset], CFL[n_path_offset], CFR[n_path_offset].
  * Calculate numbers of left and right delimiting keys position: lkey[n_path_offset], rkey[n_path_offset].
- * Returns:	SCHEDULE_OCCURRED - schedule occured while the function worked;
+ * Returns:	SCHEDULE_OCCURRED - schedule occurred while the function worked;
  *	        CARRY_ON - schedule didn't occur while the function worked;
  */
 static int  get_parents (struct tree_balance * p_s_tb, int n_h)
@@ -1340,7 +1340,7 @@
  *	h	current level of the node;
  *	inum	item number in S[h];
  *	mode	i - insert, p - paste;
- * Returns:	1 - schedule occured; 
+ * Returns:	1 - schedule occurred; 
  *	        0 - balancing for higher levels needed;
  *	       -1 - no balancing for higher levels needed;
  *	       -2 - no disk space.
@@ -1678,7 +1678,7 @@
  *	h	current level of the node;
  *	inum	item number in S[h];
  *	mode	i - insert, p - paste;
- * Returns:	1 - schedule occured; 
+ * Returns:	1 - schedule occurred; 
  *	        0 - balancing for higher levels needed;
  *	       -1 - no balancing for higher levels needed;
  *	       -2 - no disk space.
@@ -1848,7 +1848,7 @@
  *	h	current level of the node;
  *	inum	item number in S[h];
  *	mode	i - insert, p - paste;
- * Returns:	1 - schedule occured; 
+ * Returns:	1 - schedule occurred; 
  *	        0 - balancing for higher levels needed;
  *	       -1 - no balancing for higher levels needed;
  *	       -2 - no disk space.
@@ -1951,7 +1951,7 @@
  *	h	current level of the node;
  *	inum	item number in S[h];
  *	mode	d - delete, c - cut.
- * Returns:	1 - schedule occured; 
+ * Returns:	1 - schedule occurred; 
  *	        0 - balancing for higher levels needed;
  *	       -1 - no balancing for higher levels needed;
  *	       -2 - no disk space.
@@ -1985,7 +1985,7 @@
  *	h	current level of the node;
  *	inum	item number in S[h];
  *	mode	i - insert, p - paste, d - delete, c - cut.
- * Returns:	1 - schedule occured; 
+ * Returns:	1 - schedule occurred; 
  *	        0 - balancing for higher levels needed;
  *	       -1 - no balancing for higher levels needed;
  *	       -2 - no disk space.
@@ -2075,7 +2075,7 @@
 /* Using lnum[n_h] and rnum[n_h] we should determine what neighbors
  * of S[n_h] we
  * need in order to balance S[n_h], and get them if necessary.
- * Returns:	SCHEDULE_OCCURRED - schedule occured while the function worked;
+ * Returns:	SCHEDULE_OCCURRED - schedule occurred while the function worked;
  *	        CARRY_ON - schedule didn't occur while the function worked;
  */
 static int  get_neighbors(