Added a break that I meant to include originally, for efficiency. Basically

it keeps it from trying to add the same node to the node set
over and over if it matches multiple given patterns.  Also in cases where there
are a lot of patterns to be matched, and it matches an early one, this
will make the script run slightly faster.  It's more there because it logically
should be, than anything else, I mean, Python is never going to be fast ;-)

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@24876 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/utils/DSAextract.py b/utils/DSAextract.py
index de82b5556b5d60a26f11a19605d8c412e671b394..134e9453fbb5df0277159bf310c23aaa42c9d744 100644 (file)
--- a/utils/DSAextract.py
+++ b/utils/DSAextract.py
@@ -66,6 +66,7 @@ while buffer != '':
                        #for the node (it will be Node(hex number)) to our set of nodes
                        if regexp.search(buffer):
                                node_set |= set([re.split('\s+',buffer,2)[1]])
+                               break
        buffer = input.readline()