find_next_best_node(9) [suse man page]

FIND_NEXT_BEST_NODE(9)					    Memory Management in Linux					    FIND_NEXT_BEST_NODE(9)

NAME

       find_next_best_node - find the next node that should appear in a given node's fallback list

SYNOPSIS

       int find_next_best_node(int node, nodemask_t * used_node_mask);

ARGUMENTS

       node
	   node whose fallback list we're appending

       used_node_mask
	   nodemask_t of already used nodes

DESCRIPTION

       We use a number of factors to determine which is the next node that should appear on a given node's fallback list. The node should not have
       appeared already in node's fallback list, and it should be the next closest node according to the distance array (which contains arbitrary
       distance values from each node to each node in the system), and should also prefer nodes with no CPUs, since presumably they'll have very
       little allocation pressure on them otherwise. It returns -1 if no node is found.

COPYRIGHT

Kernel Hackers Manual 2.6.					     July 2010						    FIND_NEXT_BEST_NODE(9)

Blt_TreeDeleteNode(3)					      BLT Library Procedures					     Blt_TreeDeleteNode(3)

__________________________________________________________________________________________________________________________________________________

NAME

       Blt_TreeDeleteNode - Deletes a node and its descendants.

SYNOPSIS

       #include <bltTree.h>

       Blt_TreeNode
       Blt_TreeDeleteNode(tree, node)

ARGUMENTS

       Blt_Tree       tree   (in)      Tree containing the node.

       Blt_TreeNode   node   (in)      Node to be deleted.
_________________________________________________________________

DESCRIPTION

       This procedure deletes a given node and all it descendants from a tree data object.

       The arguments are as follows:

       tree	 The tree containing the parent node.

       node	 Node  to  be  deleted.  The node and its descendant nodes are deleted.  Each node's data values are deleted also.   The reference
		 count of the Tcl_Obj is decremented.

       Since all tree objects must contain at least a root node, the root node itself can't be deleted unless the tree is released and	destroyed.
       Therefore you can clear a tree by deleting its root, but the root node will remain until the tree is destroyed.

RETURNS

       Always returns TCL_OK.  Errors generated in a notification callbacks are backgrounded (see Tcl_TreeCreateNotifyHandler).

EXAMPLE

       The following example deletes the root node.

	      Blt_TreeNode root;

	      root = Blt_TreeRootNode(token);
	      Blt_TreeDeleteNode(token, root);

NOTIFICATIONS

       Blt_TreeDeleteNode  can	trigger  tree notify events.  You can be notified whenever a node is deleted by using the Blt_TreeCreateNotifyHan-
       dler.  A callback routine is registered that will be automatically invoked whenever a node is deleted via Blt_TreeDeleteNode to the tree.

KEYWORDS

       tree, token

BLT
									2.4						     Blt_TreeDeleteNode(3)