Searched refs:adjacency_list (Results 1 - 3 of 3) sorted by relevance

/xsrc/external/mit/MesaLib/dist/src/util/
H A Dregister_allocate_internal.h97 struct util_dynarray adjacency_list; member in struct:ra_node
H A Dregister_allocate.c487 util_dynarray_append(&g->nodes[n1].adjacency_list, unsigned int, n2);
501 util_dynarray_delete_unordered(&g->nodes[n1].adjacency_list, unsigned int,
532 util_dynarray_init(&g->nodes[i].adjacency_list, g);
624 util_dynarray_foreach(&g->nodes[n].adjacency_list, unsigned int, n2p) {
630 util_dynarray_clear(&g->nodes[n].adjacency_list);
663 util_dynarray_foreach(&g->nodes[n].adjacency_list, unsigned int, n2p) {
812 util_dynarray_foreach(&g->nodes[n].adjacency_list, unsigned int, n2p) {
843 util_dynarray_foreach(&g->nodes[n].adjacency_list, unsigned int, n2p) {
1001 util_dynarray_foreach(&g->nodes[n].adjacency_list, unsigned int, n2p) {
/xsrc/external/mit/MesaLib.old/dist/src/util/
H A Dregister_allocate.c130 unsigned int *adjacency_list; member in struct:ra_node
144 * having to actually modify the adjacency_list.
407 g->nodes[n1].adjacency_list = reralloc(g, g->nodes[n1].adjacency_list,
412 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
434 g->nodes[i].adjacency_list =
487 unsigned int n2 = g->nodes[n].adjacency_list[i];
560 unsigned int n2 = g->nodes[n].adjacency_list[i];
589 unsigned int n2 = g->nodes[n].adjacency_list[i];
725 unsigned int n2 = g->nodes[n].adjacency_list[
[all...]

Completed in 86 milliseconds