Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Copyright (c) 2012, Codename One and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Codename One designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Codename One through http://www.codenameone.com/ if you
* need additional information or have any questions.
*/
package com.codename1.tools.translator.bytecodes;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Hashtable;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.TreeSet;
import org.objectweb.asm.Label;
import org.objectweb.asm.Opcodes;
/**
*
* @author Shai Almog
*/
public class LabelInstruction extends Instruction {
private Label parent;
static class Pair {
String cls;
int counter;
Pair(String cls, int counter) {
this.cls = cls; this.counter = counter;
}
}
private static Map> tryBeginLabels = new HashMap>();
private static Map tryEndLabels = new HashMap();
private static Map labelCatchDepth = new HashMap();
// [ddyer 4/2017] convert this from a tree of strings to use the label itself
// this fixes the problem of mysterious "statement expected" errors from builds,
// caused because labels created by the assembler are not globally unique.
// this also reduced memory use by a lot because we no longer create
// a lot of strings.
private static Map usedLabels = new Hashtable();
// cleanup between passes, free the garbage!
public static void cleanup()
{
tryBeginLabels.clear();
tryEndLabels.clear();
labelCatchDepth.clear();
usedLabels.clear();
}
public LabelInstruction(org.objectweb.asm.Label parent) {
super(-1);
this.parent = parent;
}
public static int getLabelCatchDepth(Label l, List inst) {
Integer i = labelCatchDepth.get(l);
if(i == null) {
int counter = 0;
if (BasicInstruction.isSynchronizedMethod()) {
// Synchronized methods wrap call monitorEnterBlock() which
// pushes a block onto the tryBlock stack
// that we need to account for.
counter++;
}
for(Instruction is : inst) {
if(is instanceof LabelInstruction) {
LabelInstruction ll = (LabelInstruction)is;
if(ll.parent == l) {
break;
}
List list = tryBeginLabels.get(ll.parent);
if(list != null) {
counter += list.size();
}
Integer end = tryEndLabels.get(ll.parent);
if(end != null) {
counter -= end.intValue();
}
}
}
i = Integer.valueOf(counter);
labelCatchDepth.put(l, i);
}
return i.intValue();
}
public static void addTryBeginLabel(Label l, String exception, int counter) {
List ll = tryBeginLabels.get(l);
if(ll == null) {
ll = new ArrayList();
tryBeginLabels.put(l, ll);
labelIsUsed(l);
}
ll.add(new Pair(exception, counter));
}
public static void addTryEndLabel(Label l) {
Integer i = tryEndLabels.get(l);
if(i == null) {
tryEndLabels.put(l, Integer.valueOf(1));
} else {
tryEndLabels.put(l, Integer.valueOf(i.intValue() + 1));
}
labelIsUsed(l);
}
public static void labelIsUsed(Label l) {
if(usedLabels.get(l)==null) {
usedLabels.put(l,l);
}
}
@Override
public void appendInstruction(StringBuilder b) {
if(usedLabels.get(parent)==null) {
return;
}
b.append("\nlabel_");
b.append(parent);
b.append(":\n");
Integer tryCount = tryEndLabels.get(parent);
if(tryCount != null) {
// NOTE: Oct. 19, 2020
// END_TRY() needs to explicitly pass the try block depth
// because sometimes an exception catch handler points
// to *inside* the try/catch block, which will cause the tryBlockLevel
// to be decremented twice when the exception is thrown (once when
// the exception is thrown, and again when it leaves the TRY_CATCH block.
// This happens, for example, inside synchronized blocks for cleaning
// up monitors on exceptions thrown.
int depth = getLabelCatchDepth(parent, null);
b.append("END_TRY(").append(depth).append(");");
} else {
List strs = tryBeginLabels.get(parent);
if(strs != null) {
//b.append(":");
for(int iter = strs.size() - 1; iter >= 0 ; iter--) {
Pair s = strs.get(iter);
b.append(" tryBlockOffset");
b.append(parent);
b.append(s.cls);
b.append(s.counter);
b.append(" = threadStateData->tryBlockOffset;\n");
b.append(" BEGIN_TRY(");
b.append(s.cls);
b.append(", catch_");
b.append(parent);
b.append(s.cls);
b.append(s.counter);
//b.append("); NSLog(@\"Begin try on: %s %d off: %i\\n\", __FILE__, __LINE__, getThreadLocalData()->tryBlockOffset);");
b.append(");\n restoreTo");
b.append(parent);
b.append(s.cls);
b.append(s.counter);
b.append(" = threadStateData->threadObjectStackOffset;\n");
}
b.append("\n");
}
}
}
}
