forked from espruino/Espruino
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfind_common_code.js
More file actions
executable file
·111 lines (94 loc) · 2.89 KB
/
find_common_code.js
File metadata and controls
executable file
·111 lines (94 loc) · 2.89 KB
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
#!/usr/bin/node
/** This scans a source code listing file for Thumb assembly
code instructions that are repeated. It scores them according
to `no_of_instructions * times_repeated` and outputs the top
offenders.
NOT useful for speed-optimised code - only size-optimised with
`-Os`. Maybe certain function calls are always chained and could
be merged together - it should find those and tell you roughly
how many bytes get saved (score * 2)
*/
var IGNORE_REGISTERS = true;
var MIN_OCCURANCES = 3;
var MIN_SCORE = 20;
if (process.argv.length!=3) {
console.error("USAGE: find_common_code espruino_build.lst");
process.exit(1);
}
var lstFile = process.argv[2];
console.log("Loading "+lstFile);
var lst = require("fs").readFileSync(lstFile).toString().split("\n");
function getAssembly(line) {
line = line.trim();
if (line.indexOf("\t")<0) line="";
line = line.substr(line.indexOf("\t")+1);
if (line.indexOf("\t")<0) line="";
line = line.substr(line.indexOf("\t")+1);
if (IGNORE_REGISTERS)
line = line.replace(/r[0-9]/g,"rX");
return line;
}
function scanLines(lst) {
var occurances = {};
var mapCodeToIdx = {};
var mapIdxToCode = [];
var lineUses = [];
var history = [];
console.log("Scanning for use count");
lst.forEach(function(line) {
line = getAssembly(line);
if (line!="") {
var lineIdx = mapCodeToIdx[line];
if (lineIdx===undefined) {
lineIdx = mapCodeToIdx[line] = mapIdxToCode.push(line)-1;
lineUses.push(1);
} else {
lineUses[lineIdx]++;
}
}
});
console.log("Scanning for history");
lst.forEach(function(line) {
line = getAssembly(line);
if (line=="") history = [];
else {
var lineIdx = mapCodeToIdx[line];
if (lineUses[lineIdx]<MIN_OCCURANCES) {
history = [];
} else {
history.push(lineIdx);
for (var l=0;l<history.length-1;l++) {
var text = history.slice(l).join(",");
if (occurances[text]===undefined)
occurances[text]=1;
else
occurances[text]++;
}
}
}
});
console.log("Packing");
var arr = [];
for (var k in occurances) {
if (occurances[k]<MIN_OCCURANCES) continue; // nope
var l = k.split(",").length;
// score is how much we could save if we put it in a function
var score = (l-1)*occurances[k];
if (score < MIN_SCORE) continue; // not worth listing
arr.push([score,occurances[k],l,k]);
}
console.log("Sorting");
arr.sort(function(a,b) {
var ai = a[0];
var bi = b[0];
return (ai==bi)?0:( (ai<bi)?1:-1 );
});
console.log("Repacking");
arr.forEach(function(a) {
var code = [];
a[3].split(",").forEach(function(c) { code.push(mapIdxToCode[c]); });
console.log("Score ------------- "+a[0]+" ("+a[1]+" uses)");
code.forEach(function(s) { console.log(" "+s);});
});
}
scanLines(lst);