Lines Matching +full:branches +full:- +full:ignore

9  *      http://www.apache.org/licenses/LICENSE-2.0
91     body = (ASTExpr)children[children.length - 1];  in closeNode()
93     argv = new ASTIdent[children.length - 2]; // May be 0-size array  in closeNode()
94     for(int i = 1; i < children.length - 1; i++) {  in closeNode()
95         argv[i - 1] = (ASTIdent)children[i];  in closeNode()
162     boolean main=false, ignore=false;  in code()
171       ignore = true;  in code()
180         if(i < argv.length - 1) {  in code()
188     if(!ignore) {  in code()
217     boolean main=false, ignore=false;  in byte_code()
232       ignore = true;  in byte_code()
257     if(!ignore) {  in byte_code()
288       optimizeIFs(il);     // Second optimization pass, application-specific  in byte_code()
312    * where the IF_ICMP__ branches to the ICONST_0 (else part) and the GOTO branches
317    * where the IF_ICMP__ now branches to the target of the previous IFEQ instruction.
361       if(i < argv.length - 1) {  in toString()
412       if(i < max_size - 1) {  in getVarDecls()
423   static void pop(int s) { size -= s; }  in pop()
441     return "_s" + (--size);  in pop()