Unnamed: 0 int64 0 305k | body stringlengths 7 52.9k | name stringlengths 1 185 |
|---|---|---|
40,700 | Exprent () { return right; } | getRight |
40,701 | void (Exprent right) { this.right = right; } | setRight |
40,702 | int () { return condType; } | getCondType |
40,703 | void (int condType) { this.condType = condType; } | setCondType |
40,704 | Exprent () { return new ArrayExprent(array.copy(), index.copy(), hardType, bytecode); } | copy |
40,705 | VarType () { VarType exprType = array.getExprType(); if (exprType.equals(VarType.VARTYPE_NULL)) { return hardType.copy(); } else { return exprType.decreaseArrayDim(); } } | getExprType |
40,706 | int () { return array.getExprentUse() & index.getExprentUse() & Exprent.MULTIPLE_USES; } | getExprentUse |
40,707 | CheckTypesResult () { CheckTypesResult result = new CheckTypesResult(); result.addMinTypeExprent(index, VarType.VARTYPE_BYTECHAR); result.addMaxTypeExprent(index, VarType.VARTYPE_INT); return result; } | checkExprTypeBounds |
40,708 | List<Exprent> () { List<Exprent> lst = new ArrayList<>(); lst.add(array); lst.add(index); return lst; } | getAllExprents |
40,709 | TextBuffer (int indent, BytecodeMappingTracer tracer) { TextBuffer res = array.toJava(indent, tracer); if (array.getPrecedence() > getPrecedence()) { // array precedence equals 0 res.enclose("(", ")"); } VarType arrType = array.getExprType(); if (arrType.getArrayDim() == 0) { VarType objArr = VarType.VARTYPE_OBJECT.res... | toJava |
40,710 | void (Exprent oldExpr, Exprent newExpr) { if (oldExpr == array) { array = newExpr; } if (oldExpr == index) { index = newExpr; } } | replaceExprent |
40,711 | boolean (Object o) { if (o == this) return true; if (!(o instanceof ArrayExprent arr)) return false; return Objects.equals(array, arr.getArray()) && Objects.equals(index, arr.getIndex()); } | equals |
40,712 | Exprent () { return array; } | getArray |
40,713 | Exprent () { return index; } | getIndex |
40,714 | List<VarVersionPair> (String className, String descriptor, int parameters) { ClassNode node = DecompilerContext.getClassProcessor().getMapRootClasses().get(className); return node != null ? getSyntheticParametersMask(node, descriptor, parameters) : null; } | getSyntheticParametersMask |
40,715 | List<VarVersionPair> (ClassNode node, String descriptor, int parameters) { List<VarVersionPair> mask = null; ClassWrapper wrapper = node.getWrapper(); if (wrapper != null) { // own class MethodWrapper methodWrapper = wrapper.getMethodWrapper(CodeConstants.INIT_NAME, descriptor); if (methodWrapper == null) { if (Decompi... | getSyntheticParametersMask |
40,716 | void (ControlFlowGraph graph) { CancellationManager cancellationManager = DecompilerContext.getCancellationManager(); List<Range> lstRanges = new ArrayList<>(); // aggregate ranges for (ExceptionRangeCFG range : graph.getExceptions()) { boolean found = false; for (Range arr : lstRanges) { if (arr.handler == range.getHa... | restorePopRanges |
40,717 | void (ControlFlowGraph graph) { Set<BasicBlock> setVisited = new HashSet<>(); for (ExceptionRangeCFG range : graph.getExceptions()) { BasicBlock handler = range.getHandler(); if (setVisited.contains(handler)) { continue; } setVisited.add(handler); BasicBlock emptyblock = new BasicBlock(++graph.last_id); graph.getBlocks... | insertEmptyExceptionHandlerBlocks |
40,718 | void (ControlFlowGraph graph) { List<ExceptionRangeCFG> lstRanges = graph.getExceptions(); for (int i = lstRanges.size() - 1; i >= 0; i--) { ExceptionRangeCFG range = lstRanges.get(i); boolean isEmpty = true; for (BasicBlock block : range.getProtectedRange()) { if (!block.getSeq().isEmpty()) { isEmpty = false; break; }... | removeEmptyRanges |
40,719 | void (final ControlFlowGraph graph) { GenericDominatorEngine engine = new GenericDominatorEngine(new IGraph() { @Override public List<? extends IGraphNode> getReversePostOrderList() { return graph.getReversePostOrder(); } @Override public Set<? extends IGraphNode> getRoots() { return new HashSet<>(Collections.singleton... | removeCircularRanges |
40,720 | List<BasicBlock> (BasicBlock start, ExceptionRangeCFG range, GenericDominatorEngine engine) { List<BasicBlock> lstRes = new ArrayList<>(); LinkedList<BasicBlock> stack = new LinkedList<>(); Set<BasicBlock> setVisited = new HashSet<>(); stack.addFirst(start); while (!stack.isEmpty()) { BasicBlock block = stack.removeFir... | getReachableBlocksRestricted |
40,721 | boolean (ControlFlowGraph graph) { Map<BasicBlock, Set<BasicBlock>> mapRanges = new HashMap<>(); for (ExceptionRangeCFG range : graph.getExceptions()) { mapRanges.computeIfAbsent(range.getHandler(), k -> new HashSet<>()).addAll(range.getProtectedRange()); } for (Entry<BasicBlock, Set<BasicBlock>> ent : mapRanges.entryS... | hasObfuscatedExceptions |
40,722 | boolean (ControlFlowGraph graph) { GenericDominatorEngine engine = new GenericDominatorEngine(new IGraph() { @Override public List<? extends IGraphNode> getReversePostOrderList() { return graph.getReversePostOrder(); } @Override public Set<? extends IGraphNode> getRoots() { return new HashSet<>(Collections.singletonLis... | handleMultipleEntryExceptionRanges |
40,723 | Set<BasicBlock> (ExceptionRangeCFG range) { Set<BasicBlock> setEntries = new HashSet<>(); Set<BasicBlock> setRange = new HashSet<>(range.getProtectedRange()); for (BasicBlock block : range.getProtectedRange()) { Set<BasicBlock> setPreds = new HashSet<>(block.getPredecessors()); setPreds.removeAll(setRange); if (!setPre... | getRangeEntries |
40,724 | boolean (ExceptionRangeCFG range, Set<BasicBlock> setEntries, ControlFlowGraph graph, GenericDominatorEngine engine) { for (BasicBlock entry : setEntries) { List<BasicBlock> lstSubrangeBlocks = getReachableBlocksRestricted(entry, range, engine); if (!lstSubrangeBlocks.isEmpty() && lstSubrangeBlocks.size() < range.getPr... | splitExceptionRange |
40,725 | void (@NotNull ControlFlowGraph graph, @NotNull StructClass cl) { if (!cl.hasRecordPatternSupport()) { return; } Map<BasicBlock, Set<ExceptionRangeCFG>> mapRanges = new HashMap<>(); for (ExceptionRangeCFG range : graph.getExceptions()) { mapRanges.computeIfAbsent(range.getHandler(), k -> new HashSet<>()).add(range); } ... | duplicateMergedCatchBlocks |
40,726 | void (ControlFlowGraph graph, int bytecode_version) { Map<BasicBlock, Set<ExceptionRangeCFG>> mapRanges = new HashMap<>(); for (ExceptionRangeCFG range : graph.getExceptions()) { mapRanges.computeIfAbsent(range.getHandler(), k -> new HashSet<>()).add(range); } for (Entry<BasicBlock, Set<ExceptionRangeCFG>> ent : mapRan... | insertDummyExceptionHandlerBlocks |
40,727 | boolean (Statement statement) { class Node { public final Integer id; public final Set<Node> preds = new HashSet<>(); public final Set<Node> succs = new HashSet<>(); Node(Integer id) { this.id = id; } } HashMap<Integer, Node> mapNodes = new HashMap<>(); // checking exceptions and creating nodes for (Statement stat : st... | isStatementIrreducible |
40,728 | Statement (Statement statement) { Statement candidateForSplitting = null; int sizeCandidateForSplitting = Integer.MAX_VALUE; int succsCandidateForSplitting = Integer.MAX_VALUE; for (Statement stat : statement.getStats()) { Set<Statement> setPreds = stat.getNeighboursSet(EdgeType.REGULAR, EdgeDirection.BACKWARD); if (se... | getCandidateForSplitting |
40,729 | boolean (Statement statement) { Statement splitnode = getCandidateForSplitting(statement); if (splitnode == null) { return false; } StatEdge enteredge = splitnode.getPredecessorEdges(EdgeType.REGULAR).iterator().next(); // copy the smallest statement Statement splitcopy = copyStatement(splitnode, null, new HashMap<>())... | splitIrreducibleNode |
40,730 | int (Statement statement) { int res; if (statement.type == StatementType.BASIC_BLOCK) { res = ((BasicBlockStatement)statement).getBlock().getSeq().length(); } else { res = statement.getStats().stream().mapToInt(IrreducibleCFGDeobfuscator::getStatementSize).sum(); } return res; } | getStatementSize |
40,731 | Statement (Statement from, Statement to, HashMap<Statement, Statement> mapAltToCopies) { if (to == null) { // first outer invocation to = from.getSimpleCopy(); mapAltToCopies.put(from, to); } // copy statements for (Statement st : from.getStats()) { Statement stcopy = st.getSimpleCopy(); to.getStats().addWithKey(stcopy... | copyStatement |
40,732 | void (Statement statement) { statement.initSimpleCopy(); statement.setCopied(true); for (Statement st : statement.getStats()) { st.setParent(statement); initCopiedStatement(st); } } | initCopiedStatement |
40,733 | Deque<StructTypePathEntry> () { return paths; } | getPaths |
40,734 | TypeAnnotation () { return annotation; } | getAnnotation |
40,735 | void (@NotNull StringBuilder sb) { annotation.writeTo(sb); } | writeTo |
40,736 | void (@NotNull TextBuffer sb) { annotation.writeTo(sb); } | writeTo |
40,737 | int () { return (int) paths.stream().filter(entry -> entry.getTypePathEntryKind() == StructTypePathEntry.Kind.ARRAY.getId()).count(); } | arrayPathCount |
40,738 | List<TypeAnnotationWriteHelper> (List<TypeAnnotation> typeAnnotations) { return typeAnnotations.stream() .map(TypeAnnotationWriteHelper::new) .collect(Collectors.toList()); } | create |
40,739 | int () { return targetType; } | getTargetType |
40,740 | TargetInfo () { return targetInfo; } | getTargetInfo |
40,741 | AnnotationExprent () { return annotation; } | getAnnotationExpr |
40,742 | List<StructTypePathEntry> () { return paths; } | getPaths |
40,743 | String () { return getAnnotationExpr().toJava(0, BytecodeMappingTracer.DUMMY).toString(); } | toString |
40,744 | void (@NotNull StringBuilder sb) { sb.append(this); sb.append(' '); } | writeTo |
40,745 | void (@NotNull TextBuffer sb) { sb.append(toString()); sb.append(' '); } | writeTo |
40,746 | List<TypeAnnotation> (StructMember md) { return Arrays.stream(StructGeneralAttribute.TYPE_ANNOTATION_ATTRIBUTES) .flatMap(attrKey -> { StructTypeAnnotationAttribute attribute = (StructTypeAnnotationAttribute)md.getAttribute(attrKey); if (attribute == null) { return Stream.empty(); } else { return attribute.getAnnotatio... | listFrom |
40,747 | boolean (@NotNull Type type) { StructTypePathEntry pathEntry = getPaths().stream().findFirst().orElse(null); if (pathEntry == null && type.getArrayDim() == 0) { return type.isAnnotatable(); } if (pathEntry != null && pathEntry.getTypePathEntryKind() == StructTypePathEntry.Kind.ARRAY.getId() && getPaths().size() == type... | isWrittenBeforeType |
40,748 | int () { return exceptionTableIndex; } | getExceptionTableIndex |
40,749 | List<TypeAnnotation> (List<TypeAnnotation> typeAnnotations) { return typeAnnotations.stream() .filter(typeAnnotation -> typeAnnotation.getTargetInfo() instanceof EmptyTarget) .collect(Collectors.toList()); } | extract |
40,750 | int () { return formalParameterIndex; } | getFormalParameterIndex |
40,751 | List<TypeAnnotation> (List<TypeAnnotation> typeAnnotations) { return typeAnnotations.stream() .filter(typeAnnotation -> typeAnnotation.getTargetInfo() instanceof FormalParameterTarget) .collect(Collectors.toList()); } | extract |
40,752 | List<TypeAnnotation> (List<TypeAnnotation> typeAnnotations, int formalParameterIndex) { return typeAnnotations.stream() .filter(typeAnnotation -> { TargetInfo targetInfo = typeAnnotation.getTargetInfo(); return targetInfo instanceof FormalParameterTarget && ((FormalParameterTarget)targetInfo).getFormalParameterIndex() ... | extract |
40,753 | Offsets[] () { return table; } | getTable |
40,754 | int () { return startPc; } | getStartPc |
40,755 | int () { return length; } | getLength |
40,756 | int () { return index; } | getIndex |
40,757 | int () { return offset; } | getOffset |
40,758 | int () { return supertypeIndex; } | getSupertypeIndex |
40,759 | boolean () { return supertypeIndex == EXTENDS_CLAUSE_INDEX; } | inExtendsClause |
40,760 | List<TypeAnnotation> (List<TypeAnnotation> typeAnnotations, int superTypeIndex) { return typeAnnotations.stream() .filter(typeAnnotation -> { TargetInfo targetInfo = typeAnnotation.getTargetInfo(); return targetInfo instanceof SupertypeTarget && ((SupertypeTarget)targetInfo).getSupertypeIndex() == superTypeIndex; }).co... | extract |
40,761 | List<TypeAnnotation> (List<TypeAnnotation> typeAnnotations) { return typeAnnotations.stream() .filter(typeAnnotation -> { TargetInfo targetInfo = typeAnnotation.getTargetInfo(); return targetInfo instanceof SupertypeTarget && ((SupertypeTarget)targetInfo).inExtendsClause(); }).collect(Collectors.toList()); } | extractExtends |
40,762 | int () { return throwsTypeIndex; } | getThrowsTypeIndex |
40,763 | List<TypeAnnotation> (List<TypeAnnotation> typeAnnotations, int throwsTypeIndex) { return typeAnnotations.stream() .filter(typeAnnotation -> { TargetInfo targetInfo = typeAnnotation.getTargetInfo(); return targetInfo instanceof ThrowsTarget && ((ThrowsTarget)targetInfo).getThrowsTypeIndex() == throwsTypeIndex; }).colle... | extract |
40,764 | int () { return typeParameterIndex; } | getTypeParameterIndex |
40,765 | List<TypeAnnotation> (List<TypeAnnotation> typeAnnotations, int typeParameterIndex) { return typeAnnotations.stream() .filter(typeAnnotation -> { TargetInfo targetInfo = typeAnnotation.getTargetInfo(); return targetInfo instanceof TypeParameterTarget && ((TypeParameterTarget)targetInfo).getTypeParameterIndex() == typeP... | extract |
40,766 | int () { return typeParameterIndex; } | getTypeParameterIndex |
40,767 | int () { return boundIndex; } | getBoundIndex |
40,768 | List<TypeAnnotation> ( List<TypeAnnotation> typeAnnotations, int typeParameterIndex, int boundIndex ) { return typeAnnotations.stream() .filter(typeAnnotation -> { TargetInfo targetInfo = typeAnnotation.getTargetInfo(); return targetInfo instanceof TypeParameterBoundTarget && ((TypeParameterBoundTarget)targetInfo).getT... | extract |
40,769 | int () { return offset; } | getOffset |
40,770 | int () { return typeArgumentIndex; } | getTypeArgumentIndex |
40,771 | void (RootStatement root, StructMethod mt) { CancellationManager cancellationManager = DecompilerContext.getCancellationManager(); FlattenStatementsHelper flatthelper = new FlattenStatementsHelper(); DirectGraph dgraph = flatthelper.buildDirectGraph(root); // try { // DotExporter.toDotFile(dgraph, new File("c:\\Temp\\g... | splitVariables |
40,772 | void (DirectGraph dgraph, HashSet<String> updated) { // try { // DotExporter.toDotFile(dgraph, new File("c:\\Temp\\gr1_my.dot")); // } catch(Exception ex) {ex.printStackTrace();} for (DirectNode node : dgraph.nodes) { // if (node.id.endsWith("_inc")) { // System.out.println(); // // try { // DotExporter.toDotFile(dgrap... | ssaStatements |
40,773 | void (Exprent expr, SFormsFastMapDirect[] varmaparr) { if (expr == null) { return; } VarExprent varassign = null; boolean finished = false; switch (expr.type) { case Exprent.EXPRENT_ASSIGNMENT -> { AssignmentExprent assexpr = (AssignmentExprent)expr; if (assexpr.getCondType() == AssignmentExprent.CONDITION_NONE) { Expr... | processExprent |
40,774 | Integer (Integer var) { Integer nextver = lastversion.get(var); if (nextver == null) { nextver = 1; } else { nextver++; } lastversion.put(var, nextver); return nextver; } | getNextFreeVersion |
40,775 | void (DirectNode node, DirectGraph dgraph) { SFormsFastMapDirect mapNew = new SFormsFastMapDirect(); for (DirectNode pred : node.predecessors) { SFormsFastMapDirect mapOut = getFilteredOutMap(node.id, pred.id, dgraph, node.id); if (mapNew.isEmpty()) { mapNew = mapOut.getCopy(); } else { mergeMaps(mapNew, mapOut); } } i... | mergeInVarMaps |
40,776 | SFormsFastMapDirect (String nodeid, String predid, DirectGraph dgraph, String destid) { SFormsFastMapDirect mapNew = new SFormsFastMapDirect(); if (nodeid.equals(dgraph.mapNegIfBranch.get(predid))) { if (outNegVarVersions.containsKey(predid)) { mapNew = outNegVarVersions.get(predid).getCopy(); } } else if (outVarVersio... | getFilteredOutMap |
40,777 | SFormsFastMapDirect (SFormsFastMapDirect mapTo, SFormsFastMapDirect map2) { if (map2 != null && !map2.isEmpty()) { mapTo.union(map2); } return mapTo; } | mergeMaps |
40,778 | boolean (SFormsFastMapDirect map1, SFormsFastMapDirect map2) { if (map1 == null) { return map2 == null; } else if (map2 == null) { return false; } if (map1.size() != map2.size()) { return false; } for (Entry<Integer, FastSparseSet<Integer>> ent2 : map2.entryList()) { if (!Objects.equals(map1.get(ent2.getKey()), ent2.ge... | mapsEqual |
40,779 | void (SFormsFastMapDirect varmap, Integer var, Integer vers) { FastSparseSet<Integer> set = factory.spawnEmptySet(); set.add(vers); varmap.put(var, set); } | setCurrentVar |
40,780 | void (Statement stat, DirectGraph dgraph, FlattenStatementsHelper flatthelper) { SFormsFastMapDirect map; switch (stat.type) { case CATCH_ALL, TRY_CATCH -> { List<VarExprent> lstVars; if (stat.type == StatementType.CATCH_ALL) { lstVars = ((CatchAllStatement)stat).getVars(); } else { lstVars = ((CatchStatement)stat).get... | setCatchMaps |
40,781 | SFormsFastMapDirect (StructMethod mt) { boolean thisvar = !mt.hasModifier(CodeConstants.ACC_STATIC); MethodDescriptor md = MethodDescriptor.parseDescriptor(mt.getDescriptor()); int paramcount = md.params.length + (thisvar ? 1 : 0); int varindex = 0; SFormsFastMapDirect map = new SFormsFastMapDirect(); for (int i = 0; i... | createFirstMap |
40,782 | String () { return id; } | toString |
40,783 | void (RootStatement root, StructMethod mt) { CancellationManager cancellationManager = DecompilerContext.getCancellationManager(); FlattenStatementsHelper flatthelper = new FlattenStatementsHelper(); DirectGraph dgraph = flatthelper.buildDirectGraph(root); HashSet<Integer> setInit = new HashSet<>(); for (int i = 0; i <... | splitVariables |
40,784 | void (DirectGraph dgraph, HashSet<String> updated, boolean calcLiveVars) { CancellationManager cancellationManager = DecompilerContext.getCancellationManager(); for (DirectNode node : dgraph.nodes) { updated.remove(node.id); mergeInVarMaps(node, dgraph); SFormsFastMapDirect varmap = new SFormsFastMapDirect(inVarVersion... | ssaStatements |
40,785 | void (Exprent expr, SFormsFastMapDirect[] varmaparr, Statement stat, boolean calcLiveVars) { if (expr == null) { return; } VarExprent varassign = null; boolean finished = false; switch (expr.type) { case Exprent.EXPRENT_ASSIGNMENT -> { AssignmentExprent assexpr = (AssignmentExprent)expr; if (assexpr.getCondType() == As... | processExprent |
40,786 | void (VarVersionPair phivar, FastSparseSet<Integer> vers, Statement stat) { FastSparseSet<Integer> versCopy = vers.getCopy(); // take into account the corresponding mm/pp node if existing int ppvers = phantomppnodes.containsKey(phivar) ? phantomppnodes.get(phivar).version : -1; // ssu graph VarVersionNode phinode = ssu... | createOrUpdatePhiNode |
40,787 | void (VarVersionPair varpaar, SFormsFastMapDirect varmap) { VBStyleCollection<VarVersionNode, VarVersionPair> nodes = ssuversions.nodes; VarVersionNode node = nodes.getWithKey(varpaar); node.live = new SFormsFastMapDirect(varmap); } | varMapToGraph |
40,788 | Integer (Integer var, Statement stat) { Integer nextver = lastversion.get(var); if (nextver == null) { nextver = 1; } else { nextver++; } lastversion.put(var, nextver); // save the first protected range, containing current statement if (stat != null) { // null iff phantom version Integer firstRangeId = getFirstProtecte... | getNextFreeVersion |
40,789 | void (DirectNode node, DirectGraph dgraph) { SFormsFastMapDirect mapNew = new SFormsFastMapDirect(); for (DirectNode pred : node.predecessors) { SFormsFastMapDirect mapOut = getFilteredOutMap(node.id, pred.id, dgraph, node.id); if (mapNew.isEmpty()) { mapNew = mapOut.getCopy(); } else { mergeMaps(mapNew, mapOut); } } i... | mergeInVarMaps |
40,790 | SFormsFastMapDirect (String nodeid, String predid, DirectGraph dgraph, String destid) { SFormsFastMapDirect mapNew = new SFormsFastMapDirect(); boolean isFinallyExit = dgraph.mapShortRangeFinallyPaths.containsKey(predid); if (nodeid.equals(dgraph.mapNegIfBranch.get(predid))) { if (outNegVarVersions.containsKey(predid))... | getFilteredOutMap |
40,791 | SFormsFastMapDirect (SFormsFastMapDirect mapTo, SFormsFastMapDirect map2) { if (map2 != null && !map2.isEmpty()) { mapTo.union(map2); } return mapTo; } | mergeMaps |
40,792 | boolean (SFormsFastMapDirect map1, SFormsFastMapDirect map2) { if (map1 == null) { return map2 == null; } else if (map2 == null) { return false; } if (map1.size() != map2.size()) { return false; } for (Entry<Integer, FastSparseSet<Integer>> ent2 : map2.entryList()) { if (!Objects.equals(map1.get(ent2.getKey()), ent2.ge... | mapsEqual |
40,793 | void (SFormsFastMapDirect varmap, Integer var, Integer vers) { FastSparseSet<Integer> set = factory.spawnEmptySet(); set.add(vers); varmap.put(var, set); } | setCurrentVar |
40,794 | void (Statement stat, DirectGraph dgraph, FlattenStatementsHelper flatthelper) { SFormsFastMapDirect map; switch (stat.type) { case CATCH_ALL, TRY_CATCH -> { List<VarExprent> lstVars; if (stat.type == StatementType.CATCH_ALL) { lstVars = ((CatchAllStatement)stat).getVars(); } else { lstVars = ((CatchStatement)stat).get... | setCatchMaps |
40,795 | SFormsFastMapDirect (StructMethod mt, RootStatement root) { boolean thisvar = !mt.hasModifier(CodeConstants.ACC_STATIC); MethodDescriptor md = MethodDescriptor.parseDescriptor(mt.getDescriptor()); int paramcount = md.params.length + (thisvar ? 1 : 0); int varindex = 0; SFormsFastMapDirect map = new SFormsFastMapDirect(... | createFirstMap |
40,796 | Integer (Statement stat) { while (true) { Statement parent = stat.getParent(); if (parent == null) { break; } if (parent.type == StatementType.CATCH_ALL || parent.type == StatementType.TRY_CATCH) { if (parent.getFirst() == stat) { return parent.id; } } else if (parent.type == StatementType.SYNCHRONIZED) { if (((Synchro... | getFirstProtectedRange |
40,797 | VarVersionsGraph () { return ssuversions; } | getSsuversions |
40,798 | SFormsFastMapDirect (VarVersionPair varpaar) { VarVersionNode node = ssuversions.nodes.getWithKey(varpaar); if (node != null) { return node.live; } return null; } | getLiveVarVersionsMap |
40,799 | DirectGraph (RootStatement root) { this.root = root; graph = new DirectGraph(); flattenStatement(); // dummy exit node Statement dummyexit = root.getDummyExit(); DirectNode node = new DirectNode(DirectNodeType.DIRECT, dummyexit, Integer.toString(dummyexit.id)); node.exprents = new ArrayList<>(); graph.nodes.addWithKey(... | buildDirectGraph |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.