c/mirror_zfs
1
0
Fork 0
mirror of https://git.proxmox.com/git/mirror_zfs.git synced 2025-10-26 18:05:04 +03:00
Code Issues Packages Projects Releases Wiki Activity

Illumos 4745 - fix AVL code misspellings

Browse Source 
4745 fix AVL code misspellings
Reviewed by: Matthew Ahrens <mahrens@delphix.com>
Reviewed by: Richard Lowe <richlowe@richlowe.net>
Approved by: Robert Mustacchi <rm@joyent.com>

References:
  https://github.com/illumos/illumos-gate/commit/6907ca4
  https://www.illumos.org/issues/4745

Ported-by: kernelOfTruth kerneloftruth@gmail.com
Signed-off-by: Brian Behlendorf <behlendorf1@llnl.gov>
Closes #3565
This commit is contained in:
Josef 'Jeff' Sipek 2015-07-05 20:54:17 +02:00 committed by Brian Behlendorf
parent 02f8fe4260
commit 411bf201f5
2 changed files with 8 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
include/sys/avl.h
View File

@ -43,7 +43,7 @@ extern "C" {
#include <sys/avl_impl.h> #include <sys/avl_impl.h>
/* /*
* This is a generic implemenatation of AVL trees for use in the Solaris kernel. * This is a generic implementation of AVL trees for use in the Solaris kernel.
* The interfaces provide an efficient way of implementing an ordered set of * The interfaces provide an efficient way of implementing an ordered set of
* data structures. * data structures.
* *
@ -179,7 +179,7 @@ extern void avl_insert(avl_tree_t *tree, void *node, avl_index_t where);
* Insert "new_data" in "tree" in the given "direction" either after * Insert "new_data" in "tree" in the given "direction" either after
* or before the data "here". * or before the data "here".
* *
* This might be usefull for avl clients caching recently accessed * This might be useful for avl clients caching recently accessed
* data to avoid doing avl_find() again for insertion. * data to avoid doing avl_find() again for insertion.
* *
* new_data - new data to insert * new_data - new data to insert

11
module/avl/avl.c
View File

@ -41,7 +41,7 @@
* insertion and deletion relatively efficiently. Searching the tree is * insertion and deletion relatively efficiently. Searching the tree is
* still a fast operation, roughly O(log(N)). * still a fast operation, roughly O(log(N)).
* *
* The key to insertion and deletion is a set of tree maniuplations called * The key to insertion and deletion is a set of tree manipulations called
* rotations, which bring unbalanced subtrees back into the semi-balanced state. * rotations, which bring unbalanced subtrees back into the semi-balanced state.
* *
* This implementation of AVL trees has the following peculiarities: * This implementation of AVL trees has the following peculiarities:
@ -49,7 +49,7 @@
* - The AVL specific data structures are physically embedded as fields * - The AVL specific data structures are physically embedded as fields
* in the "using" data structures. To maintain generality the code * in the "using" data structures. To maintain generality the code
* must constantly translate between "avl_node_t *" and containing * must constantly translate between "avl_node_t *" and containing
* data structure "void *"s by adding/subracting the avl_offset. * data structure "void *"s by adding/subtracting the avl_offset.
* *
* - Since the AVL data is always embedded in other structures, there is * - Since the AVL data is always embedded in other structures, there is
* no locking or memory allocation in the AVL routines. This must be * no locking or memory allocation in the AVL routines. This must be
@ -104,7 +104,7 @@
#include <sys/cmn_err.h> #include <sys/cmn_err.h>
/* /*
* Small arrays to translate between balance (or diff) values and child indeces. * Small arrays to translate between balance (or diff) values and child indices.
* *
* Code that deals with binary tree data structures will randomly use * Code that deals with binary tree data structures will randomly use
* left and right children when examining a tree. C "if()" statements * left and right children when examining a tree. C "if()" statements
@ -124,7 +124,8 @@ static const int avl_balance2child[] = {0, 0, 1};
* *
* - If there is a left child, go to it, then to it's rightmost descendant. * - If there is a left child, go to it, then to it's rightmost descendant.
* *
* - otherwise we return thru parent nodes until we've come from a right child. * - otherwise we return through parent nodes until we've come from a right
* child.
* *
* Return Value: * Return Value:
* NULL - if at the end of the nodes * NULL - if at the end of the nodes
@ -947,7 +948,7 @@ avl_is_empty(avl_tree_t *tree)
/* /*
* Post-order tree walk used to visit all tree nodes and destroy the tree * Post-order tree walk used to visit all tree nodes and destroy the tree
* in post order. This is used for destroying a tree w/o paying any cost * in post order. This is used for destroying a tree without paying any cost
* for rebalancing it. * for rebalancing it.
* *
* example: * example: