Java 类gnu.trove.map.hash.TObjectIntHashMap 实例源码

项目：apkfile 文件：DexMethod.java

private static TObjectIntMap<String> buildAccessors(int accessFlags) {
    TObjectIntMap<String> map = new TObjectIntHashMap<>();
    map.put("public", Modifier.isPublic(accessFlags) ? 1 : 0);
    map.put("protected", Modifier.isProtected(accessFlags) ? 1 : 0);
    map.put("private", Modifier.isPrivate(accessFlags) ? 1 : 0);
    map.put("final", Modifier.isFinal(accessFlags) ? 1 : 0);
    map.put("interface", Modifier.isInterface(accessFlags) ? 1 : 0);
    map.put("native", Modifier.isNative(accessFlags) ? 1 : 0);
    map.put("static", Modifier.isStatic(accessFlags) ? 1 : 0);
    map.put("strict", Modifier.isStrict(accessFlags) ? 1 : 0);
    map.put("synchronized", Modifier.isSynchronized(accessFlags) ? 1 : 0);
    map.put("transient", Modifier.isTransient(accessFlags) ? 1 : 0);
    map.put("volatile", Modifier.isVolatile(accessFlags) ? 1 : 0);
    map.put("abstract", Modifier.isAbstract(accessFlags) ? 1 : 0);
    return map;
}

项目：apkfile 文件：DexClass.java

private static TObjectIntMap<String> buildAccessors(int accessFlags) {
    TObjectIntMap<String> map = new TObjectIntHashMap<>();
    map.put("public", Modifier.isPublic(accessFlags) ? 1 : 0);
    map.put("protected", Modifier.isProtected(accessFlags) ? 1 : 0);
    map.put("private", Modifier.isPrivate(accessFlags) ? 1 : 0);
    map.put("final", Modifier.isFinal(accessFlags) ? 1 : 0);
    map.put("interface", Modifier.isInterface(accessFlags) ? 1 : 0);
    map.put("native", Modifier.isNative(accessFlags) ? 1 : 0);
    map.put("static", Modifier.isStatic(accessFlags) ? 1 : 0);
    map.put("strict", Modifier.isStrict(accessFlags) ? 1 : 0);
    map.put("synchronized", Modifier.isSynchronized(accessFlags) ? 1 : 0);
    map.put("transient", Modifier.isTransient(accessFlags) ? 1 : 0);
    map.put("volatile", Modifier.isVolatile(accessFlags) ? 1 : 0);
    map.put("abstract", Modifier.isAbstract(accessFlags) ? 1 : 0);
    return map;
}

项目：xcc 文件：SubtargetEmitter.java

/**
 * Gathers and enumerates all the itinerary classes.
 * Returns itinerary class count.
 * @param os
 * @param itinClassesMap
 * @return
 */
private int collectAllItinClasses(PrintStream os, TObjectIntHashMap<String> itinClassesMap)
        throws Exception
{
    ArrayList<Record> itinClassList = records.getAllDerivedDefinition("InstrItinClass");

    itinClassList.sort(LessRecord);

    // for each itinenary class.
    int n = itinClassList.size();
    for (int i = 0; i < n; i++)
    {
        Record itinClass = itinClassList.get(i);
        itinClassesMap.put(itinClass.getName(), i);
    }

    return n;
}

项目：xcc 文件：SubtargetEmitter.java

/**
 * Emits all stages and itineries, folding common patterns.
 * @param os
 */
private void emitData(PrintStream os) throws Exception
{
    TObjectIntHashMap<String> itinClassesMap = new TObjectIntHashMap<>();
    ArrayList<ArrayList<InstrItinerary>> procList = new ArrayList<>();

    // Enumerate all the itinerary classes
    int nitinCLasses = collectAllItinClasses(os, itinClassesMap);
    // Make sure the rest is worth the effort
    hasItrineraries = nitinCLasses != 1;

    if (hasItrineraries)
    {
        // Emit the stage data
        emitStageAndOperandCycleData(os, nitinCLasses, itinClassesMap, procList);
        // Emit the processor itinerary data
        emitProcessorData(os, procList);
        // Emit the processor lookup data
        emitProcessorLookup(os);
    }
}

项目：xcc 文件：CodeGenDAGPatterns.java

private void findDepVarsOf(TreePatternNode node, TObjectIntHashMap<String> depMap)
{
    if (node.isLeaf())
    {
        if (node.getLeafValue() instanceof DefInit)
        {
            if (depMap.containsKey(node.getName()))
                depMap.put(node.getName(), depMap.get(node.getName()) + 1);
            else
                depMap.put(node.getName(), 1);
        }
    }
    else
    {
        for (int i = 0, e = node.getNumChildren(); i != e; i++)
            findDepVarsOf(node.getChild(i), depMap);
    }
}

项目：xcc 文件：PromoteMemToReg.java

public PromoteMemToReg(ArrayList<AllocaInst> allocas,
           DomTree dt,
           DominanceFrontier df,
           AliasSetTracker ast)
{
    this.allocas = allocas;
    this.dt = dt;
    this.df = df;
    this.ast = ast;
    allocaLookup = new TObjectIntHashMap<>();
    newPhiNodes = new HashMap<>();
    visitedBlocks = new HashSet<>();
    bbNumbers = new TObjectIntHashMap<>();
    phiToAllocaMap = new TObjectIntHashMap<>();
    pointerAllocaValues = new ArrayList<>();
}

项目：xcc 文件：RegAllocSimple.java

/**
 * This method must be overridded by concrete subclass for performing
 * desired machine code transformation or analysis.
 *
 * @param mf
 * @return
 */
@Override
public boolean runOnMachineFunction(MachineFunction mf)
{
    this.mf = mf;
    tm = mf.getTarget();
    regInfo = tm.getRegisterInfo();
    instrInfo = tm.getInstrInfo();

    stackSlotForVirReg = new TIntIntHashMap();
    regUsed = new BitMap();
    regClassIdx = new TObjectIntHashMap<>();

    for (MachineBasicBlock mbb : mf.getBasicBlocks())
        allocateBasicBlock(mbb);

    stackSlotForVirReg.clear();
    return true;
}