Lines Matching refs:codelen
53 find_op(const _Py_CODEUNIT *codestr, Py_ssize_t codelen, Py_ssize_t i) in find_op() argument
55 while (i < codelen && _Py_OPCODE(codestr[i]) == EXTENDED_ARG) { in find_op()
131 fold_tuple_on_constants(_Py_CODEUNIT *codestr, Py_ssize_t codelen, in fold_tuple_on_constants() argument
146 pos = find_op(codestr, codelen, pos); in fold_tuple_on_constants()
267 Py_ssize_t codelen = codesize / sizeof(_Py_CODEUNIT); in PyCode_Optimize() local
268 if (codelen > INT_MAX) { in PyCode_Optimize()
282 blocks = markblocks(codestr, codelen); in PyCode_Optimize()
287 for (i=find_op(codestr, codelen, 0) ; i<codelen ; i=nexti) { in PyCode_Optimize()
295 while (nexti < codelen && _Py_OPCODE(codestr[nexti]) == EXTENDED_ARG) in PyCode_Optimize()
297 nextop = nexti < codelen ? _Py_OPCODE(codestr[nexti]) : 0; in PyCode_Optimize()
332 h = fold_tuple_on_constants(codestr, codelen, in PyCode_Optimize()
370 tgt = find_op(codestr, codelen, h); in PyCode_Optimize()
408 tgt = find_op(codestr, codelen, h); in PyCode_Optimize()
435 while (h < codelen && ISBASICBLOCK(blocks, i, h)) in PyCode_Optimize()
450 nexti = find_op(codestr, codelen, h); in PyCode_Optimize()
457 for (i = 0, nops = 0; i < codelen; i++) { in PyCode_Optimize()
482 for (op_start = i = h = 0; i < codelen; i++, op_start = i) { in PyCode_Optimize()
523 assert(h + (Py_ssize_t)nops == codelen); in PyCode_Optimize()