Lines Matching defs:node
51 /* Longest cycles + instruction_latency() of any parent of this node. */
462 list_for_each_entry(struct schedule_node, node, schedule_list, link)
463 calculate_deps(&state, node);
477 list_for_each_entry_rev(struct schedule_node, node, schedule_list,
479 calculate_deps(&state, (struct schedule_node *)node);
1427 /** Recursive computation of the delay member of a node. */
1429 compute_delay(struct dag_node *node, void *state)
1431 struct schedule_node *n = (struct schedule_node *)node;
1464 struct schedule_node *node)
1466 if (!node)
1469 util_dynarray_foreach(&node->dag.edges, struct dag_edge, edge) {
1476 uint32_t latency = instruction_latency(devinfo, node, child);
1481 dag_prune_head(dag, &node->dag);