Lines Matching full:edge

212 			prefix->array[0].edge = add;  in ldns_radix_insert()
268 prefix->array[byte].edge = add; in ldns_radix_insert()
269 } else if (prefix->array[byte-prefix->offset].edge == NULL) { in ldns_radix_insert()
291 prefix->array[byte].edge = add; in ldns_radix_insert()
368 node = node->array[byte].edge; in ldns_radix_search()
417 if (!node->array[byte].edge) { in ldns_radix_find_less_equal()
436 node->array[byte].edge); in ldns_radix_find_less_equal()
439 *result = ldns_radix_last_in_subtree_incl_self(node->array[byte].edge); in ldns_radix_find_less_equal()
441 *result = ldns_radix_prev(node->array[byte].edge); in ldns_radix_find_less_equal()
450 node->array[byte].edge); in ldns_radix_find_less_equal()
453 *result = ldns_radix_last_in_subtree_incl_self(node->array[byte].edge); in ldns_radix_find_less_equal()
455 *result = ldns_radix_prev(node->array[byte].edge); in ldns_radix_find_less_equal()
462 node = node->array[byte].edge; in ldns_radix_find_less_equal()
531 if (node->array[index].edge) { in ldns_radix_next()
534 if (node->array[index].edge->data) { in ldns_radix_next()
535 return node->array[index].edge; in ldns_radix_next()
610 if (node->array[j].edge) { in ldns_radix_node_print()
611 ldns_radix_node_print(fd, node->array[j].edge, j, in ldns_radix_node_print()
748 ldns_radix_traverse_postorder(node->array[i].edge, in ldns_radix_traverse_postorder()
816 n = n->array[byte].edge; in ldns_radix_find_prefix()
878 if (node->array[index+need].edge) { in ldns_radix_array_space()
879 node->array[index+need].edge->parent_index = in ldns_radix_array_space()
1047 add->parent = array->edge->parent; in ldns_radix_array_split()
1048 add->parent_index = array->edge->parent_index; in ldns_radix_array_split()
1049 add->array[0].edge = array->edge; in ldns_radix_array_split()
1052 array->edge->parent = add; in ldns_radix_array_split()
1053 array->edge->parent_index = 0; in ldns_radix_array_split()
1055 array->edge = add; in ldns_radix_array_split()
1081 if (!ldns_radix_array_space(array->edge, in ldns_radix_array_split()
1089 add->parent = array->edge; in ldns_radix_array_split()
1091 array->edge->offset; in ldns_radix_array_split()
1092 array->edge->array[add->parent_index].edge = add; in ldns_radix_array_split()
1093 array->edge->array[add->parent_index].str = split_str; in ldns_radix_array_split()
1094 array->edge->array[add->parent_index].len = split_len; in ldns_radix_array_split()
1160 common->parent = array->edge->parent; in ldns_radix_array_split()
1161 common->parent_index = array->edge->parent_index; in ldns_radix_array_split()
1162 array->edge->parent = common; in ldns_radix_array_split()
1163 array->edge->parent_index = array->str[common_len] - in ldns_radix_array_split()
1167 common->array[array->edge->parent_index].edge = array->edge; in ldns_radix_array_split()
1168 common->array[array->edge->parent_index].str = s1; in ldns_radix_array_split()
1169 common->array[array->edge->parent_index].len = l1; in ldns_radix_array_split()
1170 common->array[add->parent_index].edge = add; in ldns_radix_array_split()
1174 array->edge = common; in ldns_radix_array_split()
1241 if (node->array[i].edge) { in ldns_radix_next_in_subtree()
1243 if (node->array[i].edge->data) { in ldns_radix_next_in_subtree()
1244 return node->array[i].edge; in ldns_radix_next_in_subtree()
1247 next = ldns_radix_next_in_subtree(node->array[i].edge); in ldns_radix_next_in_subtree()
1270 if (node->array[i].edge) { in ldns_radix_prev_from_index()
1313 if (node->array[i].edge) { in ldns_radix_last_in_subtree()
1315 if (node->array[i].edge->len > 0) { in ldns_radix_last_in_subtree()
1318 node->array[i].edge); in ldns_radix_last_in_subtree()
1324 if (node->array[i].edge->data) { in ldns_radix_last_in_subtree()
1325 return node->array[i].edge; in ldns_radix_last_in_subtree()
1364 * Node cannot be deleted, because it has edge nodes in ldns_radix_del_fix()
1386 ldns_radix_node_t* child = node->array[0].edge; in ldns_radix_cleanup_onechild()
1413 parent->array[parent_index].edge = child; in ldns_radix_cleanup_onechild()
1437 parent->array[parent_index].edge = NULL; in ldns_radix_cleanup_leaf()
1476 * Free select edge array.
1493 * Free front of select edge array.
1502 while (n < node->len && node->array[n].edge == NULL) { in ldns_radix_node_array_free_front()
1519 if (node->array[i].edge) { in ldns_radix_node_array_free_front()
1520 node->array[i].edge->parent_index = i; in ldns_radix_node_array_free_front()
1529 * Free front of select edge array.
1538 while (n < node->len && node->array[node->len-1-n].edge == NULL) { in ldns_radix_node_array_free_end()