diff options
Diffstat (limited to 'miasm2/core')
| -rw-r--r-- | miasm2/core/asmbloc.py | 2 | ||||
| -rw-r--r-- | miasm2/core/graph.py | 16 | ||||
| -rw-r--r-- | miasm2/core/sembuilder.py | 4 | ||||
| -rw-r--r-- | miasm2/core/utils.py | 6 |
4 files changed, 14 insertions, 14 deletions
diff --git a/miasm2/core/asmbloc.py b/miasm2/core/asmbloc.py index 4d7a197a..dea0577b 100644 --- a/miasm2/core/asmbloc.py +++ b/miasm2/core/asmbloc.py @@ -752,7 +752,7 @@ class AsmCFG(DiGraph): # Helpers @property def pendings(self): - """Dictionnary of label -> set(AsmCFGPending instance) indicating + """Dictionary of label -> set(AsmCFGPending instance) indicating which label are missing in the current instance. A label is missing if a block which is already in nodes has constraints with him (thanks to its .bto) and the corresponding block is not yet in diff --git a/miasm2/core/graph.py b/miasm2/core/graph.py index f49e0da1..f1681078 100644 --- a/miasm2/core/graph.py +++ b/miasm2/core/graph.py @@ -166,14 +166,14 @@ class DiGraph(object): def node_attr(self, node): """ - Returns a dictionnary of the @node's attributes + Returns a dictionary of the @node's attributes @node: a node of the graph """ return {} def edge_attr(self, src, dst): """ - Return a dictionnary of attributes for the edge between @src and @dst + Return a dictionary of attributes for the edge between @src and @dst @src: the source node of the edge @dst: the destination node of the edge """ @@ -340,7 +340,7 @@ class DiGraph(object): The function doesn't return the self reference in dominators. @node: The start node - @gen_dominators: The dictionnary containing at least node's + @gen_dominators: The dictionary containing at least node's dominators/post_dominators @succ_cb: return predecessors/succesors of a node @@ -386,7 +386,7 @@ class DiGraph(object): """Return an iterator of the ordered list of @node's dominators The function doesn't return the self reference in dominators. @node: The start node - @dominators: The dictionnary containing at least node's dominators + @dominators: The dictionary containing at least node's dominators """ return self._walk_generic_dominator(node, dominators, @@ -396,7 +396,7 @@ class DiGraph(object): """Return an iterator of the ordered list of @node's postdominators The function doesn't return the self reference in postdominators. @node: The start node - @postdominators: The dictionnary containing at least node's + @postdominators: The dictionary containing at least node's postdominators """ @@ -771,7 +771,7 @@ class MatchGraph(DiGraph): @candidate: @graph's node @expected: MatchGraphJoker instance @graph: DiGraph instance - @partial_sol: (optional) dictionnary of MatchGraphJoker -> @graph's node + @partial_sol: (optional) dictionary of MatchGraphJoker -> @graph's node standing for a partial solution """ # Avoid having 2 different joker for the same node @@ -845,13 +845,13 @@ class MatchGraph(DiGraph): def match(self, graph): """Naive subgraph matching between graph and self. - Iterator on matching solution, as dictionnary MatchGraphJoker -> @graph + Iterator on matching solution, as dictionary MatchGraphJoker -> @graph @graph: DiGraph instance In order to obtained correct and complete results, @graph must be connected. """ # Partial solution: nodes corrects, edges between these nodes corrects - # A partial solution is a dictionnary MatchGraphJoker -> @graph's node + # A partial solution is a dictionary MatchGraphJoker -> @graph's node todo = list() # Dictionnaries containing partial solution done = list() # Aleady computed partial solutions diff --git a/miasm2/core/sembuilder.py b/miasm2/core/sembuilder.py index 83981919..ce327ce1 100644 --- a/miasm2/core/sembuilder.py +++ b/miasm2/core/sembuilder.py @@ -131,7 +131,7 @@ class SemBuilder(object): def __init__(self, ctx): """Create a SemBuilder - @ctx: context dictionnary used during parsing + @ctx: context dictionary used during parsing """ # Init self.transformer = MiasmTransformer() @@ -144,7 +144,7 @@ class SemBuilder(object): @property def functions(self): - """Return a dictionnary name -> func of parsed functions""" + """Return a dictionary name -> func of parsed functions""" return self._functions.copy() @staticmethod diff --git a/miasm2/core/utils.py b/miasm2/core/utils.py index 30aff7d2..70520c1b 100644 --- a/miasm2/core/utils.py +++ b/miasm2/core/utils.py @@ -53,7 +53,7 @@ def whoami(): class BoundedDict(UserDict.DictMixin): - """Limited in size dictionnary. + """Limited in size dictionary. To reduce combinatory cost, once an upper limit @max_size is reached, @max_size - @min_size elements are suppressed. @@ -65,7 +65,7 @@ class BoundedDict(UserDict.DictMixin): def __init__(self, max_size, min_size=None, initialdata=None, delete_cb=None): """Create a BoundedDict - @max_size: maximum size of the dictionnary + @max_size: maximum size of the dictionary @min_size: (optional) number of most used element to keep when resizing @initialdata: (optional) dict instance with initial data @delete_cb: (optional) callback called when an element is removed @@ -121,7 +121,7 @@ class BoundedDict(UserDict.DictMixin): @property def data(self): - "Return the current instance as a dictionnary" + "Return the current instance as a dictionary" return self._data def __getitem__(self, key): |