Home
last modified time | relevance | path

Searched refs:asdl_seq_LEN (Results 1 - 11 of 11) sorted by relevance

/third_party/python/Python/
H A Dast.c70 if (!asdl_seq_LEN(gens)) { in validate_comprehension()
74 for (Py_ssize_t i = 0; i < asdl_seq_LEN(gens); i++) { in validate_comprehension()
88 for (Py_ssize_t i = 0; i < asdl_seq_LEN(keywords); i++) in validate_keywords()
98 for (Py_ssize_t i = 0; i < asdl_seq_LEN(args); i++) { in validate_args()
139 if (asdl_seq_LEN(args->defaults) > asdl_seq_LEN(args->posonlyargs) + asdl_seq_LEN(args->args)) { in validate_arguments()
143 if (asdl_seq_LEN(args->kw_defaults) != asdl_seq_LEN(args->kwonlyargs)) { in validate_arguments()
264 if (asdl_seq_LEN(ex in validate_expr()
[all...]
H A Dast_unparse.c132 value_count = asdl_seq_LEN(values); in append_ast_boolop()
224 posonlyarg_count = asdl_seq_LEN(args->posonlyargs); in append_ast_args()
225 arg_count = asdl_seq_LEN(args->args); in append_ast_args()
226 default_count = asdl_seq_LEN(args->defaults); in append_ast_args()
246 if (args->vararg || asdl_seq_LEN(args->kwonlyargs)) { in append_ast_args()
255 arg_count = asdl_seq_LEN(args->kwonlyargs); in append_ast_args()
256 default_count = asdl_seq_LEN(args->kw_defaults); in append_ast_args()
285 Py_ssize_t n_positional = (asdl_seq_LEN(e->v.Lambda.args->args) + in append_ast_lambda()
286 asdl_seq_LEN(e->v.Lambda.args->posonlyargs)); in append_ast_lambda()
315 value_count = asdl_seq_LEN( in append_ast_dict()
[all...]
H A Dfuture.c16 for (i = 0; i < asdl_seq_LEN(names); i++) { in future_check_features()
64 if (asdl_seq_LEN(mod->v.Module.body) == 0) in future_parse()
79 for (; i < asdl_seq_LEN(mod->v.Module.body); i++) { in future_parse()
H A Dcompile.c1690 for (_i = 0; _i < asdl_seq_LEN(seq); _i++) { \
1700 for (_i = 0; _i < asdl_seq_LEN(seq); _i++) { \
1857 for (i = 0; i < asdl_seq_LEN(stmts); i++) { in find_ann()
1885 for (j = 0; j < asdl_seq_LEN(st->v.Try.handlers); j++) { in find_ann()
1897 for (j = 0; j < asdl_seq_LEN(st->v.TryStar.handlers); j++) { in find_ann()
1909 for (j = 0; j < asdl_seq_LEN(st->v.Match.cases); j++) { in find_ann()
2152 if (c->u->u_scope_type == COMPILER_SCOPE_MODULE && asdl_seq_LEN(stmts)) { in compiler_body()
2160 if (!asdl_seq_LEN(stmts)) in compiler_body()
2175 for (; i < asdl_seq_LEN(stmts); i++) in compiler_body()
2322 for (i = 0; i < asdl_seq_LEN(deco in compiler_decorators()
[all...]
H A Dast_opt.c36 Py_ssize_t n = asdl_seq_LEN(elts); in has_starred()
64 asdl_seq_LEN(arg->v.Compare.ops) == 1) { in fold_unaryop()
397 asdl_expr_seq *seq = _Py_asdl_expr_seq_new(asdl_seq_LEN(elts) * 2 + 1, arena); in optimize_format()
415 if (cnt >= asdl_seq_LEN(elts)) { in optimize_format()
428 if (cnt < asdl_seq_LEN(elts)) { in optimize_format()
520 for (int i = 0; i < asdl_seq_LEN(elts); i++) { in make_const_tuple()
527 PyObject *newval = PyTuple_New(asdl_seq_LEN(elts)); in make_const_tuple()
532 for (int i = 0; i < asdl_seq_LEN(elts); i++) { in make_const_tuple()
618 i = asdl_seq_LEN(ops) - 1; in fold_compare()
651 for (i = 0; i < asdl_seq_LEN(se
[all...]
H A Dsymtable.c318 for (i = 0; i < asdl_seq_LEN(seq); i++) in _PySymtable_Build()
329 for (i = 0; i < asdl_seq_LEN(seq); i++) in _PySymtable_Build()
1137 for (i = 0; i < asdl_seq_LEN(seq); i++) { \
1147 for (i = (START); i < asdl_seq_LEN(seq); i++) { \
1157 for (i = 0; i < asdl_seq_LEN(seq); i++) { \
1356 for (i = 0; i < asdl_seq_LEN(seq); i++) { in symtable_visit_stmt()
1392 for (i = 0; i < asdl_seq_LEN(seq); i++) { in symtable_visit_stmt()
1806 for (i = 0; i < asdl_seq_LEN(args); i++) { in symtable_visit_params()
1841 for (i = 0; i < asdl_seq_LEN(args); i++) { in symtable_visit_argannotations()
H A Dtraceback.c698 if (asdl_seq_LEN(module->v.Module.body) == 1) { in extract_anchors_from_line()
H A DPython-ast.c978 Py_ssize_t i, n = asdl_seq_LEN(seq); in ast2obj_list()
4498 Py_ssize_t i, n = asdl_seq_LEN(o->v.Compare.ops); in ast2obj_expr()
/third_party/python/Parser/
H A Daction_helpers.c51 asdl_seq *new_seq = (asdl_seq*)_Py_asdl_generic_seq_new(asdl_seq_LEN(seq) + 1, p->arena); in _PyPegen_seq_insert_in_front()
57 for (Py_ssize_t i = 1, l = asdl_seq_LEN(new_seq); i < l; i++) { in _PyPegen_seq_insert_in_front()
72 asdl_seq *new_seq = (asdl_seq*)_Py_asdl_generic_seq_new(asdl_seq_LEN(seq) + 1, p->arena); in _PyPegen_seq_append_to_end()
77 for (Py_ssize_t i = 0, l = asdl_seq_LEN(new_seq); i + 1 < l; i++) { in _PyPegen_seq_append_to_end()
80 asdl_seq_SET_UNTYPED(new_seq, asdl_seq_LEN(new_seq) - 1, a); in _PyPegen_seq_append_to_end()
88 for (Py_ssize_t i = 0, l = asdl_seq_LEN(seqs); i < l; i++) { in _get_flattened_seq_size()
90 size += asdl_seq_LEN(inner_seq); in _get_flattened_seq_size()
108 for (Py_ssize_t i = 0, l = asdl_seq_LEN(seqs); i < l; i++) { in _PyPegen_seq_flatten()
110 for (Py_ssize_t j = 0, li = asdl_seq_LEN(inner_seq); j < li; j++) { in _PyPegen_seq_flatten()
122 Py_ssize_t len = asdl_seq_LEN(se in _PyPegen_seq_last_item()
[all...]
H A Dparser.c7913 _res = asdl_seq_LEN ( patterns ) == 1 ? asdl_seq_GET ( patterns , 0 ) : _PyAST_MatchOr ( patterns , EXTRA ); in or_pattern_rule()
[all...]
/third_party/python/Include/internal/
H A Dpycore_asdl.h83 #define asdl_seq_LEN(S) _Py_RVALUE(((S) == NULL ? 0 : (S)->size)) macro

Completed in 64 milliseconds