Searched refs:OVL_CHAIN (Results 1 – 8 of 8) sorted by relevance
2361 OVL_CHAIN (result) = next; in ovl_make()2380 maybe_ovl = OVL_CHAIN (maybe_ovl)) in ovl_insert()2404 OVL_CHAIN (insert_after) = maybe_ovl; in ovl_insert()2419 ovl = OVL_CHAIN (ovl); in ovl_skip_hidden()2433 if (tree chain = OVL_CHAIN (node)) in reveal_node()2463 slot = &OVL_CHAIN (probe); in remove_node()2474 *slot = OVL_CHAIN (node); in remove_node()2525 next = OVL_CHAIN (probe); in lookup_maybe_add()2534 for (; fns != probe; fns = OVL_CHAIN (fns)) in lookup_maybe_add()5432 WALK_SUBTREE (OVL_CHAIN (*tp)); in cp_walk_subtrees()
69 #define STAT_VISIBLE(N) OVL_CHAIN (N)1873 val = OVL_CHAIN (val); in get_class_binding_direct()1975 slot = &OVL_CHAIN (*slot); in find_member_slot()2015 slot = &OVL_CHAIN (*slot); in add_member_slot()2043 a = OVL_CHAIN (a); in member_name_cmp()2044 b = OVL_CHAIN (b); in member_name_cmp()2228 next = OVL_CHAIN (next); in member_vec_dedup()2278 OVL_CHAIN (marker) = current; in member_vec_dedup()3050 slot = &OVL_CHAIN (*slot); in check_extern_c_conflict()3072 result = OVL_CHAIN (result); in c_linkage_bindings()[all …]
290 print_node (file, "next", OVL_CHAIN (node), indent + 4); in cxx_print_xnode()
780 #define OVL_CHAIN(NODE) \ macro808 (TREE_CODE (NODE) != OVERLOAD || !OVL_CHAIN (NODE))837 ovl = TREE_CODE (ovl) != OVERLOAD ? NULL_TREE : OVL_CHAIN (ovl);896 r = OVL_CHAIN (ovl); in maybe_push()
399 if (OVL_CHAIN (tmpl)) in resolve_concept_check()
295 (pop_nested_class): Use OVL_NEXT, not OVL_CHAIN.1928 * tree.c (really_overloaded_fn): Use OVL_CHAIN for OVERLOADs, not4296 (OVL_CHAIN): Whitespace.
4631 (OVL_FUNCTION, OVL_CHAIN, OVL_CURRENT, OVL_NEXT, OVL_USED):4654 (build_new_function_call): Iterate using OVL_CHAIN.4770 * lex.c (identifier_type): Loop using OVL_CHAIN.
3406 * cp-tree.h (OVL_CHAIN): Check looking at OVERLOAD.