Subversion Repositories HelenOS-historic

Compare Revisions

Ignore whitespace Rev 1147 → Rev 1148

/kernel/trunk/generic/src/adt/btree.c
31,7 → 31,7
* - it is a ballanced 2-3-4-5 tree (i.e. BTREE_M = 5)
* - values (i.e. pointers to values) are stored only in leaves
* - leaves are linked in a list
* - technically, it is a B+-tree (because of the previous properties)
* - technically, it is a B+tree (because of the previous properties)
*
* Be carefull when using these trees. They need to allocate
* and deallocate memory for their index nodes and as such
/kernel/trunk/generic/src/mm/as.c
542,7 → 542,7
 
/*
* Second, locate the left sibling and test its last record.
* Because of its position in the B+-tree, it must have base < va.
* Because of its position in the B+tree, it must have base < va.
*/
if ((lnode = btree_node_left_sibling(&as->as_area_btree, leaf))) {
a = (as_area_t *) lnode->value[lnode->keys - 1];