Searched refs:NCH (Results 1 – 6 of 6) sorted by relevance
179 for (i = 0; i < NCH(n); i++) { in num_stmts()190 return NCH(n) / 2; /* Divide by 2 to remove count of semi-colons */ in num_stmts()192 if (NCH(n) == 1) in num_stmts()196 for (i = 2; i < (NCH(n) - 1); i++) in num_stmts()204 TYPE(n), NCH(n)); in num_stmts()247 for (i = 0; i < NCH(n) - 1; i++) { in PyAST_FromNode()306 for (i = 0; i < NCH(n); i += 2) { in PyAST_FromNode()532 if (NCH(n) == 1) { in ast_for_comp_op()558 else if (NCH(n) == 2) { in ast_for_comp_op()573 NCH(n)); in ast_for_comp_op()[all …]
97 v = mkseq(1 + NCH(n) + (TYPE(n) == encoding_decl)); in node2tuple()106 for (i = 0; i < NCH(n); i++) { in node2tuple()252 if (NCH(left) < NCH(right)) in parser_compare_nodes()255 if (NCH(right) < NCH(left)) in parser_compare_nodes()258 for (j = 0; j < NCH(left); ++j) { in parser_compare_nodes()1004 if (NCH(n) != num) { in validate_numnodes()1033 int nch = NCH(tree); in validate_repeating_list()1061 int nch = NCH(tree); in validate_class()1096 int nch = NCH(tree); in validate_if()1138 int nch = NCH(tree); in validate_parameters()[all …]
130 return s_push(s, d, CHILD(n, NCH(n)-1)); in push()187 if (NCH(n) < 4) in future_hack()193 if (NCH(ch) == 1 && STR(CHILD(ch, 0)) && in future_hack()203 for (i = 0; i < NCH(ch); i += 2) { in future_hack()205 if (NCH(cch) >= 1 && TYPE(CHILD(cch, 0)) == NAME) { in future_hack()343 for (i = 0; i < NCH(n); i++) { in dumptree()361 for (i = 0; i < NCH(n); i++) in showtree()
143 for (i = NCH(n); --i >= 0; ) in freechildren()156 for (i = NCH(n); --i >= 0; ) in sizeofchildren()160 res += XXXROUNDUP(NCH(n)) * sizeof(node); in sizeofchildren()
35 for (i = 0; i < NCH(n); i++) in list1node()
26 #define NCH(n) ((n)->n_nchildren) macro29 #define RCHILD(n, i) (CHILD(n, NCH(n) + i))