-
Notifications
You must be signed in to change notification settings - Fork 3
/
elaborate.h
423 lines (348 loc) · 15.4 KB
/
elaborate.h
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
// -*- C++ -*-
// Copyright (C) 2005-2013 Red Hat Inc.
//
// 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 ELABORATE_H
#define ELABORATE_H
#include "staptree.h"
#include "parse.h"
#include <string>
#include <vector>
//#include <iostream>
#include <iosfwd>
#include <sstream>
#include <map>
#include <list>
extern "C" {
#include <elfutils/libdw.h>
}
#include "privilege.h"
struct recursive_expansion_error : public semantic_error
{
~recursive_expansion_error () throw () {}
recursive_expansion_error (const std::string& msg, const token* t1=0):
SEMANTIC_ERROR (msg, t1) {}
recursive_expansion_error (const std::string& msg, const token* t1,
const token* t2):
SEMANTIC_ERROR (msg, t1, t2) {}
};
// ------------------------------------------------------------------------
struct derived_probe;
class match_node;
struct symresolution_info: public traversing_visitor
{
protected:
systemtap_session& session;
public:
functiondecl* current_function;
derived_probe* current_probe;
symresolution_info (systemtap_session& s);
vardecl* find_var (const std::string& name, int arity, const token *tok);
functiondecl* find_function (const std::string& name, unsigned arity, const token *tok);
std::set<std::string> collect_functions(void);
void visit_block (block *s);
void visit_symbol (symbol* e);
void visit_foreach_loop (foreach_loop* e);
void visit_arrayindex (arrayindex* e);
void visit_functioncall (functioncall* e);
void visit_delete_statement (delete_statement* s);
};
struct typeresolution_info: public visitor
{
typeresolution_info (systemtap_session& s);
systemtap_session& session;
unsigned num_newly_resolved;
unsigned num_still_unresolved;
bool assert_resolvability;
int mismatch_complexity;
functiondecl* current_function;
derived_probe* current_probe;
// Holds information about a type we resolved (see PR16097)
struct resolved_type
{
const token *tok;
const symboldecl *decl;
int index;
resolved_type(const token *ct, const symboldecl *cdecl, int cindex):
tok(ct), decl(cdecl), index(cindex) {}
};
// Holds an element each time we resolve a decl. Unique by decl & index.
// Possible values:
// - resolved function type -> decl = functiondecl, index = -1
// - resolved function arg type -> decl = vardecl, index = index of arg
// - resolved array/var type -> decl = vardecl, index = -1
// - resolved array index type -> decl = vardecl, index = index of type
std::vector<resolved_type> resolved_types; // see PR16097
void check_arg_type (exp_type wanted, expression* arg);
void check_local (vardecl* v);
void unresolved (const token* tok);
void invalid (const token* tok, exp_type t);
void mismatch (const binary_expression* e);
void mismatch (const token* tok, exp_type t1, exp_type t2);
void mismatch (const token* tok, exp_type type,
const symboldecl* decl, int index = -1);
void resolved (const token* tok, exp_type type,
const symboldecl* decl = NULL, int index = -1);
exp_type t; // implicit parameter for nested visit call; may clobber
// Upon entry to one of the visit_* calls, the incoming
// `t' value is the type inferred for that node from
// context. It may match or conflict with the node's
// preexisting type, or it may be unknown.
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_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_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_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 derived_probe is a probe that has been elaborated by
// binding to a matching provider. The locations std::vector
// may be smaller or larger than the base probe, since a
// provider may transform it.
class translator_output;
struct derived_probe_group;
struct derived_probe: public probe
{
derived_probe (probe* b, probe_point* l, bool rewrite_loc=false);
probe* base; // the original parsed probe
probe_point* base_pp; // the probe_point that led to this derivation
virtual ~derived_probe () {}
virtual void join_group (systemtap_session& s) = 0;
virtual probe_point* sole_location () const;
virtual probe_point* script_location () const;
virtual void printsig (std::ostream &o) const;
// return arguments of probe if there
virtual void getargs (std::list<std::string> &) const {}
void printsig_nested (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*> &pp_list) const;
std::string derived_locations ();
virtual void print_dupe_stamp(std::ostream&) {}
// To aid duplication elimination, print a stamp which uniquely identifies
// the code that will be added to the probe body. (Doesn't need to be the
// actual code...)
virtual void initialize_probe_context_vars (translator_output*) {}
// From within unparser::emit_probe, initialized any extra variables
// in this probe's context locals.
virtual void emit_probe_local_init (systemtap_session& s, translator_output*) {}
// From within unparser::emit_probe, emit any extra processing block
// for this probe.
virtual void emit_privilege_assertion (translator_output*);
// From within unparser::emit_probe, emit any unprivileged mode
// checking for this probe.
public:
static void emit_common_header (translator_output* o);
// from c_unparser::emit_common_header
// XXX: probably can move this stuff to a probe_group::emit_module_decls
static void emit_process_owner_assertion (translator_output*);
// From within unparser::emit_probe, emit a check that the current
// process belongs to the user.
static void print_dupe_stamp_unprivileged(std::ostream& o);
static void print_dupe_stamp_unprivileged_process_owner(std::ostream& o);
virtual bool needs_global_locks () { return true; }
// by default, probes need locks around global variables
// Location of semaphores to activate sdt probes
Dwarf_Addr sdt_semaphore_addr;
// perf.counter probes that this probe references
std::set<derived_probe*> perf_counter_refs;
// index into session.probes[], set and used during translation
unsigned session_index;
};
// ------------------------------------------------------------------------
struct unparser;
// Various derived classes derived_probe_group manage the
// registration/invocation/unregistration of sibling probes.
struct derived_probe_group
{
virtual ~derived_probe_group () {}
virtual void emit_kernel_module_init (systemtap_session& s) {}
// Similar to emit_module_init(), but code emitted here gets run
// with root access. The _init-generated code may assume that it is
// called only once. If that code fails at run time, it must set
// rc=1 and roll back any partial initializations, for its _exit
// friend will NOT be invoked. The generated code may use
// pre-declared "int i, j;". Note that the message transport isn't
// available, so printk()/errk() is the only output option.
virtual void emit_kernel_module_exit (systemtap_session& s) {}
// Similar to emit_module_exit(), but code emitted here gets run
// with root access. The _exit-generated code may assume that it is
// executed exactly zero times (if the _init-generated code failed)
// or once. (_exit itself may be called a few times, to generate
// the code in a few different places in the probe module.) The
// generated code may use pre-declared "int i, j;". Note that the
// message transport isn't available, so printk()/errk() is the only
// output option.
virtual void emit_module_decls (systemtap_session& s) = 0;
// The _decls-generated code may assume that declarations such as
// the context, embedded-C code, function and probe handler bodies
// are all already generated. That is, _decls is called near the
// end of the code generation process. It should minimize the
// number of separate variables (and to a lesser extent, their
// size).
virtual void emit_module_init (systemtap_session& s) = 0;
// The _init-generated code may assume that it is called only once.
// If that code fails at run time, it must set rc=1 and roll back
// any partial initializations, for its _exit friend will NOT be
// invoked. The generated code may use pre-declared "int i, j;"
// and set "const char* probe_point;".
virtual void emit_module_post_init (systemtap_session& s) {}
// The emit_module_post_init() code is called once session_state is
// set to running.
virtual void emit_module_refresh (systemtap_session& s) {}
// The _refresh-generated code may be called multiple times during
// a session run, bracketed by _init and _exit calls.
// Upon failure, it must set enough state so that
// a subsequent _exit call will clean up everything.
// The generated code may use pre-declared "int i, j;".
virtual void emit_module_exit (systemtap_session& s) = 0;
// The _exit-generated code may assume that it is executed exactly
// zero times (if the _init-generated code failed) or once. (_exit
// itself may be called a few times, to generate the code in a few
// different places in the probe module.)
// The generated code may use pre-declared "int i, j;".
};
// ------------------------------------------------------------------------
typedef std::map<std::string, literal*> literal_map_t;
struct derived_probe_builder
{
virtual void build(systemtap_session & sess,
probe* base,
probe_point* location,
literal_map_t const & parameters,
std::vector<derived_probe*> & finished_results) = 0;
virtual void build_with_suffix(systemtap_session & sess,
probe * use,
probe_point * location,
std::map<std::string, literal *>
const & parameters,
std::vector<derived_probe *>
& finished_results,
std::vector<probe_point::component *>
const & suffix);
virtual ~derived_probe_builder() {}
virtual void build_no_more (systemtap_session &) {}
virtual bool is_alias () const { return false; }
static bool has_null_param (literal_map_t const & parameters,
const std::string& key);
static bool get_param (literal_map_t const & parameters,
const std::string& key, std::string& value);
static bool get_param (literal_map_t const & parameters,
const std::string& key, int64_t& value);
};
struct
match_key
{
std::string name;
bool have_parameter;
exp_type parameter_type;
match_key(std::string const & n);
match_key(probe_point::component const & c);
match_key & with_number();
match_key & with_string();
std::string str() const;
bool operator<(match_key const & other) const;
bool globmatch(match_key const & other) const;
};
class
match_node
{
typedef std::map<match_key, match_node*> sub_map_t;
typedef std::map<match_key, match_node*>::iterator sub_map_iterator_t;
sub_map_t sub;
std::vector<derived_probe_builder*> ends;
public:
match_node();
void find_and_build (systemtap_session& s,
probe* p, probe_point *loc, unsigned pos,
std::vector<derived_probe *>& results);
std::string suggest_functors(std::string functor);
void try_suffix_expansion (systemtap_session& s,
probe *p, probe_point *loc, unsigned pos,
std::vector<derived_probe *>& results);
void build_no_more (systemtap_session &s);
void dump (systemtap_session &s, const std::string &name = "");
match_node* bind(match_key const & k);
match_node* bind(std::string const & k);
match_node* bind_str(std::string const & k);
match_node* bind_num(std::string const & k);
match_node* bind_privilege(privilege_t p = privilege_t (pr_stapdev | pr_stapsys));
void bind(derived_probe_builder* e);
private:
privilege_t privilege;
};
// ------------------------------------------------------------------------
struct
alias_expansion_builder
: public derived_probe_builder
{
probe_alias * alias;
alias_expansion_builder(probe_alias * a)
: alias(a)
{}
virtual void build(systemtap_session & sess,
probe * use,
probe_point * location,
std::map<std::string, literal *> const &,
std::vector<derived_probe *> & finished_results);
virtual void build_with_suffix(systemtap_session & sess,
probe * use,
probe_point * location,
std::map<std::string, literal *>
const &,
std::vector<derived_probe *>
& finished_results,
std::vector<probe_point::component *>
const & suffix);
virtual bool is_alias () const { return true; }
bool checkForRecursiveExpansion (probe *use);
};
// ------------------------------------------------------------------------
/* struct systemtap_session moved to session.h */
int semantic_pass (systemtap_session& s);
void derive_probes (systemtap_session& s,
probe *p, std::vector<derived_probe*>& dps,
bool optional = false, bool rethrow_errors = false);
// A helper we use here and in translate, for pulling symbols out of lvalue
// expressions.
symbol * get_symbol_within_expression (expression *e);
struct unparser;
#endif // ELABORATE_H
/* vim: set sw=2 ts=8 cino=>4,n-2,{2,^-2,t0,(0,u0,w1,M1 : */