Lines Matching refs:nodes
506 * only roots and leafs nodes. Leaf nodes are called deltas.
507 * But in general, this can be easily extended for intermediate nodes.
509 * nodes.
705 struct objagg_tmp_node *nodes;
737 struct objagg_tmp_node *node = &graph->nodes[index];
741 /* Node weight is sum of node users and all other nodes users
748 node = &graph->nodes[j];
765 node = &graph->nodes[i];
790 graph->nodes = kcalloc(nodes_count, sizeof(*graph->nodes), GFP_KERNEL);
791 if (!graph->nodes)
801 node = &graph->nodes[i++];
812 pnode = &graph->nodes[i];
813 node = &graph->nodes[j];
825 kfree(graph->nodes);
834 kfree(graph->nodes);
853 /* Find the nodes from the ones that can accommodate most users
857 node = &graph->nodes[index];
871 node = &graph->nodes[j];