misc: merge branch 'release-staging-v19.0.0.0' into develop
[gem5.git] / util / minorview / parse.py
1 # Copyright (c) 2013 ARM Limited
2 # All rights reserved
3 #
4 # The license below extends only to copyright in the software and shall
5 # not be construed as granting a license to any other intellectual
6 # property including but not limited to intellectual property relating
7 # to a hardware implementation of the functionality of the software
8 # licensed hereunder. You may use the software subject to the license
9 # terms below provided that you ensure that this notice is replicated
10 # unmodified and in its entirety in all distributions of the software,
11 # modified or unmodified, in source code or in binary form.
12 #
13 # Redistribution and use in source and binary forms, with or without
14 # modification, are permitted provided that the following conditions are
15 # met: redistributions of source code must retain the above copyright
16 # notice, this list of conditions and the following disclaimer;
17 # redistributions in binary form must reproduce the above copyright
18 # notice, this list of conditions and the following disclaimer in the
19 # documentation and/or other materials provided with the distribution;
20 # neither the name of the copyright holders nor the names of its
21 # contributors may be used to endorse or promote products derived from
22 # this software without specific prior written permission.
23 #
24 # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
25 # "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
26 # LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
27 # A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
28 # OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
29 # SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
30 # LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
31 # DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
32 # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
33 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
34 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35
36 import re
37
38 def list_parser(names):
39 """Parse a list of elements, some of which might be one-level sublists
40 within parentheses, into a a list of lists of those elements. For
41 example: list_parser('(a,b),c') -> [['a', 'b'], 'c']"""
42 elems = re.split(',', names)
43 ret = []
44 accum = []
45 for elem in elems:
46 if re.search('^\((.*)\)$', elem):
47 accum.append(re.sub('^\((.*)\)', '\\1', elem))
48 ret.append(accum)
49 accum = []
50 elif re.search('^\(', elem):
51 accum.append(re.sub('^\(', '', elem))
52 elif re.search('\)$', elem):
53 accum.append(re.sub('\)$', '', elem))
54 ret.append(accum)
55 accum = []
56 elif len(accum) != 0:
57 accum.append(elem)
58 else:
59 ret.append([elem])
60
61 if len(accum) > 0:
62 print 'Non matching brackets in', names
63
64 return ret
65
66 def map2(f, ls):
67 """map to a depth of 2. That is, given a list of lists, apply
68 f to those innermost elements """
69 return map(lambda l: map(f, l), ls)
70
71 def remove_trailing_ws(line):
72 return re.sub('\s*$', '', line)
73
74 def remove_leading_and_trailing_ws(line):
75 return re.sub('\s*$', '', re.sub('^\s*', '', line))
76
77 def parse_pairs_list(pairString):
78 """parse a string like 'name=value name2=value2' into a
79 list of pairs of ('name', 'value') ..."""
80 ret = []
81 pairs = re.finditer('(\w+)(=("[^"]*"|[^\s]*))?', pairString)
82 for pair in pairs:
83 name, rest, value = pair.groups()
84 if value is not None:
85 value = re.sub('^"(.*)"$', '\\1', value)
86 ret.append((name, value))
87 else:
88 ret.append((name, ''))
89 return ret
90
91 def parse_indexed_list(string):
92 """parse a string of the form "(index,value),(index,value)..."
93 into a list of index, value pairs"""
94
95 ret = []
96 pairs = list_parser(string)
97 for pair in pairs:
98 if len(pair) == 2:
99 index, value = pair
100 ret.append((int(index), value))
101
102 return ret
103
104 def parse_pairs(pairString):
105 """parse a string like 'name=value name2=value2' into a
106 dictionary of {'name': 'value', 'name2': 'value2'} """
107 return dict(parse_pairs_list(pairString))