Package jadx.core.dex.trycatch

Class TryEdgeScopeGroupMap

java.lang.Object

jadx.core.dex.trycatch.TryEdgeScopeGroupMap

All Implemented Interfaces:

Map<TryEdge,Map<TryEdge,BlockNode>>

public final class TryEdgeScopeGroupMap
extends Object
implements Map<TryEdge,Map<TryEdge,BlockNode>>

A map which stores the information of how try edges correlate with each other. K is a try edge and V contains all other try edges whose who share the same logical scope.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
private static final class	TryEdgeScopeGroupMap.TryEdgeScope

Nested classes/interfaces inherited from interface java.util.Map

Map.Entry<K,V>

Field Summary

Fields

Modifier and Type	Field	Description
private final List<Pair<TryEdge>>	mergedEdges
private final TryCatchBlockAttr	tryCatch
private final Map<TryEdge,Map<TryEdge,BlockNode>>	underlyingMap

Constructor Summary

Constructors

Constructor	Description
TryEdgeScopeGroupMap(MethodNode mth, TryCatchBlockAttr tryCatch, int initialCapacity)

Method Summary

Modifier and Type	Method	Description
void	clear()
boolean	containsKey(Object key)
boolean	containsValue(Object value)
private Map<TryEdge,BlockNode>	createEdgeTerminusMap(Map<TryEdge,BlockNode> edgeStartMap, TryEdge edge, BlockNode edgeStart)
Set<Map.Entry<TryEdge,Map<TryEdge,BlockNode>>>	entrySet()
Map<TryEdge,BlockNode>	get(Object key)
private @Nullable Pair<TryEdge>	getMergedNodeFromEdge(TryEdge edge)
List<Pair<TryEdge>>	getMergedScopes()
Map<BlockNode,List<TryEdge>>	getScopeEnds(MethodNode mth)	Returns a map of all points where edges meet with each other, dictating the end of that edge's scope.
boolean	hasMergedEdges()
boolean	isEmpty()
Set<TryEdge>	keySet()
private Map<TryEdge,BlockNode>	mergeSameScopes(Map<TryEdge,BlockNode> handlers)	If two scopes ever merge, as in if one edge leads to the same execution point as the target of another edge, this function will record it.
void	populateFromEdges(Map<TryEdge,BlockNode> edges)
Map<TryEdge,BlockNode>	put(TryEdge key, Map<TryEdge,BlockNode> value)
void	putAll(Map<? extends TryEdge,? extends Map<TryEdge,BlockNode>> otherMap)
Map<TryEdge,BlockNode>	remove(Object key)
int	size()
Collection<Map<TryEdge,BlockNode>>	values()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.util.Map

compute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, hashCode, merge, putIfAbsent, remove, replace, replace, replaceAll

Field Details

mergedEdges

private final List<Pair<TryEdge>> mergedEdges

tryCatch

private final TryCatchBlockAttr tryCatch

underlyingMap

private final Map<TryEdge,Map<TryEdge,BlockNode>> underlyingMap

Constructor Details

TryEdgeScopeGroupMap

public TryEdgeScopeGroupMap(MethodNode mth,
 TryCatchBlockAttr tryCatch,
 int initialCapacity)

Method Details

clear

public void clear()

Specified by:

clear in interface Map<TryEdge,Map<TryEdge,BlockNode>>

containsKey

public boolean containsKey(Object key)

Specified by:

containsKey in interface Map<TryEdge,Map<TryEdge,BlockNode>>

containsValue

public boolean containsValue(Object value)

Specified by:

containsValue in interface Map<TryEdge,Map<TryEdge,BlockNode>>

entrySet

public Set<Map.Entry<TryEdge,Map<TryEdge,BlockNode>>> entrySet()

Specified by:

entrySet in interface Map<TryEdge,Map<TryEdge,BlockNode>>

get

public Map<TryEdge,BlockNode> get(Object key)

Specified by:

get in interface Map<TryEdge,Map<TryEdge,BlockNode>>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<TryEdge,Map<TryEdge,BlockNode>>

keySet

public Set<TryEdge> keySet()

Specified by:

keySet in interface Map<TryEdge,Map<TryEdge,BlockNode>>

put

public Map<TryEdge,BlockNode> put(TryEdge key,
 Map<TryEdge,BlockNode> value)

Specified by:

put in interface Map<TryEdge,Map<TryEdge,BlockNode>>

putAll

public void putAll(Map<? extends TryEdge,? extends Map<TryEdge,BlockNode>> otherMap)

Specified by:

putAll in interface Map<TryEdge,Map<TryEdge,BlockNode>>

remove

public Map<TryEdge,BlockNode> remove(Object key)

Specified by:

remove in interface Map<TryEdge,Map<TryEdge,BlockNode>>

size

public int size()

Specified by:

size in interface Map<TryEdge,Map<TryEdge,BlockNode>>

values

public Collection<Map<TryEdge,BlockNode>> values()

Specified by:

values in interface Map<TryEdge,Map<TryEdge,BlockNode>>

hasMergedEdges

public boolean hasMergedEdges()

getMergedScopes

public List<Pair<TryEdge>> getMergedScopes()

populateFromEdges

public void populateFromEdges(Map<TryEdge,BlockNode> edges)

getScopeEnds

public Map<BlockNode,List<TryEdge>> getScopeEnds(MethodNode mth)

Returns a map of all points where edges meet with each other, dictating the end of that edge's scope.

getMergedNodeFromEdge

@Nullable
private @Nullable Pair<TryEdge> getMergedNodeFromEdge(TryEdge edge)

createEdgeTerminusMap

private Map<TryEdge,BlockNode> createEdgeTerminusMap(Map<TryEdge,BlockNode> edgeStartMap,
 TryEdge edge,
 BlockNode edgeStart)

mergeSameScopes

private Map<TryEdge,BlockNode> mergeSameScopes(Map<TryEdge,BlockNode> handlers)

If two scopes ever merge, as in if one edge leads to the same execution point as the target of another edge, this function will record it.

Parameters:

handlers -

Returns: