-
Notifications
You must be signed in to change notification settings - Fork 14
/
Copy pathparser.yy
886 lines (741 loc) · 40.2 KB
/
parser.yy
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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
/*
* See the dyninst/COPYRIGHT file for copyright information.
*
* We provide the Paradyn Tools (below described as "Paradyn")
* on an AS IS basis, and do not warrant its validity or performance.
* We reserve the right to update, modify, or discontinue this
* software at any time. We shall have no obligation to supply such
* updates or modifications or any other form of support to you.
*
* By your use of Paradyn, you understand and agree that we (or any
* other person or entity with proprietary rights in Paradyn) are
* under no obligation to provide either maintenance services,
* update services, notices of latent defects, or correction of
* defects for Paradyn.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
%{
#include <iostream>
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <string>
#include <vector>
#include <sstream>
#include <stdint.h>
#include "scanner.h"
using namespace std;
#define STR(s) new string(s)
#define ARGS_VEC(arglist...) vector<string> args = {arglist}
#define DEL_VEC(arglist...) vector<string *> del = {arglist}
#define DEL_VEC_ADD(arg) del.push_back(arg)
bool foundNewSymbol = false;
vector<string> newSymbols;
vector<string> symbols;
void getBitMaskParts(string in, string &var, string &start, string &end) {
size_t lbar = in.find("|"), rbar = in.find("|", lbar + 1);
var = in.substr(0, lbar);
end = in.substr(lbar + 1, rbar - lbar - 1);
start = in.substr(rbar + 1);
}
void parseBitPos(string bmask, string repltarg, string &res) {
string var, start, end;
getBitMaskParts(bmask, var, start, end);
stringstream top, bottom;
bottom<<((start != "0")?("ops->extract(" + var + ", 0, " + start + ")"):var);
top<<"ops->extract("<<var<<", "<<end<<" + 1, "<<var<<"->get_width())";
stringstream ret, mid;
ret<<var<<" = ";
mid<<"ops->or_(ops->shiftLeft("<<repltarg<<", ops->number_(32, "<<start<<")), ";
mid<<" ops->shiftLeft("<<top.str()<<", ops->number_(32, "<<end<<" + 1)))";
if(bottom.str()== var)
{
ret<<mid.str()<<";";
}
else
{
ret<<"ops->or_("<<bottom.str()<<", "<<mid.str()<<");";
}
res = ret.str();
}
void delArgs(vector<string *> del) {
for(int i = 0; i < del.size(); i++)
delete del[i];
}
string makeStr(vector<string> &args, vector<string *> *del) {
int len = 0;
for(int i = 0; i < args.size(); i++)
len += args[i].size();
string ret;
ret.reserve(len);
for(int i = 0; i < args.size(); i++)
ret += args[i];
if(del != NULL)
delArgs(*del);
return ret;
}
string *makeProgramBlock(string *arg1, string *arg2) {
stringstream out;
out<<"";
if(foundNewSymbol)
{
for(vector<string>::iterator i = newSymbols.begin(); i != newSymbols.end(); i++)
{
if(Dyninst_aarch64::Scanner::newSymbolType.count(*i))
{
out<<Dyninst_aarch64::Scanner::newSymbolType[*i]<<" "<<*i;
if(Dyninst_aarch64::Scanner::newSymbolVal.count(*i))
out<<" = "<<Dyninst_aarch64::Scanner::newSymbolVal[*i];
out<<";\n";
}
}
foundNewSymbol = false;
newSymbols.clear();
}
ARGS_VEC(out.str(), *arg1, *arg2);
DEL_VEC(arg1, arg2);
return STR(makeStr(args, &del));
}
string makeDeclCondAsnmt(string in) {
size_t equalPos = in.find("=");
string id = in.substr(0, equalPos - 1);
string rem = in.substr(equalPos + 2);
size_t ifend = rem.find("\n");
size_t condend = rem.find("\n", ifend + 1);
size_t st1end = rem.find("\n", condend + 1);
string cond = rem.substr(ifend + 1, condend - ifend - 1);
string st1 = rem.substr(condend + 1, st1end - condend - 1);
string st2 = rem.substr(st1end + 1);
stringstream val;
val<<id<<";\n";
val<<"if ("<<cond<<")\n";
val<<id<<" = "<<st1<<";\nelse\n";
val<<id<<" = "<<st2;
return val.str();
}
string pruneCond(string cond_str) {
int nextpos = 1, prevpos = 0;
string curblock = "";
int stmtcnt;
while(nextpos < cond_str.length() && (nextpos = cond_str.find("\n", nextpos)) != string::npos) {
string cur = cond_str.substr(prevpos, nextpos - prevpos);
curblock += cur + "\n";
if(cur == "{")
stmtcnt = 0;
else if(cur == "}")
{
if(stmtcnt > 0)
return cond_str;
curblock = "";
}
else if((cur.find("if") == string::npos || cur[cur.find("if") + 1] != ' ') && cur.find("else") == string::npos)
stmtcnt++;
prevpos = nextpos + 1;
nextpos++;
}
return "";
}
void addSymbolMaybe(string str) {
str = str.substr(0, str.find(";"));
string varname = str;
if(str.find("=") != string::npos)
{
size_t fspace = str.find(" ");
varname = str.substr(0, fspace);
}
size_t commapos;
if((commapos = varname.find(",")) == string::npos)
{
if(find(symbols.begin(), symbols.end(), varname) == symbols.end())
symbols.push_back(varname);
}
else
{
vector<string> vars;
size_t prevpos = 0;
while(commapos != string::npos)
{
vars.push_back(varname.substr(prevpos, commapos - prevpos));
prevpos = commapos + 1;
commapos = varname.find(",", prevpos);
}
vars.push_back(varname.substr(prevpos));
for(vector<string>::iterator itr = vars.begin(); itr != vars.end(); itr++)
if(find(symbols.begin(), symbols.end(), *itr) == symbols.end())
symbols.push_back(*itr);
}
}
bool isInt(string s) {
for(int idx = 0; idx < s.length(); idx++)
if(!isdigit(s[idx]))
return false;
return true;
}
bool haswback = false;
%}
%require "2.3"
%defines
%error-verbose
%skeleton "lalr1.cc"
%name-prefix="Dyninst_aarch64"
%define "parser_class_name" "Parser"
%locations
%initial-action
{
@$.begin.filename = @$.end.filename;
};
%parse-param { class Driver& driver }
%union {
int intVal;
std::string* strVal;
}
%token END 0 "end of file"
%token <strVal> DTYPE
%token <strVal> INSN_START
%token INSN_END
%token <strVal> OPERAND
%token COND_IF
%token COND_THEN
%token COND_ELSE
%token COND_ELSIF
%token COND_END
%token SWITCH_CASE
%token SWITCH_WHEN
%token SWITCH_OF
%token <strVal> OPER
%token <strVal> REG
%token <intVal> NUM
%token <strVal> BOOLVAL
%token <strVal> IDENTIFIER
%token SYMBOL_OPENROUNDED
%token SYMBOL_OPENSQUARE
%token SYMBOL_CLOSEROUNDED
%token SYMBOL_CLOSESQUARE
%token SYMBOL_LT
%token SYMBOL_GT
%token SYMBOL_EQUAL
%token SYMBOL_COMMA
%token SYMBOL_COLON
%token READ_PC
%token <strVal> SET_NZCV
%token SET_LR
%token FLAG_CARRY
%token IGNORE
%token UNKNOWN
%token MEMORY
%type <strVal> program datatype varname targ expr funccall args condblock decl cond asnmt bitmask blockdata srcreg bmaskend bmasksrc
%type <strVal> bitpos declblock switch whenblocks whenblock condshalf condterm condelsif asnmtsrc blockcode deccondsrc bmaskstart memory
%{
#include "scanner.h"
#include "driver.h"
#undef yylex
#define yylex driver.scanner->lex
%}
%%
insn: INSN_START program INSN_END {
cout<<"struct IP_"<<*$1<<": P {\nvoid p(D d, Ops ops, I insn, A args, B raw) {\n";
cout<<*$2;
cout<<"\n}\n};\n";
delete $1;
delete $2;
symbols.clear();
newSymbols.clear();
}
;
program: program decl { $$ = makeProgramBlock($1, $2); } |
program asnmt { $$ = makeProgramBlock($1, $2); } |
program funccall {
string *str = new string((*$2) + ";");
delete $2;
$$ = makeProgramBlock($1, str);
} |
program cond { $$ = makeProgramBlock($1, $2); } |
program switch { $$ = makeProgramBlock($1, $2); } |
{ $$ = STR(""); }
;
decl: OPERAND {
size_t spacepos = (*$1).find(" ");
addSymbolMaybe((*$1).substr(spacepos + 1));
$$ = $1;
} |
READ_PC { $$ = STR("BaseSemantics::SValuePtr base = d->readRegister(d->REG_PC);\n"); } |
SET_LR { $$ = STR("if(EXTR(31, 31) == 1)\nd->writeRegister(d->findRegister(\"x30\", 64), ops->add(d->readRegister(d->REG_PC), ops->number_(32, 4)));\n"); } |
datatype declblock {
if($2 != NULL)
{
addSymbolMaybe(*$2);
string dtype = *$1;
if((*$2).find("carry_in") != string::npos)
dtype = "bool";
else if(dtype == "int" && (*$2).find("result") != string::npos)
dtype = "BaseSemantics::SValuePtr";
ARGS_VEC(dtype, " ", *$2);
DEL_VEC($1, $2);
$$ = STR(makeStr(args, &del));
}
else
{
$$ = STR("");
}
}
;
deccondsrc: funccall { $$ = $1; } |
srcreg { $$ = $1; } |
varname { $$ = $1; }
;
datatype: DTYPE { $$ = $1; }
;
declblock: varname {
DEL_VEC($1);
ARGS_VEC((*$1 == "nzcv")?"n,z,c,v":(*$1), ";\n");
$$ = STR(makeStr(args, &del));
} |
asnmt {
if($1 != NULL)
{
string ret = *$1;
if(ret.find("if\n") != string::npos)
{
$$ = STR(makeDeclCondAsnmt(ret));
}
else
$$ = $1;
}
else
$$ = NULL;
}
;
varname: IDENTIFIER {
if((*$1) == "wback")
haswback = true;
if(Scanner::newSymbolType.count(*$1) == 0 && Scanner::operandExtractorMap.find(*$1) != Scanner::operandExtractorMap.end())
$$ = STR(Scanner::operandExtractorMap[*$1]);
else
$$ = STR(*$1);
delete $1;
}
;
asnmt: targ SYMBOL_EQUAL asnmtsrc {
DEL_VEC($1, $3);
if((*$1) == "carry_in")
{
ARGS_VEC(*$1, " = ", ((*$3) == "1"?"true":"false"), ";\n");
$$ = STR(makeStr(args, &del));
}
else if((*$1).find("writeMemory") != string::npos)
{
ARGS_VEC(*$1, *$3, ");\n");
$$ = STR(makeStr(args, &del));
}
else if((*$1).find("write") != string::npos)
{
ARGS_VEC((*$1).substr(0, (*$1).length() - 1), ", ", *$3, ");\n");
$$ = STR(makeStr(args, &del));
}
//We ignore declaration of 'offset', since it is anyway encoded in the instruction representation
else if((*$1) == "offset")
{
$$ = NULL;
}
else
{
ARGS_VEC(((*$1) != "null"?((*$1) + " = "):""), *$3, ";\n");
$$ = STR(makeStr(args, &del));
}
} |
bitmask SYMBOL_EQUAL bmasksrc {
string res;
parseBitPos(*$1, *$3, res);
ARGS_VEC(res, "\n");
DEL_VEC($1, $3);
$$ = STR(makeStr(args, &del));
} |
SET_NZCV {
stringstream ret;
char flags[] = {'n', 'z', 'c', 'v'};
string srcval = *$1;
delete $1;
if(srcval == "nzcv")
{
for(int idx = 0; idx < sizeof(flags)/sizeof(char); idx++)
ret<<"d->writeRegister(d->REG_"<<(char)(flags[idx] - 32)<<", "<<flags[idx]<<");\n";
}
else
{
ret<<"d->writeRegister(d->REG_N, ops->extract(result, result->get_width() - 1, result->get_width()));\n";
ret<<"d->writeRegister(d->REG_Z, d->isZero(result));\n";
ret<<"d->writeRegister(d->REG_C, ops->number_(1, 0));\n";
ret<<"d->writeRegister(d->REG_V, ops->number_(1, 0));\n";
}
$$ = STR(ret.str());
}
;
bmasksrc: funccall { $$ = $1; } |
OPERAND { $$ = $1; }
;
targ: varname { $$ = $1; } |
SYMBOL_OPENROUNDED varname SYMBOL_COMMA varname SYMBOL_CLOSEROUNDED { $$ = $2; } |
REG {
DEL_VEC($1);
string regstr = "";
switch((*$1)[0])
{
case 't': {
string argnum = ((*$1).length() == 2 && (*$1)[1] == '2')?"1":"0";
regstr += "d->write(args[" + argnum + "])";
}
break;
case 'd':regstr += "d->write(args[0])";
break;
case 'n':{
if(!haswback)
regstr += "d->write(args[1])";
else
regstr += "d->write(d->getWriteBackTarget(args[1]))";
}
break;
case 's':regstr += "d->writeRegister(d->REG_SP)";
break;
default: assert("appears to be an invalid destination register.");
}
delArgs(del);
$$ = STR(regstr);
} |
memory {
string out = "d->writeMemory(" + *$1 + ", ";
delete $1;
$$ = STR(out);
}
;
asnmtsrc: expr { $$ = $1; } |
DTYPE UNKNOWN { $$ = STR("ops->unspecified_(1)"); } |
COND_IF expr COND_THEN deccondsrc COND_ELSE deccondsrc {
DEL_VEC($2, $4, $6);
$$ = STR(string("if\n" + *$2 + "\n" + *$4 + "\n" + *$6));
delArgs(del);
} |
srcreg { $$ = $1; } |
memory {
string out = "d->readMemory(" + *$1 + ")";
delete $1;
$$ = STR(out);
} |
bitmask { string in(*$1), var, start, end;
getBitMaskParts(in, var, start, end);
stringstream out;
out<<"ops->extract("<<var<<", "<<start<<", "<<end<<" + 1)";
$$ = STR(out.str());
}
;
memory: MEMORY SYMBOL_OPENSQUARE args SYMBOL_CLOSESQUARE {
vector<string> params;
string argsstr(*$3);
size_t startpos = 0, nextcompos = argsstr.find(",", startpos);
while(nextcompos != string::npos)
{
params.push_back(argsstr.substr(startpos, nextcompos - startpos));
startpos = nextcompos + 1;
nextcompos = argsstr.find(",", startpos);
}
params.push_back(argsstr.substr(startpos));
params.pop_back();
string firstparam = params[0];
size_t pluspos;
if((pluspos = firstparam.find("+")) != string::npos)
{
string lhs = firstparam.substr(0, pluspos);
string rhs = firstparam.substr(pluspos + 1);
params[0] = "ops->add(" + lhs + ", ops->number_(32, " + rhs + "))";
}
stringstream out;
for(int idx = 0; idx < params.size(); idx++)
{
out<<params[idx];
if(idx != params.size() - 1)
out<<",";
}
delete $3;
$$ = STR(out.str());
}
;
srcreg: REG {
DEL_VEC($1);
map<string, string> reglettermap = {{"d", "0"}, {"t", "0"}, {"t2", "1"}, {"n", "1"}, {"m", "2"}, {"a", "3"}};
string regstr = "d->read(args[";
if(reglettermap.count(*$1) > 0)
regstr += reglettermap[*$1] + "])";
else
assert("appears to be an invalid source register.");
delArgs(del);
$$ = STR(regstr);
}
;
bitmask: varname SYMBOL_LT bmaskend SYMBOL_COLON bmaskstart SYMBOL_GT {
stringstream out;
out<<*$1<<"|"<<*$3<<"|"<<*$5;
DEL_VEC($1, $3, $5);
delArgs(del);
$$ = STR(out.str());
}
;
bmaskend: NUM {
stringstream out;
out<<$1;
$$ = STR(out.str());
} |
varname OPER NUM {
stringstream out;
out<<*$1<<*$2<<$3;
delete $1;
$$ = STR(out.str());
}
;
bmaskstart: NUM {
stringstream out;
out<<$1;
$$ = STR(out.str());
} |
varname { $$ = $1; }
;
expr: NUM {
stringstream out;
//out<<"ops->number_(32, "<<$1<<")";
out<<$1;
$$ = STR(out.str());
} |
SYMBOL_OPENROUNDED expr SYMBOL_CLOSEROUNDED { $$ = $2; } |
funccall { $$ = $1; } |
varname { $$ = $1; } |
bitpos { $$ = $1; } |
expr OPER expr {
DEL_VEC($1, $2, $3);
map<string, string> logicalFuncs = {{"AND", "and_"}, {"OR", "or_"}, {"EOR", "xor_"}, {"MOD", "unsignedModulo"}};
map<string, string> arithFuncs = {{"+", "add"}, {"*", "unsignedMultiply"}, {"-", "add"}};
if(arithFuncs.count(*$2))
{
string cur = *$3;
//NOTE: special case, if 'offset' is an argument replace it with the expression reading the third operand
//Don't replace if it has already been declared though
if(cur == "offset" && find(symbols.begin(), symbols.end(), cur) == symbols.end())
cur = "d->read(args[2])";
bool isRhsNum = true;
for(int idx = 0; idx < cur.length(); idx++)
if(cur[idx] < 48 || cur[idx] > 57)
{
isRhsNum = false;
break;
}
if(isRhsNum)
cur = "ops->number_(32, " + cur + ")";
if((*$2) == "-")
cur = "ops->negate(" + cur + ")";
ARGS_VEC("ops->", arithFuncs[*$2], "(", *$1, ", ", cur, ")");
$$ = STR(makeStr(args, &del));
}
else if((*$2) == "/")
{
ARGS_VEC(*$1, *$2, *$3);
$$ = STR(makeStr(args, &del));
}
else if(logicalFuncs.count(*$2))
{
ARGS_VEC("ops->", logicalFuncs[*$2], "(", *$1, ", ", *$3, ")");
$$ = STR(makeStr(args, &del));
}
else
{
if((*$2) == "-") cout<<"xxx"<<endl;
ARGS_VEC(*$1, " ", *$2, " ", *$3);
$$ = STR(makeStr(args, &del));
}
} |
{ $$ = STR(""); } |
OPERAND { $$ = $1; } |
BOOLVAL { $$ = $1; }
;
bitpos: varname SYMBOL_LT OPERAND SYMBOL_GT {
DEL_VEC($1, $3);
ARGS_VEC("ops->and_(ops->shiftRight(", *$1, ", ", *$3, "), ops->number_(1, 1))");
$$ = STR(makeStr(args, &del));
}
;
funccall: varname SYMBOL_OPENROUNDED args SYMBOL_CLOSEROUNDED {
DEL_VEC($1, $3);
if((*$1) == "AddWithCarry")
{
ARGS_VEC("d->doAddOperation(", *$3, ", ops->boolean_(false), n, z, c, v)");
$$ = STR(makeStr(args, &del));
}
else if((*$1) == "ConditionHolds")
{
ARGS_VEC("isTrue(d->", *$1, "(ops->number_(32, ", *$3, ")))");
$$ = STR(makeStr(args, &del));
}
else if((*$1) == "IsZero")
{
ARGS_VEC("isTrue(d->isZero(", *$3, "))");
$$ = STR(makeStr(args, &del));
}
else
{
ARGS_VEC("d->", *$1, "(", *$3, ")");
$$ = STR(makeStr(args, &del));
}
}
;
args: args SYMBOL_COMMA args {
bool otherArgs = (*$3 != "branch_type" && (*$3).find("BranchType") == string::npos);
DEL_VEC($1, $3);
ARGS_VEC(*$1, otherArgs?", ":"", otherArgs?*$3:"");
$$ = STR(makeStr(args, &del));
} |
varname {
string var = *$1;
if(find(symbols.begin(), symbols.end(), var) == symbols.end())
{
foundNewSymbol = true;
newSymbols.push_back(var);
}
if(var == "EXTR(5, 9)")
var = "d->read(args[1])";
$$ = STR(var);
} |
NUM {
stringstream out;
out<<$1;
$$ = STR(out.str());
} |
expr OPER expr {
DEL_VEC($1, $2, $3);
if((*$2) == "+" || (*$2) == "/")
{
if((*$2) == "/" && !isInt(*$3) && (*$1).find("d->") != string::npos && (*$3).find("d->") != string::npos)
{
ARGS_VEC("ops->unsignedDivide(", *$1, ", ", *$3, ")");
$$ = STR(makeStr(args, &del));
}
else
{
ARGS_VEC(*$1, *$2, *$3);
$$ = STR(makeStr(args, &del));
}
}
else if((*$2) == "MOD")
{
ARGS_VEC("ops->unsignedModulo(", *$1, ", ops->number_(32, ", *$3, "))");
$$ = STR(makeStr(args, &del));
}
else
assert(!"invalid operator in expression as argument for memory access!");
} |
bitmask {
string in(*$1), var, start, end;
getBitMaskParts(in, var, start, end);
stringstream out;
out<<"ops->extract("<<var<<", "<<start<<", "<<end<<" + 1)";
$$ = STR(out.str());
} |
bitpos { $$ = $1; } |
OPERAND { $$ = $1; } |
FLAG_CARRY { $$ = STR("d->readRegister(d->REG_C)"); } |
funccall { $$ = $1; }
;
cond: COND_IF expr COND_THEN condblock condshalf {
DEL_VEC($2, $4, $5);
ARGS_VEC("\nif(", *$2, ")\n{\n", *$4, "}\n", *$5);
$$ = STR(pruneCond(makeStr(args, &del)));
}
;
condshalf: condterm { $$ = $1; } |
condelsif { $$ = $1; };
;
condelsif: COND_ELSIF expr COND_THEN condblock condshalf {
DEL_VEC($2, $4, $5);
ARGS_VEC("\nelse if(", *$2, ")\n{\n", *$4, "}\n", *$5);
$$ = STR(pruneCond(makeStr(args, &del)));
}
;
condterm: COND_END { $$ = new string(""); } |
COND_ELSE condblock COND_END {
DEL_VEC($2);
ARGS_VEC("else\n{\n", *$2, "}\n");
$$ = STR(makeStr(args, &del));
}
;
condblock: condblock blockdata {
DEL_VEC($1, $2);
ARGS_VEC(*$1, *$2);
$$ = STR(makeStr(args, &del));
} |
blockdata { $$ = $1; }
;
blockcode: blockcode blockdata {
DEL_VEC($1, $2);
ARGS_VEC(*$1, *$2);
$$ = STR(makeStr(args, &del));
} |
blockdata { $$ = $1; };
;
blockdata: asnmt { $$ = $1; } |
funccall {
DEL_VEC($1);
ARGS_VEC(*$1, ";\n");
$$ = STR(makeStr(args, &del));
} |
cond { $$ = $1; } |
switch { $$ = $1; } |
IGNORE { $$ = STR(""); }
;
switch: SWITCH_CASE varname SWITCH_OF whenblocks {
DEL_VEC($2, $4);
if(*$4 != "")
{
ARGS_VEC("\nswitch(", *$2, ")\n{\n", *$4, "}\n");
$$ = STR(makeStr(args, &del));
}
else
{
delArgs(del);
$$ = STR("");
}
}
;
whenblocks: whenblocks whenblock {
DEL_VEC($1, $2);
ARGS_VEC(*$1, *$2);
$$ = STR(makeStr(args, &del));
} |
whenblock { $$ = $1; } |
/* empty */ { $$ = STR(""); }
;
whenblock: SWITCH_WHEN varname blockcode COND_END {
DEL_VEC($3);
//Ignore the block if it is a prefetch operation
if((*$2) != "MemOp_PREFETCH")
{
ARGS_VEC("case ", *$2, ":\n{\n", *$3, "}\nbreak;\n");
$$ = STR(makeStr(args, &del/*NULL*/));
}
else
$$ = STR("");
}
;
%%
void Dyninst_aarch64::Parser::error(const Parser::location_type& l,
const string& m)
{
driver.error(l, m);
}