Searched refs:next_sibling (Results 1 – 2 of 2) sorted by relevance
156 struct access *next_sibling; member420 access = access->next_sibling; in dump_access_tree_1()451 for (child = acc->first_child; child; child = child->next_sibling) in access_has_replacements_p()484 child = child->next_sibling; in find_access_in_subtree()2048 last_child->next_sibling = *access; in build_access_subtree()2163 for (child = root->first_child; child; child = child->next_sibling) in analyze_access_subtree()2268 for (child = lacc->first_child; child; child = child->next_sibling) in child_would_conflict_in_lacc()2320 child = &(*child)->next_sibling; in create_artificial_child_access()2322 access->next_sibling = *child; in create_artificial_child_access()2366 for (rchild = racc->first_child; rchild; rchild = rchild->next_sibling) in propagate_subaccesses_across_link()[all …]
173 struct access *next_sibling; member481 access = access->next_sibling; in dump_access_tree_1()512 for (child = acc->first_child; child; child = child->next_sibling) in access_has_replacements_p()539 child = child->next_sibling; in find_access_in_subtree()2342 last_child->next_sibling = *access; in build_access_subtree()2459 for (child = root->first_child; child; child = child->next_sibling) in analyze_access_subtree()2570 for (child = lacc->first_child; child; child = child->next_sibling) in child_would_conflict_in_lacc()2624 child = &(*child)->next_sibling; in create_artificial_child_access()2626 access->next_sibling = *child; in create_artificial_child_access()2646 for (child = access->first_child; child; child = child->next_sibling) in subtree_mark_written_and_enqueue()[all …]