The b-tree

The `b-tree`

We discussed the generic b-tree in Chapter 3, "The Kernel: Basic Organization," and now we need to apply the specifics used to map the vfd|dbd data structures. Figure 6-10 shows the overall design of the memory management b-tree and its relationship to a region structure.

Figure 6-10. The `b-tree`

graphics/06fig10.gif

The base of the tree is its broot. It sets the rules for the tree's usage and directs us to the first level bnode in the tree. This first bnode is sometimes called the root bnode try not to confuse the two structure names.

The bnode structures are ranked and ordered according to the tree's depth (defined in the broot) and form the tree's branches. To continue with the tree model, the chunk structures could be thought of as the leaves on the branches. Each chunk contains vfd|dbd structure pairs; these vfd|dbds are the fruit of a successful search of the tree.

Table of content

HP-UX 11i Internals

ISBN: 0130328618
EAN: 2147483647

Year: 2006
Pages: 167

Authors: Chris Cooper, Chris Moore

BUY ON AMAZON

Java I/O

Lotus Notes and Domino 6 Development (2nd Edition)

Mastering Delphi 7

Pocket Guide to the National Electrical Code(R), 2005 Edition (8th Edition)

Junos Cookbook (Cookbooks (OReilly))

Java Concurrency in Practice

The b-tree

Figure 6-10. The b-tree

The `b-tree`

Figure 6-10. The `b-tree`