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 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517
|
// -*- C++ -*-
// Copyright (C) 2005-2019 Red Hat Inc.
// Copyright (C) 2006 Intel Corporation.
//
// This file is part of systemtap, and is free software. You can
// redistribute it and/or modify it under the terms of the GNU General
// Public License (GPL); either version 2, or (at your option) any
// later version.
#ifndef STAPTREE_H
#define STAPTREE_H
#include <map>
#include <memory>
#include <stack>
#include <set>
#include <string>
#include <vector>
#include <iostream>
#include <stdexcept>
#include <cassert>
#include <typeinfo>
extern "C" {
#include <stdint.h>
}
#include "util.h"
#include "stringtable.h"
struct token; // parse.h
struct systemtap_session; // session.h
struct semantic_error: public std::runtime_error
{
const token* tok1;
const token* tok2;
std::string errsrc;
// Extra details to explain the error or provide alternatives to the user.
// Each one printed after the main error message and tokens aligned on
// separate lines. Just push_back anything you want that better explains
// the error to the user (not meant for extra verbose developer messages).
std::vector<std::string> details;
~semantic_error () throw ()
{
if (chain)
delete chain;
}
semantic_error (const std::string& src, const std::string& msg, const token* t1=0):
runtime_error (msg), tok1 (t1), tok2 (0), errsrc (src), chain (0) {}
semantic_error (const std::string& src, const std::string& msg, const token* t1,
const token* t2, const semantic_error* chn=0):
runtime_error (msg), tok1 (t1), tok2 (t2), errsrc (src), chain (0)
{
if (chn)
set_chain(*chn);
}
/* override copy-ctor to deep-copy chain */
semantic_error (const semantic_error& other):
runtime_error(other), tok1(other.tok1), tok2(other.tok2),
errsrc(other.errsrc), details(other.details), chain (0)
{
if (other.chain)
set_chain(*other.chain);
}
std::string errsrc_chain(void) const
{
return errsrc + (chain ? "|" + chain->errsrc_chain() : "");
}
semantic_error& set_chain(const semantic_error& new_chain)
{
if (chain)
delete chain;
chain = new semantic_error(new_chain);
return *this;
}
const semantic_error* get_chain(void) const
{
return chain;
}
private:
const semantic_error* chain;
};
// ------------------------------------------------------------------------
/* struct statistic_decl moved to session.h */
// ------------------------------------------------------------------------
enum exp_type
{
pe_unknown,
pe_long, // int64_t
pe_string, // std::string
pe_stats
};
std::ostream& operator << (std::ostream& o, const exp_type& e);
struct functioncall;
struct autocast_op;
struct exp_type_details
{
virtual ~exp_type_details () {};
// A process-wide unique identifier; probably a pointer.
virtual uintptr_t id () const = 0;
bool operator==(const exp_type_details& other) const
{ return id () == other.id (); }
bool operator!=(const exp_type_details& other) const
{ return !(*this == other); }
// Expand this autocast_op into a function call
virtual bool expandable() const = 0;
virtual functioncall *expand(autocast_op* e, bool lvalue) = 0;
virtual void print (std::ostream& o) const = 0;
};
typedef std::shared_ptr<exp_type_details> exp_type_ptr;
std::ostream& operator << (std::ostream& o, const exp_type_details& d);
struct token;
struct visitor;
struct update_visitor;
struct visitable
{
virtual void visit (visitor* u) = 0;
virtual ~visitable ();
};
struct symbol;
struct expression : public visitable
{
exp_type type;
exp_type_ptr type_details;
const token* tok;
expression ();
virtual ~expression ();
// NB: this pretty-printer function must generate such text that
// allows distinguishing operationally-different instances. During
// stap -p2/-p3, function bodies with identical pretty-printed
// bodies may be duplicate-eliminated. So print any relevant member
// variables somehow.
virtual void print (std::ostream& o) const = 0;
virtual bool is_symbol(symbol *& sym_out);
};
std::ostream& operator << (std::ostream& o, const expression& k);
struct literal: public expression
{
};
struct literal_string: public literal
{
interned_string value;
literal_string (interned_string v);
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct literal_number: public literal
{
int64_t value;
bool print_hex;
literal_number (int64_t v, bool hex=false);
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct vardecl;
struct embedded_expr: public expression
{
interned_string code;
interned_string code_referents;
std::vector<vardecl*> read_referents; /* pragma:read:FOO */
std::vector<vardecl*> write_referents; /* pragma:write:BAR */
bool tagged_p (const char *tag) const;
bool tagged_p (const std::string &tag) const;
bool tagged_p (const interned_string& tag) const;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct binary_expression: public expression
{
expression* left;
interned_string op;
expression* right;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct unary_expression: public expression
{
interned_string op;
expression* operand;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct pre_crement: public unary_expression
{
void visit (visitor* u);
};
struct post_crement: public unary_expression
{
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct logical_or_expr: public binary_expression
{
void visit (visitor* u);
};
struct logical_and_expr: public binary_expression
{
void visit (visitor* u);
};
struct arrayindex;
struct array_in: public expression
{
arrayindex* operand;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct regex_query: public expression
{
expression* left;
interned_string op;
literal_string* right;
void visit (visitor* u);
void print (std::ostream& o) const;
};
struct compound_expression: public binary_expression
{
compound_expression() { op = ","; }
void visit (visitor* u);
};
struct comparison: public binary_expression
{
void visit (visitor* u);
};
struct concatenation: public binary_expression
{
void visit (visitor* u);
};
struct ternary_expression: public expression
{
expression* cond;
expression* truevalue;
expression* falsevalue;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct assignment: public binary_expression
{
void visit (visitor* u);
};
struct hist_op;
struct indexable : public expression
{
// This is a helper class which, type-wise, acts as a disjoint union
// of symbols and histograms. You can ask it whether it's a
// histogram or a symbol, and downcast accordingly.
virtual bool is_symbol(symbol *& sym_out);
virtual bool is_hist_op(hist_op *& hist_out);
virtual ~indexable() {}
};
// Perform a downcast to one out-value and NULL the other, throwing an
// exception if neither downcast succeeds. This is (sadly) about the
// best we can accomplish in C++.
void
classify_indexable(indexable* ix,
symbol *& array_out,
hist_op *& hist_out);
struct vardecl;
struct symbol: public indexable
{
interned_string name;
vardecl *referent;
symbol ();
void print (std::ostream& o) const;
void visit (visitor* u);
// overrides of type 'indexable'
bool is_symbol(symbol *& sym_out);
};
struct target_register: public expression
{
unsigned regno;
bool userspace_p;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct target_deref: public expression
{
expression* addr;
unsigned size;
bool signed_p;
bool userspace_p;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct target_bitfield: public expression
{
expression* base;
unsigned offset;
unsigned size;
bool signed_p;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct target_symbol: public expression
{
enum component_type
{
comp_struct_member,
comp_literal_array_index,
comp_expression_array_index,
comp_pretty_print, // must be final
};
struct component
{
const token* tok;
component_type type;
std::string member; // comp_struct_member, comp_pretty_print
int64_t num_index; // comp_literal_array_index
expression* expr_index; // comp_expression_array_index
component(const token* t, const std::string& m, bool pprint=false):
tok(t),
type(pprint ? comp_pretty_print : comp_struct_member),
member(m), num_index(0), expr_index(0)
{}
component(const token* t, int64_t n):
tok(t), type(comp_literal_array_index), num_index(n),
expr_index(0) {}
component(const token* t, expression* e):
tok(t), type(comp_expression_array_index), num_index(0),
expr_index(e) {}
void print (std::ostream& o) const;
};
interned_string name;
bool addressof;
bool synthetic;
std::vector<component> components;
semantic_error* saved_conversion_error; // hand-made linked list
target_symbol(): addressof(false), synthetic(false), saved_conversion_error (0) {}
virtual std::string sym_name ();
void chain (const semantic_error& er);
void print (std::ostream& o) const;
void visit (visitor* u);
void visit_components (visitor* u);
void visit_components (update_visitor* u);
void assert_no_components(const std::string& tapset, bool pretty_ok=false);
size_t pretty_print_depth () const;
bool check_pretty_print (bool lvalue=false) const;
};
std::ostream& operator << (std::ostream& o, const target_symbol::component& c);
struct cast_op: public target_symbol
{
expression *operand;
interned_string type_name, module;
void print (std::ostream& o) const;
void visit (visitor* u);
};
// An autocast is like an implicit @cast on any expression, like
// (expr)->foo->var[baz], and the type is gleaned from the expr.
struct autocast_op: public target_symbol
{
expression *operand;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct atvar_op: public target_symbol
{
interned_string target_name, cu_name, module;
virtual std::string sym_name ();
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct defined_op: public expression
{
expression *operand;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct probewrite_op: public expression
{
interned_string name;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct entry_op: public expression
{
expression *operand;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct perf_op: public expression
{
literal_string *operand;
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct arrayindex: public expression
{
std::vector<expression*> indexes;
indexable *base;
arrayindex ();
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct functiondecl;
struct functioncall: public expression
{
interned_string function;
std::vector<expression*> args;
std::vector<functiondecl*> referents;
bool synthetic;
functioncall ();
void print (std::ostream& o) const;
void visit (visitor* u);
};
struct print_format: public expression
{
bool print_to_stream;
bool print_with_format;
bool print_with_delim;
bool print_with_newline;
bool print_char;
// XXX match runtime/vsprintf.c's print_flag
// ... for use with number() & number_size()
enum format_flag
{
fmt_flag_zeropad = 1,
fmt_flag_sign = 2,
fmt_flag_plus = 4,
fmt_flag_space = 8,
fmt_flag_left = 16,
fmt_flag_special = 32,
fmt_flag_large = 64,
};
enum conversion_type
{
conv_unspecified,
conv_pointer,
conv_number,
conv_string,
conv_char,
conv_memory,
conv_memory_hex,
conv_literal,
conv_binary
};
enum width_type
{
width_unspecified,
width_static,
width_dynamic
};
enum precision_type
{
prec_unspecified,
prec_static,
prec_dynamic
};
struct format_component
{
unsigned base;
unsigned width;
unsigned precision;
unsigned flags : 8;
width_type widthtype : 8;
precision_type prectype : 8;
conversion_type type : 8;
interned_string literal_string;
bool is_empty() const
{
return flags == 0
&& widthtype == width_unspecified
&& prectype == prec_unspecified
&& type == conv_unspecified
&& literal_string.empty();
}
void clear()
{
base = 0;
flags = 0;
width = 0;
widthtype = width_unspecified;
precision = 0;
prectype = prec_unspecified;
type = conv_unspecified;
literal_string.clear();
}
format_component() { clear(); }
inline void set_flag(format_flag f) { flags |= f; }
inline bool test_flag(format_flag f) const { return flags & f; }
};
std::string raw_components;
std::vector<format_component> components;
interned_string delimiter;
std::vector<expression*> args;
hist_op *hist;
bool tag;
static std::string components_to_string(std::vector<format_component> const & components);
static std::vector<format_component> string_to_components(std::string const & str);
static print_format* create(const token *t, const char *n = NULL);
void print (std::ostream& o) const;
void visit (visitor* u);
private:
interned_string print_format_type;
print_format(bool stream, bool format, bool delim, bool newline, bool _char, interned_string type):
print_to_stream(stream), print_with_format(format),
print_with_delim(delim), print_with_newline(newline),
print_char(_char), hist(NULL), tag(false), print_format_type(type)
{}
};
enum stat_component_type
{
sc_average,
sc_count,
sc_sum,
sc_min,
sc_max,
sc_none,
sc_variance,
};
struct stat_op: public expression
{
stat_component_type ctype;
expression* stat;
std::vector<int64_t> params;
void print (std::ostream& o) const;
void visit (visitor* u);
};
enum histogram_type
{
hist_linear,
hist_log
};
struct hist_op: public indexable
{
histogram_type htype;
expression* stat;
std::vector<int64_t> params;
void print (std::ostream& o) const;
void visit (visitor* u);
// overrides of type 'indexable'
bool is_hist_op(hist_op *& hist_out);
};
// ------------------------------------------------------------------------
struct symboldecl // unique object per (possibly implicit)
// symbol declaration
{
const token* tok;
const token* systemtap_v_conditional; //checking systemtap compatibility
interned_string name; // mangled name
interned_string unmangled_name;
exp_type type;
exp_type_ptr type_details;
symboldecl ();
virtual ~symboldecl ();
virtual void print (std::ostream &o) const = 0;
virtual void printsig (std::ostream &o) const = 0;
};
std::ostream& operator << (std::ostream& o, const symboldecl& k);
struct vardecl: public symboldecl
{
void print (std::ostream& o) const;
void printsig (std::ostream& o) const;
vardecl ();
void set_arity (int arity, const token* t);
bool compatible_arity (int a);
const token* arity_tok; // site where arity was first resolved
int arity; // -1: unknown; 0: scalar; >0: array
int maxsize; // upperbound on size for arrays
std::vector<exp_type> index_types; // for arrays only
literal *init; // for global scalars only
bool synthetic; // for probe locals only, don't init on entry; for globals, skip some checking
bool wrap;
bool char_ptr_arg; // set in ::emit_common_header(), only used if a formal_arg
};
struct vardecl_builtin: public vardecl
{
};
struct bpf_context_vardecl: public vardecl
{
int size;
int offset;
bool is_signed;
};
struct statement;
struct functiondecl: public symboldecl
{
std::vector<vardecl*> formal_args;
std::vector<vardecl*> locals;
std::vector<vardecl*> unused_locals;
statement* body;
bool synthetic;
bool mangle_oldstyle;
bool has_next;
bool cloned_p; // during probe-derivation time
int64_t priority;
functiondecl ();
void print (std::ostream& o) const;
void printsig (std::ostream& o) const;
void printsigtags (std::ostream& o, bool all_tags) const;
void join (systemtap_session& s); // for synthetic functions only
};
struct function_priority_order
{
bool operator() (const functiondecl* f1, const functiondecl* f2)
{
return f1->priority < f2->priority;
}
};
// ------------------------------------------------------------------------
struct statement : public visitable
{
virtual void print (std::ostream& o) const = 0;
const token* tok;
statement ();
statement (const token* tok);
virtual ~statement ();
virtual bool might_pushdown_lock () = 0;
};
std::ostream& operator << (std::ostream& o, const statement& k);
struct embeddedcode: public statement
{
interned_string code;
interned_string code_referents;
std::vector<vardecl*> read_referents; /* pragma:read:FOO */
std::vector<vardecl*> write_referents; /* pragma:write:BAR */
bool tagged_p (const char *tag) const;
bool tagged_p (const std::string& tag) const;
bool tagged_p (const interned_string& tag) const;
void print (std::ostream& o) const;
void visit (visitor* u);
virtual bool might_pushdown_lock () { return false; };
};
struct block: public statement
{
std::vector<statement*> statements;
void print (std::ostream& o) const;
void visit (visitor* u);
block () {}
block (statement* car, statement* cdr);
block (statement* car, statement* cdr1, statement* cdr2);
virtual ~block () {}
virtual bool might_pushdown_lock () { return true; };
};
struct try_block: public statement
{
statement* try_block; // may be 0
statement* catch_block; // may be 0
symbol* catch_error_var; // may be 0
void print (std::ostream& o) const;
void visit (visitor* u);
// PR26296: for try/catch, don't try to push lock/unlock down
virtual bool might_pushdown_lock () { return false; };
};
struct expr_statement;
struct for_loop: public statement
{
expr_statement* init; // may be 0
expression* cond;
expr_statement* incr; // may be 0
statement* block;
void print (std::ostream& o) const;
void visit (visitor* u);
// PR26269 lockpushdown:
// for loops, forget optimizing, just emit locks at top & bottom
virtual bool might_pushdown_lock () { return false; };
};
struct foreach_loop: public statement
{
// this part is a specialization of arrayindex
std::vector<symbol*> indexes;
std::vector<expression*> array_slice; // optional array slice to iterate over
indexable *base;
int sort_direction; // -1: decreasing, 0: none, 1: increasing
unsigned sort_column; // 0: value, 1..N: index
enum stat_component_type sort_aggr; // for aggregate arrays, which aggregate to sort on
symbol* value; // optional iteration value
expression* limit; // optional iteration limit
statement* block;
void print (std::ostream& o) const;
void visit (visitor* u);
// PR26269 lockpushdown:
// for loops, forget optimizing, just emit locks at top & bottom
virtual bool might_pushdown_lock () { return false; };
};
struct null_statement: public statement
{
void print (std::ostream& o) const;
void visit (visitor* u);
null_statement (const token* tok);
virtual bool might_pushdown_lock () { return false; };
};
struct expr_statement: public statement
{
expression* value; // executed for side-effects
void print (std::ostream& o) const;
void visit (visitor* u);
virtual bool might_pushdown_lock () { return false; };
};
struct if_statement: public statement
{
expression* condition;
statement* thenblock;
statement* elseblock; // may be 0
void print (std::ostream& o) const;
void visit (visitor* u);
virtual bool might_pushdown_lock () { return true; };
};
struct return_statement: public expr_statement
{
void print (std::ostream& o) const;
void visit (visitor* u);
// PR26296: We should not encounter a RETURN statement in a
// lock-relevant section of code (a probe handler body) at all.
virtual bool might_pushdown_lock () { return false; };
};
struct delete_statement: public expr_statement
{
void print (std::ostream& o) const;
void visit (visitor* u);
virtual bool might_pushdown_lock () { return false; };
};
struct break_statement: public statement
{
void print (std::ostream& o) const;
void visit (visitor* u);
virtual bool might_pushdown_lock () { return false; };
};
struct continue_statement: public statement
{
void print (std::ostream& o) const;
void visit (visitor* u);
virtual bool might_pushdown_lock () { return false; };
};
struct next_statement: public statement
{
void print (std::ostream& o) const;
void visit (visitor* u);
virtual bool might_pushdown_lock () { return false; };
};
struct probe;
struct derived_probe;
struct probe_alias;
struct embeddedcode;
struct stapfile
{
std::string name;
std::vector<probe*> probes;
std::vector<probe_alias*> aliases;
std::vector<functiondecl*> functions;
std::vector<vardecl*> globals;
std::vector<embeddedcode*> embeds;
interned_string file_contents;
bool privileged;
bool synthetic; // via parse_synthetic_*
stapfile ():
privileged (false), synthetic (false) {}
void print (std::ostream& o) const;
};
struct probe_point
{
struct component // XXX: sort of a restricted functioncall
{
interned_string functor;
literal* arg; // optional
bool from_glob;
component ();
const token* tok; // points to component's functor
component(interned_string f, literal *a=NULL, bool from_glob=false);
};
std::vector<component*> components;
bool optional;
bool sufficient;
bool well_formed; // used in derived_probe::script_location()
expression* condition;
std::string auto_path;
void print (std::ostream& o, bool print_extras=true) const;
probe_point ();
probe_point(const probe_point& pp);
probe_point(std::vector<component*> const & comps);
std::string str(bool print_extras=true) const;
bool from_globby_comp(const std::string& comp);
};
std::ostream& operator << (std::ostream& o, const probe_point& k);
struct probe
{
static unsigned last_probeidx;
std::vector<probe_point*> locations;
statement* body;
struct probe* base;
const token* tok;
const token* systemtap_v_conditional; //checking systemtap compatibility
std::vector<vardecl*> locals;
std::vector<vardecl*> unused_locals;
bool privileged;
bool synthetic;
unsigned id;
probe ();
probe (probe* p, probe_point *l);
void print (std::ostream& o) const;
std::string name () const;
virtual void printsig (std::ostream &o) const;
virtual void collect_derivation_chain (std::vector<probe*> &probes_list) const;
virtual void collect_derivation_pp_chain (std::vector<probe_point*> &) const;
virtual const probe_alias *get_alias () const { return 0; }
virtual probe_point *get_alias_loc () const { return 0; }
virtual ~probe() {}
private:
probe (const probe&);
probe& operator = (const probe&);
};
struct probe_alias: public probe
{
probe_alias(std::vector<probe_point*> const & aliases);
std::vector<probe_point*> alias_names;
virtual void printsig (std::ostream &o) const;
bool epilogue_style;
statement* body2; // Used when an alias contains both a prologue and an epilogue
};
// A derived visitor instance is used to visit the entire
// statement/expression tree.
struct visitor
{
// Machinery for differentiating lvalue visits from non-lvalue.
std::vector<expression *> active_lvalues;
bool is_active_lvalue(expression *e);
void push_active_lvalue(expression *e);
void pop_active_lvalue();
virtual ~visitor () {}
virtual void visit_block (block *s) = 0;
virtual void visit_try_block (try_block *s) = 0;
virtual void visit_embeddedcode (embeddedcode *s) = 0;
virtual void visit_null_statement (null_statement *s) = 0;
virtual void visit_expr_statement (expr_statement *s) = 0;
virtual void visit_if_statement (if_statement* s) = 0;
virtual void visit_for_loop (for_loop* s) = 0;
virtual void visit_foreach_loop (foreach_loop* s) = 0;
virtual void visit_return_statement (return_statement* s) = 0;
virtual void visit_delete_statement (delete_statement* s) = 0;
virtual void visit_next_statement (next_statement* s) = 0;
virtual void visit_break_statement (break_statement* s) = 0;
virtual void visit_continue_statement (continue_statement* s) = 0;
virtual void visit_literal_string (literal_string* e) = 0;
virtual void visit_literal_number (literal_number* e) = 0;
virtual void visit_embedded_expr (embedded_expr* e) = 0;
virtual void visit_binary_expression (binary_expression* e) = 0;
virtual void visit_unary_expression (unary_expression* e) = 0;
virtual void visit_pre_crement (pre_crement* e) = 0;
virtual void visit_post_crement (post_crement* e) = 0;
virtual void visit_logical_or_expr (logical_or_expr* e) = 0;
virtual void visit_logical_and_expr (logical_and_expr* e) = 0;
virtual void visit_array_in (array_in* e) = 0;
virtual void visit_regex_query (regex_query* e) = 0;
virtual void visit_compound_expression (compound_expression * e) = 0;
virtual void visit_comparison (comparison* e) = 0;
virtual void visit_concatenation (concatenation* e) = 0;
virtual void visit_ternary_expression (ternary_expression* e) = 0;
virtual void visit_assignment (assignment* e) = 0;
virtual void visit_symbol (symbol* e) = 0;
virtual void visit_target_register (target_register* e) = 0;
virtual void visit_target_deref (target_deref* e) = 0;
virtual void visit_target_bitfield (target_bitfield* e) = 0;
virtual void visit_target_symbol (target_symbol* e) = 0;
virtual void visit_arrayindex (arrayindex* e) = 0;
virtual void visit_functioncall (functioncall* e) = 0;
virtual void visit_print_format (print_format* e) = 0;
virtual void visit_stat_op (stat_op* e) = 0;
virtual void visit_hist_op (hist_op* e) = 0;
virtual void visit_cast_op (cast_op* e) = 0;
virtual void visit_autocast_op (autocast_op* e) = 0;
virtual void visit_atvar_op (atvar_op* e) = 0;
virtual void visit_defined_op (defined_op* e) = 0;
virtual void visit_probewrite_op(probewrite_op* e) = 0;
virtual void visit_entry_op (entry_op* e) = 0;
virtual void visit_perf_op (perf_op* e) = 0;
};
// A NOP visitor doesn't do anything. It's a useful base class if you need to
// take action only for specific types, without even traversing the rest.
struct nop_visitor: public visitor
{
virtual ~nop_visitor () {}
virtual void visit_block (block *) {};
virtual void visit_try_block (try_block *) {};
virtual void visit_embeddedcode (embeddedcode *) {};
virtual void visit_null_statement (null_statement *) {};
virtual void visit_expr_statement (expr_statement *) {};
virtual void visit_if_statement (if_statement*) {};
virtual void visit_for_loop (for_loop*) {};
virtual void visit_foreach_loop (foreach_loop*) {};
virtual void visit_return_statement (return_statement*) {};
virtual void visit_delete_statement (delete_statement*) {};
virtual void visit_next_statement (next_statement*) {};
virtual void visit_break_statement (break_statement*) {};
virtual void visit_continue_statement (continue_statement*) {};
virtual void visit_literal_string (literal_string*) {};
virtual void visit_literal_number (literal_number*) {};
virtual void visit_embedded_expr (embedded_expr*) {};
virtual void visit_binary_expression (binary_expression*) {};
virtual void visit_unary_expression (unary_expression*) {};
virtual void visit_pre_crement (pre_crement*) {};
virtual void visit_post_crement (post_crement*) {};
virtual void visit_logical_or_expr (logical_or_expr*) {};
virtual void visit_logical_and_expr (logical_and_expr*) {};
virtual void visit_array_in (array_in*) {};
virtual void visit_regex_query (regex_query*) {};
virtual void visit_compound_expression (compound_expression *) {};
virtual void visit_comparison (comparison*) {};
virtual void visit_concatenation (concatenation*) {};
virtual void visit_ternary_expression (ternary_expression*) {};
virtual void visit_assignment (assignment*) {};
virtual void visit_symbol (symbol*) {};
virtual void visit_target_register (target_register*) {};
virtual void visit_target_deref (target_deref*) {};
virtual void visit_target_bitfield (target_bitfield*) {};
virtual void visit_target_symbol (target_symbol*) {};
virtual void visit_arrayindex (arrayindex*) {};
virtual void visit_functioncall (functioncall*) {};
virtual void visit_print_format (print_format*) {};
virtual void visit_stat_op (stat_op*) {};
virtual void visit_hist_op (hist_op*) {};
virtual void visit_cast_op (cast_op*) {};
virtual void visit_autocast_op (autocast_op*) {};
virtual void visit_atvar_op (atvar_op*) {};
virtual void visit_defined_op (defined_op*) {};
virtual void visit_probewrite_op(probewrite_op*) {};
virtual void visit_entry_op (entry_op*) {};
virtual void visit_perf_op (perf_op*) {};
};
// A simple kind of visitor, which travels down to the leaves of the
// statement/expression tree, up to but excluding following vardecls
// and functioncalls.
struct traversing_visitor: public visitor
{
void visit_block (block *s);
void visit_try_block (try_block *s);
void visit_embeddedcode (embeddedcode *s);
void visit_null_statement (null_statement *s);
void visit_expr_statement (expr_statement *s);
void visit_if_statement (if_statement* s);
void visit_for_loop (for_loop* s);
void visit_foreach_loop (foreach_loop* s);
void visit_return_statement (return_statement* s);
void visit_delete_statement (delete_statement* s);
void visit_next_statement (next_statement* s);
void visit_break_statement (break_statement* s);
void visit_continue_statement (continue_statement* s);
void visit_literal_string (literal_string* e);
void visit_literal_number (literal_number* e);
void visit_embedded_expr (embedded_expr* e);
void visit_binary_expression (binary_expression* e);
void visit_unary_expression (unary_expression* e);
void visit_pre_crement (pre_crement* e);
void visit_post_crement (post_crement* e);
void visit_logical_or_expr (logical_or_expr* e);
void visit_logical_and_expr (logical_and_expr* e);
void visit_array_in (array_in* e);
void visit_regex_query (regex_query* e);
void visit_compound_expression(compound_expression* e);
void visit_comparison (comparison* e);
void visit_concatenation (concatenation* e);
void visit_ternary_expression (ternary_expression* e);
void visit_assignment (assignment* e);
void visit_symbol (symbol* e);
void visit_target_register (target_register* e);
void visit_target_deref (target_deref* e);
void visit_target_bitfield (target_bitfield* e);
void visit_target_symbol (target_symbol* e);
void visit_arrayindex (arrayindex* e);
void visit_functioncall (functioncall* e);
void visit_print_format (print_format* e);
void visit_stat_op (stat_op* e);
void visit_hist_op (hist_op* e);
void visit_cast_op (cast_op* e);
void visit_autocast_op (autocast_op* e);
void visit_atvar_op (atvar_op* e);
void visit_defined_op (defined_op* e);
void visit_probewrite_op(probewrite_op* e);
void visit_entry_op (entry_op* e);
void visit_perf_op (perf_op* e);
};
// A visitor that calls a generic visit_expression on every expression.
struct expression_visitor: public traversing_visitor
{
virtual void visit_expression(expression *e) = 0;
void visit_literal_string (literal_string* e);
void visit_literal_number (literal_number* e);
void visit_embedded_expr (embedded_expr* e);
void visit_binary_expression (binary_expression* e);
void visit_unary_expression (unary_expression* e);
void visit_pre_crement (pre_crement* e);
void visit_post_crement (post_crement* e);
void visit_logical_or_expr (logical_or_expr* e);
void visit_logical_and_expr (logical_and_expr* e);
void visit_array_in (array_in* e);
void visit_regex_query (regex_query* e);
void visit_compound_expression (compound_expression* e);
void visit_comparison (comparison* e);
void visit_concatenation (concatenation* e);
void visit_ternary_expression (ternary_expression* e);
void visit_assignment (assignment* e);
void visit_symbol (symbol* e);
void visit_target_register (target_register* e);
void visit_target_deref (target_deref* e);
void visit_target_bitfield (target_bitfield* e);
void visit_target_symbol (target_symbol* e);
void visit_arrayindex (arrayindex* e);
void visit_functioncall (functioncall* e);
void visit_print_format (print_format* e);
void visit_stat_op (stat_op* e);
void visit_hist_op (hist_op* e);
void visit_cast_op (cast_op* e);
void visit_autocast_op (autocast_op* e);
void visit_atvar_op (atvar_op* e);
void visit_defined_op (defined_op* e);
void visit_entry_op (entry_op* e);
void visit_perf_op (perf_op* e);
};
// A kind of traversing visitor, which also follows function calls.
// It uses an internal set object to prevent infinite recursion.
struct functioncall_traversing_visitor: public traversing_visitor
{
std::set<functiondecl*> seen;
std::set<functiondecl*> nested;
functiondecl* current_function;
functioncall_traversing_visitor(): current_function(0) {}
void visit_functioncall (functioncall* e);
void enter_functioncall (functioncall* e);
virtual void note_recursive_functioncall (functioncall* e);
};
// A kind of traversing visitor, which also follows function calls,
// and stores the vardecl* referent of each variable read and/or
// written and other such sundry side-effect data. It's used by
// the elaboration-time optimizer pass.
struct varuse_collecting_visitor: public functioncall_traversing_visitor
{
systemtap_session& session;
std::set<vardecl*> read;
std::set<vardecl*> written;
std::set<vardecl*> used;
bool embedded_seen;
bool current_lvalue_read;
expression* current_lvalue;
expression* current_lrvalue;
varuse_collecting_visitor(systemtap_session& s):
session (s),
embedded_seen (false),
current_lvalue_read (false),
current_lvalue(0),
current_lrvalue(0) {}
void visit_if_statement (if_statement* s);
void visit_for_loop (for_loop* s);
void visit_embeddedcode (embeddedcode *s);
void visit_embedded_expr (embedded_expr *e);
void visit_try_block (try_block *s);
void visit_functioncall (functioncall* e);
void visit_return_statement (return_statement *s);
void visit_delete_statement (delete_statement *s);
void visit_print_format (print_format *e);
void visit_assignment (assignment *e);
void visit_ternary_expression (ternary_expression* e);
void visit_arrayindex (arrayindex *e);
void visit_target_register (target_register* e);
void visit_target_deref (target_deref* e);
void visit_target_symbol (target_symbol *e);
void visit_symbol (symbol *e);
void visit_pre_crement (pre_crement *e);
void visit_post_crement (post_crement *e);
void visit_foreach_loop (foreach_loop *s);
void visit_cast_op (cast_op* e);
void visit_autocast_op (autocast_op* e);
void visit_atvar_op (atvar_op *e);
void visit_defined_op (defined_op* e);
void visit_entry_op (entry_op* e);
void visit_perf_op (perf_op* e);
bool side_effect_free ();
bool side_effect_free_wrt (const std::set<vardecl*>& vars);
};
// Similar to the varuse_collecting_visitor except that it operates
// on symbol names (and symbol referents wherever possible). This is
// useful in cases where we need to detect variable usage before
// symbol resolution occurs, ex. @probewrite.
struct
symuse_collecting_visitor: public varuse_collecting_visitor
{
std::set<interned_string> written_names;
std::set<interned_string> read_names;
symuse_collecting_visitor(systemtap_session& s):
varuse_collecting_visitor(s) {}
void visit_try_block(try_block* s);
void visit_embeddedcode(embeddedcode* s);
void visit_embedded_expr(embedded_expr* e);
void visit_target_symbol(target_symbol* e);
void visit_symbol(symbol* e);
void visit_probewrite_op(probewrite_op* e);
};
// A kind of visitor that throws an semantic_error exception
// whenever a non-overridden method is called.
struct throwing_visitor: public visitor
{
std::string msg;
throwing_visitor (const std::string& m);
throwing_visitor ();
virtual void throwone (const token* t);
void visit_block (block *s);
void visit_try_block (try_block *s);
void visit_embeddedcode (embeddedcode *s);
void visit_null_statement (null_statement *s);
void visit_expr_statement (expr_statement *s);
void visit_if_statement (if_statement* s);
void visit_for_loop (for_loop* s);
void visit_foreach_loop (foreach_loop* s);
void visit_return_statement (return_statement* s);
void visit_delete_statement (delete_statement* s);
void visit_next_statement (next_statement* s);
void visit_break_statement (break_statement* s);
void visit_continue_statement (continue_statement* s);
void visit_literal_string (literal_string* e);
void visit_literal_number (literal_number* e);
void visit_embedded_expr (embedded_expr* e);
void visit_binary_expression (binary_expression* e);
void visit_unary_expression (unary_expression* e);
void visit_pre_crement (pre_crement* e);
void visit_post_crement (post_crement* e);
void visit_logical_or_expr (logical_or_expr* e);
void visit_logical_and_expr (logical_and_expr* e);
void visit_array_in (array_in* e);
void visit_regex_query (regex_query* e);
void visit_compound_expression (compound_expression* e);
void visit_comparison (comparison* e);
void visit_concatenation (concatenation* e);
void visit_ternary_expression (ternary_expression* e);
void visit_assignment (assignment* e);
void visit_symbol (symbol* e);
void visit_target_register (target_register* e);
void visit_target_deref (target_deref* e);
void visit_target_bitfield (target_bitfield* e);
void visit_target_symbol (target_symbol* e);
void visit_arrayindex (arrayindex* e);
void visit_functioncall (functioncall* e);
void visit_print_format (print_format* e);
void visit_stat_op (stat_op* e);
void visit_hist_op (hist_op* e);
void visit_cast_op (cast_op* e);
void visit_autocast_op (autocast_op* e);
void visit_atvar_op (atvar_op* e);
void visit_defined_op (defined_op* e);
void visit_probewrite_op(probewrite_op* e);
void visit_entry_op (entry_op* e);
void visit_perf_op (perf_op* e);
};
// A visitor similar to a traversing_visitor, but with the ability to rewrite
// parts of the tree through require/provide.
//
// The relaxed_p member variable is cleared if an update occurred.
//
struct update_visitor: public visitor
{
template <typename T> T* require (T* src, bool clearok=false)
{
T* dst = NULL;
if (src != NULL)
{
src->visit(this);
if (values.empty())
throw std::runtime_error(_("update_visitor wasn't provided a value"));
visitable *v = values.top();
values.pop();
if (v == NULL && !clearok)
throw std::runtime_error(_("update_visitor was provided a NULL value"));
dst = dynamic_cast<T*>(v);
if (v != NULL && dst == NULL)
throw std::runtime_error(_F("update_visitor can't set type \"%s\" with a \"%s\"",
typeid(T).name(), typeid(*v).name()));
}
return dst;
}
template <typename T> void provide (T* src)
{
values.push(src);
}
template <typename T> void abort_provide (T* src)
{
values.push(src);
aborted_p = true;
}
template <typename T> void replace (T*& src, bool clearok=false)
{
if (! aborted_p)
{
const T* old_src = src;
T* new_src = require(src, clearok);
if (old_src != new_src)
{
if (this->verbose > 3)
{
std::clog << _("replaced ");
if (old_src) old_src->print(std::clog); else std::clog << "0";
std::clog << _(" with ");
if (new_src) new_src->print(std::clog); else std::clog << "0";
std::clog << std::endl;
}
relaxed_p = false;
}
src = new_src;
}
}
update_visitor(unsigned v = 0): verbose(v), aborted_p(false), relaxed_p(true) {}
virtual ~update_visitor() {
if (!values.empty())
/* PR27274: tolerate aborted traversals */
std::runtime_error(_("update_visitor dtor has unused values"));
}
// Permit reuse of the visitor object.
virtual void reset() { aborted_p = false; relaxed_p = true;
/* PR27274: tolerate aborted traversals */
while (!values.empty()) values.pop();
}
virtual bool relaxed() { return relaxed_p; }
virtual void visit_block (block *s);
virtual void visit_try_block (try_block *s);
virtual void visit_embeddedcode (embeddedcode *s);
virtual void visit_null_statement (null_statement *s);
virtual void visit_expr_statement (expr_statement *s);
virtual void visit_if_statement (if_statement* s);
virtual void visit_for_loop (for_loop* s);
virtual void visit_foreach_loop (foreach_loop* s);
virtual void visit_return_statement (return_statement* s);
virtual void visit_delete_statement (delete_statement* s);
virtual void visit_next_statement (next_statement* s);
virtual void visit_break_statement (break_statement* s);
virtual void visit_continue_statement (continue_statement* s);
virtual void visit_literal_string (literal_string* e);
virtual void visit_literal_number (literal_number* e);
virtual void visit_embedded_expr (embedded_expr* e);
virtual void visit_binary_expression (binary_expression* e);
virtual void visit_unary_expression (unary_expression* e);
virtual void visit_pre_crement (pre_crement* e);
virtual void visit_post_crement (post_crement* e);
virtual void visit_logical_or_expr (logical_or_expr* e);
virtual void visit_logical_and_expr (logical_and_expr* e);
virtual void visit_array_in (array_in* e);
virtual void visit_regex_query (regex_query* e);
virtual void visit_compound_expression (compound_expression* e);
virtual void visit_comparison (comparison* e);
virtual void visit_concatenation (concatenation* e);
virtual void visit_ternary_expression (ternary_expression* e);
virtual void visit_assignment (assignment* e);
virtual void visit_symbol (symbol* e);
virtual void visit_target_register (target_register* e);
virtual void visit_target_deref (target_deref* e);
virtual void visit_target_bitfield (target_bitfield* e);
virtual void visit_target_symbol (target_symbol* e);
virtual void visit_arrayindex (arrayindex* e);
virtual void visit_functioncall (functioncall* e);
virtual void visit_print_format (print_format* e);
virtual void visit_stat_op (stat_op* e);
virtual void visit_hist_op (hist_op* e);
virtual void visit_cast_op (cast_op* e);
virtual void visit_autocast_op (autocast_op* e);
virtual void visit_atvar_op (atvar_op* e);
virtual void visit_defined_op (defined_op* e);
virtual void visit_probewrite_op(probewrite_op* e);
virtual void visit_entry_op (entry_op* e);
virtual void visit_perf_op (perf_op* e);
private:
std::stack<visitable *> values;
protected:
unsigned verbose;
bool aborted_p;
bool relaxed_p;
};
// A visitor which performs a deep copy of the root node it's applied
// to. NB: It does not copy any of the variable or function
// declarations; those fields are set to NULL, assuming you want to
// re-infer the declarations in a new context (the one you're copying
// to).
struct deep_copy_visitor: public update_visitor
{
template <typename T> static T* deep_copy (T* e)
{
deep_copy_visitor v;
return v.require (e);
}
virtual void visit_block (block *s);
virtual void visit_try_block (try_block *s);
virtual void visit_embeddedcode (embeddedcode *s);
virtual void visit_null_statement (null_statement *s);
virtual void visit_expr_statement (expr_statement *s);
virtual void visit_if_statement (if_statement* s);
virtual void visit_for_loop (for_loop* s);
virtual void visit_foreach_loop (foreach_loop* s);
virtual void visit_return_statement (return_statement* s);
virtual void visit_delete_statement (delete_statement* s);
virtual void visit_next_statement (next_statement* s);
virtual void visit_break_statement (break_statement* s);
virtual void visit_continue_statement (continue_statement* s);
virtual void visit_literal_string (literal_string* e);
virtual void visit_literal_number (literal_number* e);
virtual void visit_embedded_expr (embedded_expr* e);
virtual void visit_binary_expression (binary_expression* e);
virtual void visit_unary_expression (unary_expression* e);
virtual void visit_pre_crement (pre_crement* e);
virtual void visit_post_crement (post_crement* e);
virtual void visit_logical_or_expr (logical_or_expr* e);
virtual void visit_logical_and_expr (logical_and_expr* e);
virtual void visit_array_in (array_in* e);
virtual void visit_regex_query (regex_query* e);
virtual void visit_compound_expression(compound_expression* e);
virtual void visit_comparison (comparison* e);
virtual void visit_concatenation (concatenation* e);
virtual void visit_ternary_expression (ternary_expression* e);
virtual void visit_assignment (assignment* e);
virtual void visit_symbol (symbol* e);
virtual void visit_target_register (target_register* e);
virtual void visit_target_deref (target_deref* e);
virtual void visit_target_bitfield (target_bitfield* e);
virtual void visit_target_symbol (target_symbol* e);
virtual void visit_arrayindex (arrayindex* e);
virtual void visit_functioncall (functioncall* e);
virtual void visit_print_format (print_format* e);
virtual void visit_stat_op (stat_op* e);
virtual void visit_hist_op (hist_op* e);
virtual void visit_cast_op (cast_op* e);
virtual void visit_autocast_op (autocast_op* e);
virtual void visit_atvar_op (atvar_op* e);
virtual void visit_defined_op (defined_op* e);
virtual void visit_entry_op (entry_op* e);
virtual void visit_perf_op (perf_op* e);
};
struct embedded_tags_visitor: public traversing_visitor
{
std::set<interned_string> available_tags;
std::set<interned_string> tags; // set of the tags that appear in the code
embedded_tags_visitor(bool all_tags);
void visit_embeddedcode (embeddedcode *s);
void visit_embedded_expr (embedded_expr *e);
};
#endif // STAPTREE_H
/* vim: set sw=2 ts=8 cino=>4,n-2,{2,^-2,t0,(0,u0,w1,M1 : */
|