Package org.objectweb.asm.tree

Examples of org.objectweb.asm.tree.TableSwitchInsnNode

223
224
225
226
227
228
229
230
231
232
233
                            jump = insns.indexOf(label);
                            merge(jump, current, subroutine);
                            newControlFlowEdge(insn, jump);
                        }
                    } else if (insnNode instanceof TableSwitchInsnNode) {
                        TableSwitchInsnNode tsi = (TableSwitchInsnNode) insnNode;
                        int jump = insns.indexOf(tsi.dflt);
                        merge(jump, current, subroutine);
                        newControlFlowEdge(insn, jump);
                        for (int j = 0; j < tsi.labels.size(); ++j) {
                            LabelNode label = tsi.labels.get(j);
View Full Code Here
322
323
324
325
326
327
328
329
330
331
332
                } else {
                    JumpInsnNode jnode = (JumpInsnNode) node;
                    findSubroutine(insns.indexOf(jnode.label), sub, calls);
                }
            } else if (node instanceof TableSwitchInsnNode) {
                TableSwitchInsnNode tsnode = (TableSwitchInsnNode) node;
                findSubroutine(insns.indexOf(tsnode.dflt), sub, calls);
                for (int i = tsnode.labels.size() - 1; i >= 0; --i) {
                    LabelNode l = tsnode.labels.get(i);
                    findSubroutine(insns.indexOf(l), sub, calls);
                }
View Full Code Here
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
                        assert dupLabel != null;
                        lastInsn = new JumpInsnNode(lastInsn.getOpcode(), dupLabel);
                    }

                } else if (opcode == TABLESWITCH) {
                    TableSwitchInsnNode tsin = (TableSwitchInsnNode) lastInsn;
                    Label[] labels = new Label[tsin.labels.size()];
                    for (i = 0; i < labels.length; i++) {
                        dupLabel = labelCopyMap.get(tsin.labels.get(i));
                        assert dupLabel != null;
                        labels[i] = dupLabel;
                    }
                    dupLabel = labelCopyMap.get(tsin.dflt);
                    assert dupLabel != null;
                    lastInsn = new TableSwitchInsnNode(tsin.min, tsin.max, dupLabel, labels);
                } else if (opcode == LOOKUPSWITCH) {
                    LookupSwitchInsnNode lsin = (LookupSwitchInsnNode) lastInsn;
                    Label[] labels = new Label[lsin.labels.size()];
                    for (i = 0; i < labels.length; i++) {
                        dupLabel = labelCopyMap.get(lsin.labels.get(i));
View Full Code Here
216
217
218
219
220
221
222
223
224
225
226
                            jump = insns.indexOf(label);
                            merge(jump, current, subroutine);
                            newControlFlowEdge(insn, jump);
                        }
                    } else if (insnNode instanceof TableSwitchInsnNode) {
                        TableSwitchInsnNode tsi = (TableSwitchInsnNode) insnNode;
                        int jump = insns.indexOf(tsi.dflt);
                        merge(jump, current, subroutine);
                        newControlFlowEdge(insn, jump);
                        for (int j = 0; j < tsi.labels.size(); ++j) {
                            LabelNode label = (LabelNode) tsi.labels.get(j);
View Full Code Here
319
320
321
322
323
324
325
326
327
328
329
                } else {
                    JumpInsnNode jnode = (JumpInsnNode) node;
                    findSubroutine(insns.indexOf(jnode.label), sub, calls);
                }
            } else if (node instanceof TableSwitchInsnNode) {
                TableSwitchInsnNode tsnode = (TableSwitchInsnNode) node;
                findSubroutine(insns.indexOf(tsnode.dflt), sub, calls);
                for (int i = tsnode.labels.size() - 1; i >= 0; --i) {
                    LabelNode l = (LabelNode) tsnode.labels.get(i);
                    findSubroutine(insns.indexOf(l), sub, calls);
                }
View Full Code Here
280
281
282
283
284
285
286
287
288
289
290
                JumpInsnNode jnode = (JumpInsnNode) node;
                int destidx = instructions.indexOf(jnode.label);
                markSubroutineWalkDFS(sub, destidx, anyvisited);
            }
            if (node.getType() == AbstractInsnNode.TABLESWITCH_INSN) {
                TableSwitchInsnNode tsnode = (TableSwitchInsnNode) node;
                int destidx = instructions.indexOf(tsnode.dflt);
                markSubroutineWalkDFS(sub, destidx, anyvisited);
                for (int i = tsnode.labels.size() - 1; i >= 0; --i) {
                    LabelNode l = (LabelNode) tsnode.labels.get(i);
                    destidx = instructions.indexOf(l);
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
          labelz.put(jin.label.getLabel().getOffset(), jin.label);
        } else {
          jin.label = cl;
        }
      } else if (ain instanceof TableSwitchInsnNode) {
        TableSwitchInsnNode tsin = (TableSwitchInsnNode) ain;
        LabelNode cl = labelz.get(tsin.dflt.getLabel().getOffset());
        if (cl == null) {
          labelz.put(tsin.dflt.getLabel().getOffset(), tsin.dflt);
        } else {
          tsin.dflt = cl;
View Full Code Here
364
365
366
367
368
369
370
371
372
373
374
            return new LineNumberNode(toint(args[1]), getLabelNode(toint(args[2])));// FIXME
          case "MULTIANEWARRAY":
            return new MultiANewArrayInsnNode(args[1], toint(args[2]));
          case "TABLESWITCH":
          case "SWITCH":
            return new TableSwitchInsnNode(toint(args[1]), toint(args[2]),
                getLabelNode(toint(args[3])), getLabelNode(toint(args[4]))); // FIXME arg4 is a
                                                                             // varargs
          case "IINC":
            return new IincInsnNode(toint(args[1]), toint(args[2]));
          case "FRAME":
View Full Code Here
581
582
583
584
585
586
587
588
589
590
591
          MultiANewArrayInsnNode manin = (MultiANewArrayInsnNode) ain;
          fullInsn += ' ' + manin.desc;
          fullInsn += " " + manin.dims;
          break;
        case AbstractInsnNode.TABLESWITCH_INSN:
          TableSwitchInsnNode tsin = (TableSwitchInsnNode) ain;
          fullInsn += " " + tsin.min;
          fullInsn += " " + tsin.max;
          fullInsn += ' ' + tsin.dflt.getLabel().getOffset();
          for (LabelNode ln : (List<LabelNode>) tsin.labels) {
            fullInsn += ' ' + ln.getLabel().getOffset();
View Full Code Here
31
32
33
34
35
36
37
        List<LabelNode> labelList = context.deserialize(jsonObject.get("labels"), List.class);
        LabelNode[] labels = new LabelNode[labelList.size()];
        for(int i=0; i < labels.length; i++){
          labels[i] = labelList.get(i);
        }
        return new TableSwitchInsnNode(min, max, dflt, labels);
    }
View Full Code Here
TOP

Related Classes of org.objectweb.asm.tree.TableSwitchInsnNode

  • eu.bibl.banalysis.storage.gson.TableSwitchInsnNodeSerializer
  • kilim.analysis.BasicBlock
  • kilim.analysis.CallWeaver
  • kilim.analysis.MethodWeaver
  • nf.co.haxter.util.BytecodeUtils
  • org.jacoco.core.internal.instr.DuplicateFrameEliminatorTest
  • org.objectweb.asm.commons.JSRInlinerAdapter
  • org.objectweb.asm.tree.analysis.Analyzer
  • org.perl6.nqp.jast2bc.AutosplitMethodWriter
  • org.rascalmpl.library.lang.jvm.transform.Rascalify
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.