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
174
175
176
177
|
/*==========================================================================
make_function_name_parser
-------------------------
Copyright: Joel Yliluoma
This program (make_function_name_parser) is distributed under the terms of
the GNU General Public License (GPL) version 3.
See gpl.txt for the license text.
============================================================================*/
#define FUNCTIONPARSER_SUPPORT_DEBUGGING
#include <set>
#include <iostream>
#include <sstream>
#include <string.h>
#include "fparser.hh"
#include "fpconfig.hh"
#include "extrasrc/fptypes.hh"
#include "../fpoptimizer/opcodename.cc"
#include "../util/cpp_compress.hh"
using namespace FUNCTIONPARSERTYPES;
static void Compile(std::ostream& outStream, const std::string& prefix, size_t length)
{
// if the prefix matches, check what we've got
outStream << "/* prefix " << prefix << " */";
for(size_t a=0; a<FUNC_AMOUNT; ++a)
if(prefix == Functions[a].name
&& length == strlen(Functions[a].name))
{
std::string o = FP_GetOpcodeName(OPCODE(a));
outStream << "return (" << o << "<<16) | 0x";
outStream << std::hex << (0x80000000U | length);
outStream << std::dec << "U;";
outStream << "\n ";
return;
}
size_t n_possible_children = 0;
for(size_t a=0; a<FUNC_AMOUNT; ++a)
{
if(strlen(Functions[a].name) != length) continue;
if(strlen(Functions[a].name) < prefix.size()) continue;
if(prefix == std::string(Functions[a].name, prefix.size()))
++n_possible_children;
}
if(n_possible_children == 1)
{
for(size_t a=0; a<FUNC_AMOUNT; ++a)
{
if(strlen(Functions[a].name) != length) continue;
if(strlen(Functions[a].name) < prefix.size()) continue;
if(prefix == std::string(Functions[a].name, prefix.size()))
{
if(prefix != Functions[a].name)
{
size_t tmpbytes = length - prefix.size();
if(tmpbytes > 2)
{
outStream << "{";
outStream << "static const char tmp[" << tmpbytes << "] = {";
for(size_t b=prefix.size(); b<length; ++b)
{
if(b > prefix.size()) outStream << ',';
outStream << "'" << Functions[a].name[b] << "'";
}
outStream << "};\n ";
}
if(tmpbytes > 2)
outStream << "if(std::memcmp(uptr+" << prefix.size() << ", tmp, " << tmpbytes << ") == 0) ";
else
{
outStream << "if(";
for(size_t b=prefix.size(); b<length; ++b)
{
if(b != prefix.size()) outStream << "\n && ";
outStream << "'" << Functions[a].name[b] << "' == uptr[" << b << "]";
}
outStream << ") ";
}
std::string o = FP_GetOpcodeName(OPCODE(a));
outStream << "return (" << o << "<<16) | 0x";
outStream << std::hex << (0x80000000U | length);
outStream << std::dec << "U;";
outStream << "\n return " << length << ";";
if(tmpbytes > 2) outStream << " }";
outStream << "\n ";
}
}
}
return;
}
std::set<char> possible_children;
for(size_t a=0; a<FUNC_AMOUNT; ++a)
{
if(strlen(Functions[a].name) != length) continue;
if(strlen(Functions[a].name) <= prefix.size()) continue;
if(prefix == std::string(Functions[a].name, prefix.size()))
{
char c = Functions[a].name[prefix.size()];
possible_children.insert(c);
}
}
if(possible_children.empty())
{
outStream << "return " << length << ";\n ";
}
else
{
if(possible_children.size() == 1)
{
for(std::set<char>::const_iterator
i = possible_children.begin();
i != possible_children.end();
++i)
{
outStream << "if('" << *i << "' == uptr[" << prefix.size() << "]) {\n ";
std::string tmp(prefix);
tmp += *i;
Compile(outStream, tmp, length);
outStream << "}";
}
outStream << "return " << length << ";";
}
else
{
outStream << "switch(uptr[" << prefix.size() << "]) {\n ";
for(std::set<char>::const_iterator
i = possible_children.begin();
i != possible_children.end();
++i)
{
outStream << "case '" << *i << "':\n ";
std::string tmp(prefix);
tmp += *i;
Compile(outStream, tmp, length);
}
outStream << "default: return " << length << "; }\n ";
}
}
}
int main()
{
std::ostringstream outStream;
outStream <<
" switch(nameLength)\n"
" {\n ";
std::set<unsigned> lengthSet;
for(size_t a=0; a<FUNC_AMOUNT; ++a)
lengthSet.insert(strlen(Functions[a].name));
for(std::set<unsigned>::iterator
i = lengthSet.begin(); i != lengthSet.end(); ++i)
{
outStream << " case " << *i << ":\n ";
Compile(outStream, "", *i);
outStream << "\n ";
}
outStream <<
" default: break;\n"
" }\n"
" return nameLength;\n";
CPPcompressor Compressor;
//std::cout << outStream.str();
std::cout << Compressor.Compress(outStream.str(), "l");
}
|
