Lines Matching defs:to
8 * particular file as subject to the "Classpath" exception as provided
18 * 2 along with this work; if not, write to the Free Software Foundation,
64 // Following variables are used to govern the state of collapsing long sequences of NOP.
568 private void checkNoFallThru(final int opcode, final String to) {
573 if (currentBlock != null && to != null) {
574 graph.addEdge(currentBlock, to);
582 final String to = appendLabel(sb, label);
585 checkNoFallThru(opcode, to);
643 final String to = appendLabel(sb, labels[i]);
644 graph.addEdge(currentBlock, to);
659 final String to = appendLabel(sb, labels[i]);
660 graph.addEdge(currentBlock, to);
664 final String to = appendLabel(sb, dflt);
665 graph.addEdge(currentBlock, to);
687 final String to = appendLabel(sb, handler);
692 graph.setIsCatch(to, type);
693 graph.addTryCatch(from, to);
784 //here we need to do several bytecode guesses best upon the ldc instructions.
1014 private final Map<String, Set<String>> exceptionMap; //maps catch nodes to all their trys that can reach them
1034 void addEdge(final String from, final String to) {
1040 edgeSet.add(to);
1041 hasPreds.add(to);
1134 for (final String to : edges.get(from)) {
1138 sb.append(to);
1140 sb.append(to);
1142 if (catches.get(to) != null) {