Lines Matching refs:res
336 PyObject *res = 0; in parser_st2tuple() local
366 res = node2tuple(((PyST_Object*)self)->st_node, in parser_st2tuple()
369 return (res); in parser_st2tuple()
392 PyObject *res = 0; in parser_st2list() local
421 res = node2tuple(self->st_node, in parser_st2list()
424 return (res); in parser_st2list()
445 PyObject* res = 0; in parser_compilest() local
465 res = (PyObject *)PyAST_Compile(mod, str, &(self->st_flags), arena); in parser_compilest()
471 return (res); in parser_compilest()
493 PyObject* res = 0; in parser_isexpr() local
506 res = (self->st_type == PyST_EXPR) ? Py_True : Py_False; in parser_isexpr()
507 Py_INCREF(res); in parser_isexpr()
509 return (res); in parser_isexpr()
516 PyObject* res = 0; in parser_issuite() local
529 res = (self->st_type == PyST_EXPR) ? Py_False : Py_True; in parser_issuite()
530 Py_INCREF(res); in parser_issuite()
532 return (res); in parser_issuite()
565 PyObject* res = 0; in parser_do_parse() local
579 res = parser_newstobject(n, type); in parser_do_parse()
580 if (res) in parser_do_parse()
581 ((PyST_Object *)res)->st_flags.cf_flags = flags & PyCF_MASK; in parser_do_parse()
586 return (res); in parser_do_parse()
721 Py_ssize_t res; in parser_sizeof() local
723 res = _PyObject_SIZE(Py_TYPE(st)) + _PyNode_SizeOf(st->st_node); in parser_sizeof()
724 return PyLong_FromSsize_t(res); in parser_sizeof()
856 node* res = 0; in build_node_tree() local
885 res = PyNode_New(num); in build_node_tree()
886 if (res != NULL) { in build_node_tree()
887 if (res != build_node_children(tuple, res, &line_num)) { in build_node_tree()
888 PyNode_Free(res); in build_node_tree()
889 res = NULL; in build_node_tree()
891 if (res && encoding) { in build_node_tree()
894 res->n_str = (char *)PyObject_MALLOC(len); in build_node_tree()
895 if (res->n_str != NULL) in build_node_tree()
896 (void) memcpy(res->n_str, PyString_AS_STRING(encoding), len); in build_node_tree()
913 return (res); in build_node_tree()
1016 int res = (validate_ntype(terminal, type) in validate_terminal() local
1019 if (!res && !PyErr_Occurred()) { in validate_terminal()
1023 return (res); in validate_terminal()
1034 int res = (nch && validate_ntype(tree, ntype) in validate_repeating_list() local
1037 if (!res && !PyErr_Occurred()) in validate_repeating_list()
1041 res = validate_comma(CHILD(tree, --nch)); in validate_repeating_list()
1042 if (res && nch > 1) { in validate_repeating_list()
1044 for ( ; res && pos < nch; pos += 2) in validate_repeating_list()
1045 res = (validate_comma(CHILD(tree, pos)) in validate_repeating_list()
1049 return (res); in validate_repeating_list()
1062 int res = (validate_ntype(tree, classdef) && in validate_class() local
1065 if (res) { in validate_class()
1066 res = (validate_name(CHILD(tree, 0), "class") in validate_class()
1075 if (res) { in validate_class()
1077 res = ((validate_lparen(CHILD(tree, 2)) && in validate_class()
1082 res = (validate_lparen(CHILD(tree,2)) && in validate_class()
1086 return (res); in validate_class()
1097 int res = (validate_ntype(tree, if_stmt) in validate_if() local
1104 if (res && ((nch % 4) == 3)) { in validate_if()
1106 res = (validate_name(CHILD(tree, nch - 3), "else") in validate_if()
1111 else if (!res && !PyErr_Occurred()) in validate_if()
1115 res = validate_numnodes(tree, 0, "if"); in validate_if()
1116 else if (res && (nch > 4)) { in validate_if()
1119 while ((j < nch) && res) { in validate_if()
1120 res = (validate_name(CHILD(tree, j), "elif") in validate_if()
1127 return (res); in validate_if()
1139 int res = validate_ntype(tree, parameters) && ((nch == 2) || (nch == 3)); in validate_parameters() local
1141 if (res) { in validate_parameters()
1142 res = (validate_lparen(CHILD(tree, 0)) in validate_parameters()
1144 if (res && (nch == 3)) in validate_parameters()
1145 res = validate_varargslist(CHILD(tree, 1)); in validate_parameters()
1150 return (res); in validate_parameters()
1164 int res = (validate_ntype(tree, suite) && ((nch == 1) || (nch >= 4))); in validate_suite() local
1166 if (res && (nch == 1)) in validate_suite()
1167 res = validate_simple_stmt(CHILD(tree, 0)); in validate_suite()
1168 else if (res) { in validate_suite()
1170 res = (validate_newline(CHILD(tree, 0)) in validate_suite()
1175 if (res && (nch > 4)) { in validate_suite()
1178 for ( ; res && (i < nch); ++i) in validate_suite()
1179 res = validate_stmt(CHILD(tree, i)); in validate_suite()
1182 res = validate_numnodes(tree, 4, "suite"); in validate_suite()
1184 return (res); in validate_suite()
1218 int res = 0; in validate_varargslist_trailer() local
1231 res = validate_name(CHILD(tree, start+1), NULL); in validate_varargslist_trailer()
1233 res = (validate_name(CHILD(tree, start+1), NULL) in validate_varargslist_trailer()
1243 res = validate_name(CHILD(tree, start+1), NULL); in validate_varargslist_trailer()
1245 if (!res) in validate_varargslist_trailer()
1247 return res; in validate_varargslist_trailer()
1264 int res = validate_ntype(tree, varargslist) && (nch != 0); in validate_varargslist() local
1267 if (!res) in validate_varargslist()
1278 res = validate_varargslist_trailer(tree, 0); in validate_varargslist()
1290 while (res && (i+2 <= nch)) { in validate_varargslist()
1291 res = validate_fpdef(CHILD(tree, i)); in validate_varargslist()
1293 if (res && TYPE(CHILD(tree, i)) == EQUAL && (i+2 <= nch)) { in validate_varargslist()
1294 res = (validate_equal(CHILD(tree, i)) in validate_varargslist()
1296 if (res) in validate_varargslist()
1299 if (res && i < nch) { in validate_varargslist()
1300 res = validate_comma(CHILD(tree, i)); in validate_varargslist()
1302 if (res && i < nch in validate_varargslist()
1311 if (res) in validate_varargslist()
1312 res = validate_varargslist_trailer(tree, i); in validate_varargslist()
1320 res = validate_comma(CHILD(tree, nch-1)); in validate_varargslist()
1321 if (!res) in validate_varargslist()
1328 res = validate_fpdef(CHILD(tree, 0)); in validate_varargslist()
1330 if (res && (i+2 <= nch) && TYPE(CHILD(tree, i)) == EQUAL) { in validate_varargslist()
1331 res = (validate_equal(CHILD(tree, i)) in validate_varargslist()
1339 while (res && (nch - i) >= 2) { in validate_varargslist()
1340 res = (validate_comma(CHILD(tree, i)) in validate_varargslist()
1343 if (res && (nch - i) >= 2 && TYPE(CHILD(tree, i)) == EQUAL) { in validate_varargslist()
1344 res = (validate_equal(CHILD(tree, i)) in validate_varargslist()
1349 if (res && nch - i != 0) { in validate_varargslist()
1350 res = 0; in validate_varargslist()
1355 return res; in validate_varargslist()
1364 int res = (validate_ntype(tree, list_iter) in validate_list_iter() local
1366 if (res && TYPE(CHILD(tree, 0)) == list_for) in validate_list_iter()
1367 res = validate_list_for(CHILD(tree, 0)); in validate_list_iter()
1369 res = validate_list_if(CHILD(tree, 0)); in validate_list_iter()
1371 return res; in validate_list_iter()
1379 int res = (validate_ntype(tree, comp_iter) in validate_comp_iter() local
1381 if (res && TYPE(CHILD(tree, 0)) == comp_for) in validate_comp_iter()
1382 res = validate_comp_for(CHILD(tree, 0)); in validate_comp_iter()
1384 res = validate_comp_if(CHILD(tree, 0)); in validate_comp_iter()
1386 return res; in validate_comp_iter()
1395 int res; in validate_list_for() local
1398 res = validate_list_iter(CHILD(tree, 4)); in validate_list_for()
1400 res = validate_numnodes(tree, 4, "list_for"); in validate_list_for()
1402 if (res) in validate_list_for()
1403 res = (validate_name(CHILD(tree, 0), "for") in validate_list_for()
1408 return res; in validate_list_for()
1417 int res; in validate_comp_for() local
1420 res = validate_comp_iter(CHILD(tree, 4)); in validate_comp_for()
1422 res = validate_numnodes(tree, 4, "comp_for"); in validate_comp_for()
1424 if (res) in validate_comp_for()
1425 res = (validate_name(CHILD(tree, 0), "for") in validate_comp_for()
1430 return res; in validate_comp_for()
1439 int res; in validate_list_if() local
1442 res = validate_list_iter(CHILD(tree, 2)); in validate_list_if()
1444 res = validate_numnodes(tree, 2, "list_if"); in validate_list_if()
1446 if (res) in validate_list_if()
1447 res = (validate_name(CHILD(tree, 0), "if") in validate_list_if()
1450 return res; in validate_list_if()
1459 int res; in validate_comp_if() local
1462 res = validate_comp_iter(CHILD(tree, 2)); in validate_comp_if()
1464 res = validate_numnodes(tree, 2, "comp_if"); in validate_comp_if()
1466 if (res) in validate_comp_if()
1467 res = (validate_name(CHILD(tree, 0), "if") in validate_comp_if()
1470 return res; in validate_comp_if()
1483 int res = validate_ntype(tree, fpdef); in validate_fpdef() local
1485 if (res) { in validate_fpdef()
1487 res = validate_ntype(CHILD(tree, 0), NAME); in validate_fpdef()
1489 res = (validate_lparen(CHILD(tree, 0)) in validate_fpdef()
1493 res = validate_numnodes(tree, 1, "fpdef"); in validate_fpdef()
1495 return (res); in validate_fpdef()
1513 int res = (validate_ntype(tree, stmt) in validate_stmt() local
1516 if (res) { in validate_stmt()
1520 res = validate_simple_stmt(tree); in validate_stmt()
1522 res = validate_compound_stmt(tree); in validate_stmt()
1524 return (res); in validate_stmt()
1535 int res = (validate_ntype(tree, simple_stmt) in validate_simple_stmt() local
1541 res = validate_numnodes(tree, 2, "simple_stmt"); in validate_simple_stmt()
1543 if (res && is_even(nch)) in validate_simple_stmt()
1544 res = validate_semi(CHILD(tree, --nch)); in validate_simple_stmt()
1545 if (res && (nch > 2)) { in validate_simple_stmt()
1548 for (i = 1; res && (i < nch); i += 2) in validate_simple_stmt()
1549 res = (validate_semi(CHILD(tree, i)) in validate_simple_stmt()
1552 return (res); in validate_simple_stmt()
1560 int res = validate_numnodes(tree, 1, "small_stmt"); in validate_small_stmt() local
1562 if (res) { in validate_small_stmt()
1574 res = validate_node(CHILD(tree, 0)); in validate_small_stmt()
1576 res = 0; in validate_small_stmt()
1581 res = 0; in validate_small_stmt()
1586 return (res); in validate_small_stmt()
1596 int res = (validate_ntype(tree, compound_stmt) in validate_compound_stmt() local
1600 if (!res) in validate_compound_stmt()
1613 res = validate_node(tree); in validate_compound_stmt()
1615 res = 0; in validate_compound_stmt()
1619 return (res); in validate_compound_stmt()
1636 int res = (validate_ntype(tree, expr_stmt) in validate_expr_stmt() local
1640 if (res && nch == 3 in validate_expr_stmt()
1642 res = validate_numnodes(CHILD(tree, 1), 1, "augassign") in validate_expr_stmt()
1645 if (res) { in validate_expr_stmt()
1648 res = (strcmp(s, "+=") == 0 in validate_expr_stmt()
1660 if (!res) in validate_expr_stmt()
1665 for (j = 1; res && (j < nch); j += 2) in validate_expr_stmt()
1666 res = validate_equal(CHILD(tree, j)) in validate_expr_stmt()
1669 return (res); in validate_expr_stmt()
1682 int res = (validate_ntype(tree, print_stmt) in validate_print_stmt() local
1686 if (res && nch > 1) { in validate_print_stmt()
1692 res = validate_test(CHILD(tree, i++)); in validate_print_stmt()
1695 res = validate_numnodes(tree, 3, "print_stmt"); in validate_print_stmt()
1697 res = (validate_ntype(CHILD(tree, i), RIGHTSHIFT) in validate_print_stmt()
1703 if (res) { in validate_print_stmt()
1705 while (res && i+2 <= nch) { in validate_print_stmt()
1706 res = (validate_comma(CHILD(tree, i)) in validate_print_stmt()
1711 if (res && !allow_trailing_comma) in validate_print_stmt()
1712 res = validate_numnodes(tree, i, "print_stmt"); in validate_print_stmt()
1713 else if (res && i < nch) in validate_print_stmt()
1714 res = validate_comma(CHILD(tree, i)); in validate_print_stmt()
1717 return (res); in validate_print_stmt()
1734 int res = (validate_ntype(tree, return_stmt) in validate_return_stmt() local
1738 if (res && (nch == 2)) in validate_return_stmt()
1739 res = validate_testlist(CHILD(tree, 1)); in validate_return_stmt()
1741 return (res); in validate_return_stmt()
1749 int res = (validate_ntype(tree, raise_stmt) in validate_raise_stmt() local
1752 if (res) { in validate_raise_stmt()
1753 res = validate_name(CHILD(tree, 0), "raise"); in validate_raise_stmt()
1754 if (res && (nch >= 2)) in validate_raise_stmt()
1755 res = validate_test(CHILD(tree, 1)); in validate_raise_stmt()
1756 if (res && nch > 2) { in validate_raise_stmt()
1757 res = (validate_comma(CHILD(tree, 2)) in validate_raise_stmt()
1759 if (res && (nch > 4)) in validate_raise_stmt()
1760 res = (validate_comma(CHILD(tree, 4)) in validate_raise_stmt()
1766 if (res && (nch == 4)) in validate_raise_stmt()
1767 res = (validate_comma(CHILD(tree, 2)) in validate_raise_stmt()
1770 return (res); in validate_raise_stmt()
1780 int res = (validate_ntype(tree, yield_expr) in validate_yield_expr() local
1784 if (res && (nch == 2)) in validate_yield_expr()
1785 res = validate_testlist(CHILD(tree, 1)); in validate_yield_expr()
1787 return (res); in validate_yield_expr()
1828 int res = (validate_ntype(tree, dotted_name) in validate_dotted_name() local
1833 for (i = 1; res && (i < nch); i += 2) { in validate_dotted_name()
1834 res = (validate_dot(CHILD(tree, i)) in validate_dotted_name()
1837 return res; in validate_dotted_name()
1847 int res = validate_ntype(tree, dotted_as_name); in validate_dotted_as_name() local
1849 if (res) { in validate_dotted_as_name()
1851 res = validate_dotted_name(CHILD(tree, 0)); in validate_dotted_as_name()
1853 res = (validate_dotted_name(CHILD(tree, 0)) in validate_dotted_as_name()
1857 res = 0; in validate_dotted_as_name()
1861 return res; in validate_dotted_as_name()
1870 int res = is_odd(nch) && validate_dotted_as_name(CHILD(tree, 0)); in validate_dotted_as_names() local
1873 for (i = 1; res && (i < nch); i += 2) in validate_dotted_as_names()
1874 res = (validate_comma(CHILD(tree, i)) in validate_dotted_as_names()
1876 return (res); in validate_dotted_as_names()
1885 int res = validate_import_as_name(CHILD(tree, 0)); in validate_import_as_names() local
1888 for (i = 1; res && (i + 1 < nch); i += 2) in validate_import_as_names()
1889 res = (validate_comma(CHILD(tree, i)) in validate_import_as_names()
1891 return (res); in validate_import_as_names()
1928 int res = validate_ntype(tree, import_from) in validate_import_from() local
1935 if (res && TYPE(CHILD(tree, offset + 2)) == LPAR) in validate_import_from()
1936 res = ((nch == offset + 5) in validate_import_from()
1940 else if (res && TYPE(CHILD(tree, offset + 2)) != STAR) in validate_import_from()
1941 res = validate_import_as_names(CHILD(tree, offset + 2)); in validate_import_from()
1942 return (res); in validate_import_from()
1951 int res = validate_numnodes(tree, 1, "import_stmt"); in validate_import_stmt() local
1953 if (res) { in validate_import_stmt()
1957 res = validate_node(CHILD(tree, 0)); in validate_import_stmt()
1959 res = 0; in validate_import_stmt()
1964 res = 0; in validate_import_stmt()
1969 return (res); in validate_import_stmt()
1980 int res = (validate_ntype(tree, global_stmt) in validate_global_stmt() local
1983 if (!res && !PyErr_Occurred()) in validate_global_stmt()
1986 if (res) in validate_global_stmt()
1987 res = (validate_name(CHILD(tree, 0), "global") in validate_global_stmt()
1989 for (j = 2; res && (j < nch); j += 2) in validate_global_stmt()
1990 res = (validate_comma(CHILD(tree, j)) in validate_global_stmt()
1993 return (res); in validate_global_stmt()
2005 int res = (validate_ntype(tree, exec_stmt) in validate_exec_stmt() local
2010 if (!res && !PyErr_Occurred()) in validate_exec_stmt()
2012 if (res && (nch > 2)) in validate_exec_stmt()
2013 res = (validate_name(CHILD(tree, 2), "in") in validate_exec_stmt()
2015 if (res && (nch == 6)) in validate_exec_stmt()
2016 res = (validate_comma(CHILD(tree, 4)) in validate_exec_stmt()
2019 return (res); in validate_exec_stmt()
2031 int res = (validate_ntype(tree, assert_stmt) in validate_assert_stmt() local
2036 if (!res && !PyErr_Occurred()) in validate_assert_stmt()
2038 if (res && (nch > 2)) in validate_assert_stmt()
2039 res = (validate_comma(CHILD(tree, 2)) in validate_assert_stmt()
2042 return (res); in validate_assert_stmt()
2050 int res = (validate_ntype(tree, while_stmt) in validate_while() local
2057 if (res && (nch == 7)) in validate_while()
2058 res = (validate_name(CHILD(tree, 4), "else") in validate_while()
2062 return (res); in validate_while()
2070 int res = (validate_ntype(tree, for_stmt) in validate_for() local
2079 if (res && (nch == 9)) in validate_for()
2080 res = (validate_name(CHILD(tree, 6), "else") in validate_for()
2084 return (res); in validate_for()
2099 int res = (validate_ntype(tree, try_stmt) in validate_try() local
2102 if (res) in validate_try()
2103 res = (validate_name(CHILD(tree, 0), "try") in validate_try()
2117 if (res && (TYPE(CHILD(tree, pos)) == NAME) && in validate_try()
2119 res = (validate_numnodes(tree, 6, "try/finally") in validate_try()
2122 return (res); in validate_try()
2125 while (res && pos < nch && (TYPE(CHILD(tree, pos)) == except_clause)) { in validate_try()
2126 res = (validate_except_clause(CHILD(tree, pos)) in validate_try()
2132 if (res && pos < nch && (TYPE(CHILD(tree, pos)) == NAME) && in validate_try()
2134 res = (validate_colon(CHILD(tree, pos + 1)) in validate_try()
2138 if (res && pos < nch) { in validate_try()
2140 res = (validate_name(CHILD(tree, pos), "finally") in validate_try()
2145 return (res); in validate_try()
2153 int res = (validate_ntype(tree, except_clause) in validate_except_clause() local
2157 if (res && (nch > 1)) in validate_except_clause()
2158 res = validate_test(CHILD(tree, 1)); in validate_except_clause()
2159 if (res && (nch == 4)) { in validate_except_clause()
2161 res = validate_name(CHILD(tree, 2), "as"); in validate_except_clause()
2163 res = validate_comma(CHILD(tree, 2)); in validate_except_clause()
2164 res = res && validate_test(CHILD(tree, 3)); in validate_except_clause()
2166 return (res); in validate_except_clause()
2174 int res = validate_ntype(tree, test) && is_odd(nch); in validate_test() local
2176 if (res && (TYPE(CHILD(tree, 0)) == lambdef)) in validate_test()
2177 res = ((nch == 1) in validate_test()
2179 else if (res) { in validate_test()
2180 res = validate_or_test(CHILD(tree, 0)); in validate_test()
2181 res = (res && (nch == 1 || (nch == 5 && in validate_test()
2187 return (res); in validate_test()
2194 int res = validate_ntype(tree, old_test) && (nch == 1); in validate_old_test() local
2196 if (res && (TYPE(CHILD(tree, 0)) == old_lambdef)) in validate_old_test()
2197 res = (validate_old_lambdef(CHILD(tree, 0))); in validate_old_test()
2198 else if (res) { in validate_old_test()
2199 res = (validate_or_test(CHILD(tree, 0))); in validate_old_test()
2201 return (res); in validate_old_test()
2208 int res = validate_ntype(tree, or_test) && is_odd(nch); in validate_or_test() local
2210 if (res) { in validate_or_test()
2212 res = validate_and_test(CHILD(tree, 0)); in validate_or_test()
2213 for (pos = 1; res && (pos < nch); pos += 2) in validate_or_test()
2214 res = (validate_name(CHILD(tree, pos), "or") in validate_or_test()
2217 return (res); in validate_or_test()
2226 int res = (validate_ntype(tree, and_test) in validate_and_test() local
2230 for (pos = 1; res && (pos < nch); pos += 2) in validate_and_test()
2231 res = (validate_name(CHILD(tree, pos), "and") in validate_and_test()
2234 return (res); in validate_and_test()
2242 int res = validate_ntype(tree, not_test) && ((nch == 1) || (nch == 2)); in validate_not_test() local
2244 if (res) { in validate_not_test()
2246 res = (validate_name(CHILD(tree, 0), "not") in validate_not_test()
2249 res = validate_comparison(CHILD(tree, 0)); in validate_not_test()
2251 return (res); in validate_not_test()
2260 int res = (validate_ntype(tree, comparison) in validate_comparison() local
2264 for (pos = 1; res && (pos < nch); pos += 2) in validate_comparison()
2265 res = (validate_comp_op(CHILD(tree, pos)) in validate_comparison()
2268 return (res); in validate_comparison()
2275 int res = 0; in validate_comp_op() local
2294 res = 1; in validate_comp_op()
2297 res = ((strcmp(STR(tree), "in") == 0) in validate_comp_op()
2299 if (!res) { in validate_comp_op()
2309 else if ((res = validate_numnodes(tree, 2, "comp_op")) != 0) { in validate_comp_op()
2310 res = (validate_ntype(CHILD(tree, 0), NAME) in validate_comp_op()
2316 if (!res && !PyErr_Occurred()) in validate_comp_op()
2319 return (res); in validate_comp_op()
2328 int res = (validate_ntype(tree, expr) in validate_expr() local
2332 for (j = 2; res && (j < nch); j += 2) in validate_expr()
2333 res = (validate_xor_expr(CHILD(tree, j)) in validate_expr()
2336 return (res); in validate_expr()
2345 int res = (validate_ntype(tree, xor_expr) in validate_xor_expr() local
2349 for (j = 2; res && (j < nch); j += 2) in validate_xor_expr()
2350 res = (validate_circumflex(CHILD(tree, j - 1)) in validate_xor_expr()
2353 return (res); in validate_xor_expr()
2362 int res = (validate_ntype(tree, and_expr) in validate_and_expr() local
2366 for (pos = 1; res && (pos < nch); pos += 2) in validate_and_expr()
2367 res = (validate_ampersand(CHILD(tree, pos)) in validate_and_expr()
2370 return (res); in validate_and_expr()
2379 int res = (is_odd(nch) in validate_chain_two_ops() local
2382 for ( ; res && (pos < nch); pos += 2) { in validate_chain_two_ops()
2384 res = validate_ntype(CHILD(tree, pos), op2); in validate_chain_two_ops()
2385 if (res) in validate_chain_two_ops()
2386 res = (*termvalid)(CHILD(tree, pos + 1)); in validate_chain_two_ops()
2388 return (res); in validate_chain_two_ops()
2414 int res = (validate_ntype(tree, term) in validate_term() local
2418 for ( ; res && (pos < nch); pos += 2) in validate_term()
2419 res = (((TYPE(CHILD(tree, pos)) == STAR) in validate_term()
2425 return (res); in validate_term()
2437 int res = (validate_ntype(tree, factor) in validate_factor() local
2445 return (res); in validate_factor()
2458 int res = (validate_ntype(tree, power) && (nch >= 1) in validate_power() local
2461 while (res && (pos < nch) && (TYPE(CHILD(tree, pos)) == trailer)) in validate_power()
2462 res = validate_trailer(CHILD(tree, pos++)); in validate_power()
2463 if (res && (pos < nch)) { in validate_power()
2468 for ( ; res && (pos < (nch - 1)); pos += 2) in validate_power()
2469 res = (validate_doublestar(CHILD(tree, pos)) in validate_power()
2472 return (res); in validate_power()
2481 int res = validate_ntype(tree, atom); in validate_atom() local
2483 if (res && nch < 1) in validate_atom()
2484 res = validate_numnodes(tree, nch+1, "atom"); in validate_atom()
2485 if (res) { in validate_atom()
2488 res = ((nch <= 3) in validate_atom()
2491 if (res && (nch == 3)) { in validate_atom()
2493 res = validate_yield_expr(CHILD(tree, 1)); in validate_atom()
2495 res = validate_testlist_comp(CHILD(tree, 1)); in validate_atom()
2500 res = validate_ntype(CHILD(tree, 1), RSQB); in validate_atom()
2502 res = (validate_listmaker(CHILD(tree, 1)) in validate_atom()
2505 res = 0; in validate_atom()
2510 res = ((nch <= 3) in validate_atom()
2513 if (res && (nch == 3)) in validate_atom()
2514 res = validate_dictorsetmaker(CHILD(tree, 1)); in validate_atom()
2517 res = ((nch == 3) in validate_atom()
2523 res = (nch == 1); in validate_atom()
2526 for (pos = 1; res && (pos < nch); ++pos) in validate_atom()
2527 res = validate_ntype(CHILD(tree, pos), STRING); in validate_atom()
2530 res = 0; in validate_atom()
2534 return (res); in validate_atom()
2730 int res = (validate_ntype(tree, lambdef) in validate_lambdef() local
2736 if (res && (nch == 4)) in validate_lambdef()
2737 res = validate_varargslist(CHILD(tree, 1)); in validate_lambdef()
2738 else if (!res && !PyErr_Occurred()) in validate_lambdef()
2741 return (res); in validate_lambdef()
2749 int res = (validate_ntype(tree, old_lambdef) in validate_old_lambdef() local
2755 if (res && (nch == 4)) in validate_old_lambdef()
2756 res = validate_varargslist(CHILD(tree, 1)); in validate_old_lambdef()
2757 else if (!res && !PyErr_Occurred()) in validate_old_lambdef()
2760 return (res); in validate_old_lambdef()
2856 int res = (validate_ntype(tree, argument) in validate_argument() local
2860 if (res && (nch == 2)) in validate_argument()
2861 res = validate_comp_for(CHILD(tree, 1)); in validate_argument()
2862 else if (res && (nch == 3)) in validate_argument()
2863 res = (validate_equal(CHILD(tree, 1)) in validate_argument()
2866 return (res); in validate_argument()
2879 int res = validate_ntype(tree, trailer) && ((nch == 2) || (nch == 3)); in validate_trailer() local
2881 if (res) { in validate_trailer()
2884 res = validate_rparen(CHILD(tree, nch - 1)); in validate_trailer()
2885 if (res && (nch == 3)) in validate_trailer()
2886 res = validate_arglist(CHILD(tree, 1)); in validate_trailer()
2889 res = (validate_numnodes(tree, 3, "trailer") in validate_trailer()
2894 res = (validate_numnodes(tree, 2, "trailer") in validate_trailer()
2898 res = 0; in validate_trailer()
2905 return (res); in validate_trailer()
2930 int res = validate_ntype(tree, subscript) && (nch >= 1) && (nch <= 4); in validate_subscript() local
2932 if (!res) { in validate_subscript()
2945 res = validate_test(CHILD(tree, 0)); in validate_subscript()
2947 res = validate_colon(CHILD(tree, 0)); in validate_subscript()
2948 return (res); in validate_subscript()
2955 res = validate_test(CHILD(tree, 0)); in validate_subscript()
2958 if (res) in validate_subscript()
2959 res = validate_colon(CHILD(tree, offset)); in validate_subscript()
2960 if (res) { in validate_subscript()
2964 res = validate_test(CHILD(tree, offset)); in validate_subscript()
2968 if (res && rem) in validate_subscript()
2969 res = validate_sliceop(CHILD(tree, offset)); in validate_subscript()
2972 return (res); in validate_subscript()
2980 int res = ((nch == 1) || validate_numnodes(tree, 2, "sliceop")) in validate_sliceop() local
2982 if (!res && !PyErr_Occurred()) { in validate_sliceop()
2983 res = validate_numnodes(tree, 1, "sliceop"); in validate_sliceop()
2985 if (res) in validate_sliceop()
2986 res = validate_colon(CHILD(tree, 0)); in validate_sliceop()
2987 if (res && (nch == 2)) in validate_sliceop()
2988 res = validate_test(CHILD(tree, 1)); in validate_sliceop()
2990 return (res); in validate_sliceop()
3088 int res = (validate_ntype(tree, eval_input) in validate_eval_input() local
3093 for (pos = 1; res && (pos < (nch - 1)); ++pos) in validate_eval_input()
3094 res = validate_ntype(CHILD(tree, pos), NEWLINE); in validate_eval_input()
3096 return (res); in validate_eval_input()
3104 int res = 1; /* result value */ in validate_node() local
3107 while (res && (tree != 0)) { in validate_node()
3115 res = validate_funcdef(tree); in validate_node()
3118 res = validate_with_stmt(tree); in validate_node()
3121 res = validate_class(tree); in validate_node()
3124 res = validate_decorated(tree); in validate_node()
3131 res = validate_stmt(tree); in validate_node()
3138 res = validate_small_stmt(tree); in validate_node()
3141 res = (validate_numnodes(tree, 1, "flow_stmt") in validate_node()
3147 if (res) in validate_node()
3153 res = validate_yield_stmt(tree); in validate_node()
3159 res = validate_simple_stmt(tree); in validate_node()
3162 res = validate_compound_stmt(tree); in validate_node()
3168 res = validate_expr_stmt(tree); in validate_node()
3171 res = validate_print_stmt(tree); in validate_node()
3174 res = validate_del_stmt(tree); in validate_node()
3177 res = (validate_numnodes(tree, 1, "pass") in validate_node()
3181 res = (validate_numnodes(tree, 1, "break") in validate_node()
3185 res = (validate_numnodes(tree, 1, "continue") in validate_node()
3189 res = validate_return_stmt(tree); in validate_node()
3192 res = validate_raise_stmt(tree); in validate_node()
3195 res = validate_import_stmt(tree); in validate_node()
3198 res = validate_import_name(tree); in validate_node()
3201 res = validate_import_from(tree); in validate_node()
3204 res = validate_global_stmt(tree); in validate_node()
3207 res = validate_exec_stmt(tree); in validate_node()
3210 res = validate_assert_stmt(tree); in validate_node()
3213 res = validate_if(tree); in validate_node()
3216 res = validate_while(tree); in validate_node()
3219 res = validate_for(tree); in validate_node()
3222 res = validate_try(tree); in validate_node()
3225 res = validate_suite(tree); in validate_node()
3231 res = validate_testlist(tree); in validate_node()
3234 res = validate_yield_expr(tree); in validate_node()
3237 res = validate_testlist1(tree); in validate_node()
3240 res = validate_test(tree); in validate_node()
3243 res = validate_and_test(tree); in validate_node()
3246 res = validate_not_test(tree); in validate_node()
3249 res = validate_comparison(tree); in validate_node()
3252 res = validate_exprlist(tree); in validate_node()
3255 res = validate_comp_op(tree); in validate_node()
3258 res = validate_expr(tree); in validate_node()
3261 res = validate_xor_expr(tree); in validate_node()
3264 res = validate_and_expr(tree); in validate_node()
3267 res = validate_shift_expr(tree); in validate_node()
3270 res = validate_arith_expr(tree); in validate_node()
3273 res = validate_term(tree); in validate_node()
3276 res = validate_factor(tree); in validate_node()
3279 res = validate_power(tree); in validate_node()
3282 res = validate_atom(tree); in validate_node()
3288 res = 0; in validate_node()
3293 return (res); in validate_node()
3300 int res = validate_eval_input(tree); in validate_expr_tree() local
3302 if (!res && !PyErr_Occurred()) in validate_expr_tree()
3305 return (res); in validate_expr_tree()
3317 int res = ((nch >= 0) in validate_file_input() local
3320 for (j = 0; res && (j < nch); ++j) { in validate_file_input()
3322 res = validate_stmt(CHILD(tree, j)); in validate_file_input()
3324 res = validate_newline(CHILD(tree, j)); in validate_file_input()
3330 if (!res && !PyErr_Occurred()) in validate_file_input()
3333 return (res); in validate_file_input()
3340 int res = ((nch == 1) in validate_encoding_decl() local
3343 if (!res && !PyErr_Occurred()) in validate_encoding_decl()
3346 return res; in validate_encoding_decl()
3482 PyObject *res; in initparser() local
3484 res = PyObject_CallFunctionObjArgs(func, &PyST_Type, pickler, in initparser()
3486 Py_XDECREF(res); in initparser()