Home
last modified time | relevance | path

Searched refs:iter_node (Results 1 – 3 of 3) sorted by relevance

/freebsd-12-stable/contrib/gcc/
Dtree-flow-inline.h416 imm->iter_node.next = imm->imm_use->next; in first_readonly_imm_use()
434 gcc_assert (imm->iter_node.next == old->next); in next_readonly_imm_use()
435 imm->iter_node.next = old->next->next; in next_readonly_imm_use()
1318 delink_imm_use (&(imm->iter_node)); in end_imm_use_stmt_traverse()
1379 if (imm->iter_node.prev != NULL) in link_use_stmts_after()
1380 delink_imm_use (&imm->iter_node); in link_use_stmts_after()
1381 link_imm_use_to_list (&(imm->iter_node), last_p); in link_use_stmts_after()
1397 imm->iter_node.prev = NULL_USE_OPERAND_P; in first_imm_use_stmt()
1398 imm->iter_node.next = NULL_USE_OPERAND_P; in first_imm_use_stmt()
1399 imm->iter_node.stmt = NULL_TREE; in first_imm_use_stmt()
[all …]
Dtree-flow.h233 ssa_use_operand_t iter_node; member
/freebsd-12-stable/sys/dev/mlx5/mlx5_core/
Dmlx5_fs_tree.c2612 struct mlx5_flow_rule_node *iter_node; in mlx5_del_flow_rules_list() local
2615 list_for_each_entry_safe(iter_node, temp_node, &rules_list->head, list) { in mlx5_del_flow_rules_list()
2616 list_del(&iter_node->list); in mlx5_del_flow_rules_list()
2617 kfree(iter_node); in mlx5_del_flow_rules_list()