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()
226     Py_ssize_t h, i, nexti, op_start, codelen, tgt;  in PyCode_Optimize()  local
254     codelen = PyBytes_GET_SIZE(code);  in PyCode_Optimize()
255     assert(codelen % sizeof(_Py_CODEUNIT) == 0);  in PyCode_Optimize()
258     codestr = (_Py_CODEUNIT *)PyMem_Malloc(codelen);  in PyCode_Optimize()
263     memcpy(codestr, PyBytes_AS_STRING(code), codelen);  in PyCode_Optimize()
264     codelen /= sizeof(_Py_CODEUNIT);  in PyCode_Optimize()
266     blocks = markblocks(codestr, codelen);  in PyCode_Optimize()
271     for (i=find_op(codestr, codelen, 0) ; i<codelen ; i=nexti) {  in PyCode_Optimize()
279         while (nexti < codelen && _Py_OPCODE(codestr[nexti]) == EXTENDED_ARG)  in PyCode_Optimize()
281         nextop = nexti < codelen ? _Py_OPCODE(codestr[nexti]) : 0;  in PyCode_Optimize()
309                         h = fold_tuple_on_constants(codestr, codelen,  in PyCode_Optimize()
347                 tgt = find_op(codestr, codelen, h);  in PyCode_Optimize()
388                 tgt = find_op(codestr, codelen, h);  in PyCode_Optimize()
412                 while (h < codelen && ISBASICBLOCK(blocks, i, h)) {  in PyCode_Optimize()
417                     nexti = find_op(codestr, codelen, h);  in PyCode_Optimize()
424     for (i = 0, nops = 0; i < codelen; i++) {  in PyCode_Optimize()
446     for (op_start = i = h = 0; i < codelen; i++, op_start = i) {  in PyCode_Optimize()
483     assert(h + (Py_ssize_t)nops == codelen);  in PyCode_Optimize()