infant 80 source3/lib/adt_tree.c TREE_NODE *infant = NULL;
infant 84 source3/lib/adt_tree.c if ( !(infant = TALLOC_ZERO_P( node, TREE_NODE)) )
infant 87 source3/lib/adt_tree.c infant->key = talloc_strdup( infant, key );
infant 88 source3/lib/adt_tree.c infant->parent = node;
infant 101 source3/lib/adt_tree.c node->key ? node->key : "NULL", infant->key ));
infant 102 source3/lib/adt_tree.c node->children[0] = infant;
infant 118 source3/lib/adt_tree.c infant->key, node->children[i-1]->key));
infant 123 source3/lib/adt_tree.c if ( StrCaseCmp( infant->key, node->children[i-1]->key ) > 0 ) {
infant 126 source3/lib/adt_tree.c node->children[i] = infant;
infant 141 source3/lib/adt_tree.c node->children[0] = infant;
infant 144 source3/lib/adt_tree.c return infant;