Searched refs:edge_index (Results 1 – 5 of 5) sorted by relevance
171 int edge_index = -1; in RemoveEdge() local172 for (edge_index = 0; edge_index < inputs->size(); ++edge_index) { in RemoveEdge()173 VLOG(2) << " consider edge " << (*inputs)[edge_index]; in RemoveEdge()174 if ((*inputs)[edge_index] == input_edge_name) { in RemoveEdge()178 if (edge_index >= inputs->size()) { in RemoveEdge()185 inputs->DeleteSubrange(edge_index, 1); in RemoveEdge()
1748 for (uint32_t edge_index = 0; edge_index < snapshot_edges.row_count(); in ExportMemorySnapshots() local1749 ++edge_index) { in ExportMemorySnapshots()1751 snapshot_edges.source_node_id()[edge_index]; in ExportMemorySnapshots()1761 snapshot_edges.source_node_id()[edge_index].value); in ExportMemorySnapshots()1763 snapshot_edges.target_node_id()[edge_index].value); in ExportMemorySnapshots()1765 Json::Int(snapshot_edges.importance()[edge_index]); in ExportMemorySnapshots()
632 def move_at_edge_if_selection(self, edge_index): argument647 self_text_mark_set("insert", edges_table[edge_index])
591 def move_at_edge_if_selection(self, edge_index): argument606 self_text_mark_set("insert", edges_table[edge_index])
5627 static int is_violated(struct isl_sched_graph *graph, int edge_index) in is_violated() argument5630 struct isl_sched_edge *edge = &graph->edge[edge_index]; in is_violated()