1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
#!/usr/bin/env python
import tree
def search(node, verbose=False):
return search_loop(node, {}, verbose)
def search_loop(node, stringMap={}, verbose=False):
if node.type == "constant" and node.get("constantType") == "string":
if verbose:
print " - Found: %s" % node.get("value")
if node.get("detail") == "singlequotes":
quote = "'"
elif node.get("detail") == "doublequotes":
quote = '"'
value = "%s%s%s" % (quote, node.get("value"), quote)
if value in stringMap:
stringMap[value] += 1
else:
stringMap[value] = 1
if check(node, verbose):
for child in node.children:
search_loop(child, stringMap, verbose)
return stringMap
def check(node, verbose=False):
# Needs children
if not node.hasChildren():
return False
# Try to find all output statements
if node.type == "call":
cu = node
nx = cu.getChild("operand", False)
if nx != None:
cu = nx
all = cu.getAllChildrenOfType("identifier")
for ch in all:
if ch.get("name", False) in [ "Error", "debug", "info", "warning", "error", "alert" ]:
if verbose:
print " - Ignore output statement at line: %s" % ch.get("line")
return False
# Try to find all constant assignments (ns.UPPER = string)
elif node.type == "assignment":
left = node.getChild("left", False)
if left != None:
var = left.getChild("variable", False)
if var != None:
last = var.getLastChild()
if last.type == "identifier" and last.get("name").isupper():
if verbose:
print " - Ignore constant assignment at line: %s" % last.get("line")
return False
# Try to find all constant assignments from Maps ({ UPPER : string })
elif node.type == "keyvalue":
if node.get("key").isupper():
if verbose:
print " - Ignore constant key value at line: %s" % node.get("line")
return False
return True
def sort(stringMap):
stringList = []
for value in stringMap:
stringList.append({ "value" : value, "number" : stringMap[value] })
stringList.sort(lambda x, y: y["number"]-x["number"])
return stringList
def replace(node, stringList, var="$", verbose=False):
if node.type == "constant" and node.get("constantType") == "string":
if node.get("detail") == "singlequotes":
quote = "'"
elif node.get("detail") == "doublequotes":
quote = '"'
oldvalue = "%s%s%s" % (quote, node.get("value"), quote)
pos = 0
for item in stringList:
if item["value"] == oldvalue:
newvalue = "%s[%s]" % (var, pos)
if verbose:
print " - Replace: %s => %s" % (oldvalue, newvalue)
line = node.get("line")
# GENERATE IDENTIFIER
newidentifier = tree.Node("identifier")
newidentifier.set("line", line)
childidentifier = tree.Node("identifier")
childidentifier.set("line", line)
childidentifier.set("name", var)
newidentifier.addChild(childidentifier)
# GENERATE KEY
newkey = tree.Node("key")
newkey.set("line", line)
newconstant = tree.Node("constant")
newconstant.set("line", line)
newconstant.set("constantType", "number")
newconstant.set("value", "%s" % pos)
newkey.addChild(newconstant)
# COMBINE CHILDREN
newnode = tree.Node("accessor")
newnode.set("line", line)
newnode.set("optimized", True)
newnode.set("original", oldvalue)
newnode.addChild(newidentifier)
newnode.addChild(newkey)
# REPLACE NODE
node.parent.replaceChild(node, newnode)
break
pos += 1
if check(node, verbose):
for child in node.children:
replace(child, stringList, var, verbose)
def replacement(stringList, var="$"):
repl = "%s=[" % var
for item in stringList:
repl += "%s," % (item["value"])
repl = repl[:-1] + "];"
return repl
|
