Searched refs:L_SUBTREE (Results 1 – 6 of 6) sorted by relevance
370 case L_SUBTREE: in skel_instance_of()371 return skel->tag == L_SUBTREE; in skel_instance_of()423 assert(lens->tag == L_SUBTREE); in put_subtree()671 case L_SUBTREE: in put_lens()825 case L_SUBTREE: in create_lens()
41 L_SUBTREE, enumerator
338 lens = make_lens_unop(L_SUBTREE, info, l);1020 case L_SUBTREE: in free_lens()1062 if (lens->tag == L_SUBTREE || lens->tag == L_STAR in lens_release()1366 case L_SUBTREE: in format_atype()1703 case L_SUBTREE: in rtn_rules()2065 case L_SUBTREE: in propagate_type()2162 case L_SUBTREE:2277 case L_SUBTREE:2442 case L_SUBTREE:
345 case L_SUBTREE: in print_skel()783 case L_SUBTREE: in try_match()1181 if (lens->tag == L_SUBTREE) { in visit_enter()1316 if (lens->tag == L_SUBTREE) { in visit_exit()1556 case L_SUBTREE: in get_lens()1697 case L_SUBTREE: in parse_lens()
761 case L_SUBTREE: in build_nullable()1223 case L_SUBTREE: in print_grammar()1286 case L_SUBTREE: in index_lenses()1481 case L_SUBTREE: in conv_rhs()
1562 in a frame and in the current state for L_SUBTREE lenses, which meant that7030 When a L_MAYBE lens was the last child of a L_CONCAT inside a L_SUBTREE, then