Searched refs:ts_subtree_dynamic_precedence (Results 1 – 12 of 12) sorted by relevance
/dports/editors/helix/helix-0.5.0/cargo-crates/tree-sitter-0.20.0/src/ |
H A D | stack.c | 148 node->dynamic_precedence += ts_subtree_dynamic_precedence(subtree); in stack_node_new() 183 ts_subtree_dynamic_precedence(link.subtree) > in stack_node_add_link() 184 ts_subtree_dynamic_precedence(existing_link->subtree) in stack_node_add_link() 190 link.node->dynamic_precedence + ts_subtree_dynamic_precedence(link.subtree); in stack_node_add_link() 203 dynamic_precedence += ts_subtree_dynamic_precedence(link.subtree); in stack_node_add_link() 223 dynamic_precedence += ts_subtree_dynamic_precedence(link.subtree); in stack_node_add_link() 831 ts_subtree_dynamic_precedence(link.subtree) in ts_stack_print_dot_graph()
|
H A D | parser.c | 724 if (ts_subtree_dynamic_precedence(right) > ts_subtree_dynamic_precedence(left)) { in ts_parser__select_tree() 726 TREE_NAME(right), ts_subtree_dynamic_precedence(right), TREE_NAME(left), in ts_parser__select_tree() 727 ts_subtree_dynamic_precedence(left)); in ts_parser__select_tree() 731 if (ts_subtree_dynamic_precedence(left) > ts_subtree_dynamic_precedence(right)) { in ts_parser__select_tree() 733 TREE_NAME(left), ts_subtree_dynamic_precedence(left), TREE_NAME(right), in ts_parser__select_tree() 734 ts_subtree_dynamic_precedence(right)); in ts_parser__select_tree()
|
H A D | subtree.h | 264 static inline int32_t ts_subtree_dynamic_precedence(Subtree self) { in ts_subtree_dynamic_precedence() function
|
H A D | subtree.c | 429 self.ptr->dynamic_precedence += ts_subtree_dynamic_precedence(child); in ts_subtree_summarize_children()
|
/dports/devel/tree-sitter/tree-sitter-0.20.1/lib/src/ |
H A D | stack.c | 148 node->dynamic_precedence += ts_subtree_dynamic_precedence(subtree); in stack_node_new() 183 ts_subtree_dynamic_precedence(link.subtree) > in stack_node_add_link() 184 ts_subtree_dynamic_precedence(existing_link->subtree) in stack_node_add_link() 190 link.node->dynamic_precedence + ts_subtree_dynamic_precedence(link.subtree); in stack_node_add_link() 203 dynamic_precedence += ts_subtree_dynamic_precedence(link.subtree); in stack_node_add_link() 223 dynamic_precedence += ts_subtree_dynamic_precedence(link.subtree); in stack_node_add_link() 831 ts_subtree_dynamic_precedence(link.subtree) in ts_stack_print_dot_graph()
|
H A D | parser.c | 724 if (ts_subtree_dynamic_precedence(right) > ts_subtree_dynamic_precedence(left)) { in ts_parser__select_tree() 726 TREE_NAME(right), ts_subtree_dynamic_precedence(right), TREE_NAME(left), in ts_parser__select_tree() 727 ts_subtree_dynamic_precedence(left)); in ts_parser__select_tree() 731 if (ts_subtree_dynamic_precedence(left) > ts_subtree_dynamic_precedence(right)) { in ts_parser__select_tree() 733 TREE_NAME(left), ts_subtree_dynamic_precedence(left), TREE_NAME(right), in ts_parser__select_tree() 734 ts_subtree_dynamic_precedence(right)); in ts_parser__select_tree()
|
H A D | subtree.h | 264 static inline int32_t ts_subtree_dynamic_precedence(Subtree self) { in ts_subtree_dynamic_precedence() function
|
H A D | subtree.c | 429 self.ptr->dynamic_precedence += ts_subtree_dynamic_precedence(child); in ts_subtree_summarize_children()
|
/dports/devel/radare2/radare2-5.1.1/shlr/tree-sitter/lib/src/ |
H A D | stack.c | 148 node->dynamic_precedence += ts_subtree_dynamic_precedence(subtree); in stack_node_new() 183 ts_subtree_dynamic_precedence(link.subtree) > in stack_node_add_link() 184 ts_subtree_dynamic_precedence(existing_link->subtree) in stack_node_add_link() 190 link.node->dynamic_precedence + ts_subtree_dynamic_precedence(link.subtree); in stack_node_add_link() 203 dynamic_precedence += ts_subtree_dynamic_precedence(link.subtree); in stack_node_add_link() 223 dynamic_precedence += ts_subtree_dynamic_precedence(link.subtree); in stack_node_add_link() 831 ts_subtree_dynamic_precedence(link.subtree) in ts_stack_print_dot_graph()
|
H A D | parser.c | 694 if (ts_subtree_dynamic_precedence(right) > ts_subtree_dynamic_precedence(left)) { in ts_parser__select_tree() 696 TREE_NAME(right), ts_subtree_dynamic_precedence(right), TREE_NAME(left), in ts_parser__select_tree() 697 ts_subtree_dynamic_precedence(left)); in ts_parser__select_tree() 701 if (ts_subtree_dynamic_precedence(left) > ts_subtree_dynamic_precedence(right)) { in ts_parser__select_tree() 703 TREE_NAME(left), ts_subtree_dynamic_precedence(left), TREE_NAME(right), in ts_parser__select_tree() 704 ts_subtree_dynamic_precedence(right)); in ts_parser__select_tree()
|
H A D | subtree.h | 263 static inline int32_t ts_subtree_dynamic_precedence(Subtree self) { in ts_subtree_dynamic_precedence() function
|
H A D | subtree.c | 419 self.ptr->dynamic_precedence += ts_subtree_dynamic_precedence(child); in ts_subtree_summarize_children()
|