Print this page
libdtrace: attempt to resolve FORWARD types to concrete types
libdtrace: treat DTT_FL_USER properly in the parser
| Split |
Close |
| Expand all |
| Collapse all |
--- old/usr/src/lib/libdtrace/common/dt_parser.c
+++ new/usr/src/lib/libdtrace/common/dt_parser.c
1 1 /*
2 2 * CDDL HEADER START
3 3 *
4 4 * The contents of this file are subject to the terms of the
5 5 * Common Development and Distribution License (the "License").
6 6 * You may not use this file except in compliance with the License.
7 7 *
8 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 9 * or http://www.opensolaris.org/os/licensing.
10 10 * See the License for the specific language governing permissions
11 11 * and limitations under the License.
12 12 *
13 13 * When distributing Covered Code, include this CDDL HEADER in each
14 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 15 * If applicable, add the following below this CDDL HEADER, with the
16 16 * fields enclosed by brackets "[]" replaced with your own identifying
17 17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 18 *
19 19 * CDDL HEADER END
20 20 */
21 21
22 22 /*
23 23 * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
24 24 * Copyright (c) 2013, Joyent Inc. All rights reserved.
25 25 * Copyright (c) 2013 by Delphix. All rights reserved.
26 26 */
27 27
28 28 /*
29 29 * DTrace D Language Parser
30 30 *
31 31 * The D Parser is a lex/yacc parser consisting of the lexer dt_lex.l, the
32 32 * parsing grammar dt_grammar.y, and this file, dt_parser.c, which handles
33 33 * the construction of the parse tree nodes and their syntactic validation.
34 34 * The parse tree is constructed of dt_node_t structures (see <dt_parser.h>)
35 35 * that are built in two passes: (1) the "create" pass, where the parse tree
36 36 * nodes are allocated by calls from the grammar to dt_node_*() subroutines,
37 37 * and (2) the "cook" pass, where nodes are coalesced, assigned D types, and
38 38 * validated according to the syntactic rules of the language.
39 39 *
40 40 * All node allocations are performed using dt_node_alloc(). All node frees
41 41 * during the parsing phase are performed by dt_node_free(), which frees node-
42 42 * internal state but does not actually free the nodes. All final node frees
43 43 * are done as part of the end of dt_compile() or as part of destroying
44 44 * persistent identifiers or translators which have embedded nodes.
45 45 *
46 46 * The dt_node_* routines that implement pass (1) may allocate new nodes. The
47 47 * dt_cook_* routines that implement pass (2) may *not* allocate new nodes.
48 48 * They may free existing nodes using dt_node_free(), but they may not actually
49 49 * deallocate any dt_node_t's. Currently dt_cook_op2() is an exception to this
50 50 * rule: see the comments therein for how this issue is resolved.
51 51 *
52 52 * The dt_cook_* routines are responsible for (at minimum) setting the final
53 53 * node type (dn_ctfp/dn_type) and attributes (dn_attr). If dn_ctfp/dn_type
54 54 * are set manually (i.e. not by one of the type assignment functions), then
55 55 * the DT_NF_COOKED flag must be set manually on the node.
56 56 *
57 57 * The cooking pass can be applied to the same parse tree more than once (used
58 58 * in the case of a comma-separated list of probe descriptions). As such, the
59 59 * cook routines must not perform any parse tree transformations which would
60 60 * be invalid if the tree were subsequently cooked using a different context.
61 61 *
62 62 * The dn_ctfp and dn_type fields form the type of the node. This tuple can
63 63 * take on the following set of values, which form our type invariants:
64 64 *
65 65 * 1. dn_ctfp = NULL, dn_type = CTF_ERR
66 66 *
67 67 * In this state, the node has unknown type and is not yet cooked. The
68 68 * DT_NF_COOKED flag is not yet set on the node.
69 69 *
70 70 * 2. dn_ctfp = DT_DYN_CTFP(dtp), dn_type = DT_DYN_TYPE(dtp)
71 71 *
72 72 * In this state, the node is a dynamic D type. This means that generic
73 73 * operations are not valid on this node and only code that knows how to
74 74 * examine the inner details of the node can operate on it. A <DYN> node
75 75 * must have dn_ident set to point to an identifier describing the object
76 76 * and its type. The DT_NF_REF flag is set for all nodes of type <DYN>.
77 77 * At present, the D compiler uses the <DYN> type for:
78 78 *
79 79 * - associative arrays that do not yet have a value type defined
80 80 * - translated data (i.e. the result of the xlate operator)
81 81 * - aggregations
82 82 *
83 83 * 3. dn_ctfp = DT_STR_CTFP(dtp), dn_type = DT_STR_TYPE(dtp)
84 84 *
85 85 * In this state, the node is of type D string. The string type is really
86 86 * a char[0] typedef, but requires special handling throughout the compiler.
87 87 *
88 88 * 4. dn_ctfp != NULL, dn_type = any other type ID
89 89 *
90 90 * In this state, the node is of some known D/CTF type. The normal libctf
91 91 * APIs can be used to learn more about the type name or structure. When
92 92 * the type is assigned, the DT_NF_SIGNED, DT_NF_REF, and DT_NF_BITFIELD
93 93 * flags cache the corresponding attributes of the underlying CTF type.
94 94 */
95 95
96 96 #include <sys/param.h>
97 97 #include <sys/sysmacros.h>
98 98 #include <limits.h>
99 99 #include <setjmp.h>
100 100 #include <strings.h>
101 101 #include <assert.h>
102 102 #include <alloca.h>
103 103 #include <stdlib.h>
104 104 #include <stdarg.h>
105 105 #include <stdio.h>
106 106 #include <errno.h>
107 107 #include <ctype.h>
108 108
109 109 #include <dt_impl.h>
110 110 #include <dt_grammar.h>
111 111 #include <dt_module.h>
112 112 #include <dt_provider.h>
113 113 #include <dt_string.h>
114 114 #include <dt_as.h>
115 115
116 116 dt_pcb_t *yypcb; /* current control block for parser */
117 117 dt_node_t *yypragma; /* lex token list for control lines */
118 118 char yyintprefix; /* int token macro prefix (+/-) */
119 119 char yyintsuffix[4]; /* int token suffix string [uU][lL] */
120 120 int yyintdecimal; /* int token format flag (1=decimal, 0=octal/hex) */
121 121
122 122 static const char *
123 123 opstr(int op)
124 124 {
125 125 switch (op) {
126 126 case DT_TOK_COMMA: return (",");
127 127 case DT_TOK_ELLIPSIS: return ("...");
128 128 case DT_TOK_ASGN: return ("=");
129 129 case DT_TOK_ADD_EQ: return ("+=");
130 130 case DT_TOK_SUB_EQ: return ("-=");
131 131 case DT_TOK_MUL_EQ: return ("*=");
132 132 case DT_TOK_DIV_EQ: return ("/=");
133 133 case DT_TOK_MOD_EQ: return ("%=");
134 134 case DT_TOK_AND_EQ: return ("&=");
135 135 case DT_TOK_XOR_EQ: return ("^=");
136 136 case DT_TOK_OR_EQ: return ("|=");
137 137 case DT_TOK_LSH_EQ: return ("<<=");
138 138 case DT_TOK_RSH_EQ: return (">>=");
139 139 case DT_TOK_QUESTION: return ("?");
140 140 case DT_TOK_COLON: return (":");
141 141 case DT_TOK_LOR: return ("||");
142 142 case DT_TOK_LXOR: return ("^^");
143 143 case DT_TOK_LAND: return ("&&");
144 144 case DT_TOK_BOR: return ("|");
145 145 case DT_TOK_XOR: return ("^");
146 146 case DT_TOK_BAND: return ("&");
147 147 case DT_TOK_EQU: return ("==");
148 148 case DT_TOK_NEQ: return ("!=");
149 149 case DT_TOK_LT: return ("<");
150 150 case DT_TOK_LE: return ("<=");
151 151 case DT_TOK_GT: return (">");
152 152 case DT_TOK_GE: return (">=");
153 153 case DT_TOK_LSH: return ("<<");
154 154 case DT_TOK_RSH: return (">>");
155 155 case DT_TOK_ADD: return ("+");
156 156 case DT_TOK_SUB: return ("-");
157 157 case DT_TOK_MUL: return ("*");
158 158 case DT_TOK_DIV: return ("/");
159 159 case DT_TOK_MOD: return ("%");
160 160 case DT_TOK_LNEG: return ("!");
161 161 case DT_TOK_BNEG: return ("~");
162 162 case DT_TOK_ADDADD: return ("++");
163 163 case DT_TOK_PREINC: return ("++");
164 164 case DT_TOK_POSTINC: return ("++");
165 165 case DT_TOK_SUBSUB: return ("--");
166 166 case DT_TOK_PREDEC: return ("--");
167 167 case DT_TOK_POSTDEC: return ("--");
168 168 case DT_TOK_IPOS: return ("+");
169 169 case DT_TOK_INEG: return ("-");
170 170 case DT_TOK_DEREF: return ("*");
171 171 case DT_TOK_ADDROF: return ("&");
172 172 case DT_TOK_OFFSETOF: return ("offsetof");
173 173 case DT_TOK_SIZEOF: return ("sizeof");
174 174 case DT_TOK_STRINGOF: return ("stringof");
175 175 case DT_TOK_XLATE: return ("xlate");
176 176 case DT_TOK_LPAR: return ("(");
177 177 case DT_TOK_RPAR: return (")");
178 178 case DT_TOK_LBRAC: return ("[");
179 179 case DT_TOK_RBRAC: return ("]");
180 180 case DT_TOK_PTR: return ("->");
181 181 case DT_TOK_DOT: return (".");
182 182 case DT_TOK_STRING: return ("<string>");
183 183 case DT_TOK_IDENT: return ("<ident>");
184 184 case DT_TOK_TNAME: return ("<type>");
185 185 case DT_TOK_INT: return ("<int>");
186 186 default: return ("<?>");
187 187 }
188 188 }
189 189
190 190 int
191 191 dt_type_lookup(const char *s, dtrace_typeinfo_t *tip)
192 192 {
193 193 static const char delimiters[] = " \t\n\r\v\f*`";
194 194 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
195 195 const char *p, *q, *r, *end, *obj;
196 196
197 197 for (p = s, end = s + strlen(s); *p != '\0'; p = q) {
198 198 while (isspace(*p))
199 199 p++; /* skip leading whitespace prior to token */
200 200
201 201 if (p == end || (q = strpbrk(p + 1, delimiters)) == NULL)
202 202 break; /* empty string or single token remaining */
203 203
204 204 if (*q == '`') {
205 205 char *object = alloca((size_t)(q - p) + 1);
206 206 char *type = alloca((size_t)(end - s) + 1);
207 207
208 208 /*
209 209 * Copy from the start of the token (p) to the location
210 210 * backquote (q) to extract the nul-terminated object.
211 211 */
212 212 bcopy(p, object, (size_t)(q - p));
213 213 object[(size_t)(q - p)] = '\0';
214 214
215 215 /*
216 216 * Copy the original string up to the start of this
217 217 * token (p) into type, and then concatenate everything
218 218 * after q. This is the type name without the object.
219 219 */
220 220 bcopy(s, type, (size_t)(p - s));
221 221 bcopy(q + 1, type + (size_t)(p - s), strlen(q + 1) + 1);
222 222
223 223 /*
224 224 * There may be at most three delimeters. The second
225 225 * delimeter is usually used to distinguish the type
226 226 * within a given module, however, there could be a link
227 227 * map id on the scene in which case that delimeter
228 228 * would be the third. We determine presence of the lmid
229 229 * if it rouglhly meets the from LM[0-9]
230 230 */
231 231 if ((r = strchr(q + 1, '`')) != NULL &&
232 232 ((r = strchr(r + 1, '`')) != NULL)) {
233 233 if (strchr(r + 1, '`') != NULL)
234 234 return (dt_set_errno(dtp,
235 235 EDT_BADSCOPE));
236 236 if (q[1] != 'L' || q[2] != 'M')
237 237 return (dt_set_errno(dtp,
238 238 EDT_BADSCOPE));
239 239 }
240 240
241 241 return (dtrace_lookup_by_type(dtp, object, type, tip));
242 242 }
243 243 }
244 244
245 245 if (yypcb->pcb_idepth != 0)
246 246 obj = DTRACE_OBJ_CDEFS;
247 247 else
248 248 obj = DTRACE_OBJ_EVERY;
249 249
250 250 return (dtrace_lookup_by_type(dtp, obj, s, tip));
251 251 }
252 252
253 253 /*
254 254 * When we parse type expressions or parse an expression with unary "&", we
255 255 * need to find a type that is a pointer to a previously known type.
256 256 * Unfortunately CTF is limited to a per-container view, so ctf_type_pointer()
257 257 * alone does not suffice for our needs. We provide a more intelligent wrapper
258 258 * for the compiler that attempts to compute a pointer to either the given type
259 259 * or its base (that is, we try both "foo_t *" and "struct foo *"), and also
260 260 * to potentially construct the required type on-the-fly.
261 261 */
262 262 int
263 263 dt_type_pointer(dtrace_typeinfo_t *tip)
264 264 {
265 265 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
266 266 ctf_file_t *ctfp = tip->dtt_ctfp;
267 267 ctf_id_t type = tip->dtt_type;
268 268 ctf_id_t base = ctf_type_resolve(ctfp, type);
269 269 uint_t bflags = tip->dtt_flags;
270 270
271 271 dt_module_t *dmp;
272 272 ctf_id_t ptr;
273 273
274 274 if ((ptr = ctf_type_pointer(ctfp, type)) != CTF_ERR ||
275 275 (ptr = ctf_type_pointer(ctfp, base)) != CTF_ERR) {
276 276 tip->dtt_type = ptr;
277 277 return (0);
278 278 }
279 279
280 280 if (yypcb->pcb_idepth != 0)
281 281 dmp = dtp->dt_cdefs;
282 282 else
283 283 dmp = dtp->dt_ddefs;
284 284
285 285 if (ctfp != dmp->dm_ctfp && ctfp != ctf_parent_file(dmp->dm_ctfp) &&
286 286 (type = ctf_add_type(dmp->dm_ctfp, ctfp, type)) == CTF_ERR) {
287 287 dtp->dt_ctferr = ctf_errno(dmp->dm_ctfp);
288 288 return (dt_set_errno(dtp, EDT_CTF));
289 289 }
290 290
291 291 ptr = ctf_add_pointer(dmp->dm_ctfp, CTF_ADD_ROOT, type);
292 292
293 293 if (ptr == CTF_ERR || ctf_update(dmp->dm_ctfp) == CTF_ERR) {
294 294 dtp->dt_ctferr = ctf_errno(dmp->dm_ctfp);
295 295 return (dt_set_errno(dtp, EDT_CTF));
296 296 }
297 297
298 298 tip->dtt_object = dmp->dm_name;
299 299 tip->dtt_ctfp = dmp->dm_ctfp;
300 300 tip->dtt_type = ptr;
301 301 tip->dtt_flags = bflags;
302 302
303 303 return (0);
304 304 }
305 305
306 306 const char *
307 307 dt_type_name(ctf_file_t *ctfp, ctf_id_t type, char *buf, size_t len)
308 308 {
309 309 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
310 310
311 311 if (ctfp == DT_FPTR_CTFP(dtp) && type == DT_FPTR_TYPE(dtp))
312 312 (void) snprintf(buf, len, "function pointer");
313 313 else if (ctfp == DT_FUNC_CTFP(dtp) && type == DT_FUNC_TYPE(dtp))
314 314 (void) snprintf(buf, len, "function");
315 315 else if (ctfp == DT_DYN_CTFP(dtp) && type == DT_DYN_TYPE(dtp))
316 316 (void) snprintf(buf, len, "dynamic variable");
317 317 else if (ctfp == NULL)
318 318 (void) snprintf(buf, len, "<none>");
319 319 else if (ctf_type_name(ctfp, type, buf, len) == NULL)
320 320 (void) snprintf(buf, len, "unknown");
321 321
322 322 return (buf);
323 323 }
324 324
325 325 /*
326 326 * Perform the "usual arithmetic conversions" to determine which of the two
327 327 * input operand types should be promoted and used as a result type. The
328 328 * rules for this are described in ISOC[6.3.1.8] and K&R[A6.5].
329 329 */
330 330 static void
331 331 dt_type_promote(dt_node_t *lp, dt_node_t *rp, ctf_file_t **ofp, ctf_id_t *otype)
332 332 {
333 333 ctf_file_t *lfp = lp->dn_ctfp;
334 334 ctf_id_t ltype = lp->dn_type;
335 335
336 336 ctf_file_t *rfp = rp->dn_ctfp;
337 337 ctf_id_t rtype = rp->dn_type;
338 338
339 339 ctf_id_t lbase = ctf_type_resolve(lfp, ltype);
340 340 uint_t lkind = ctf_type_kind(lfp, lbase);
341 341
342 342 ctf_id_t rbase = ctf_type_resolve(rfp, rtype);
343 343 uint_t rkind = ctf_type_kind(rfp, rbase);
344 344
345 345 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
346 346 ctf_encoding_t le, re;
347 347 uint_t lrank, rrank;
348 348
349 349 assert(lkind == CTF_K_INTEGER || lkind == CTF_K_ENUM);
350 350 assert(rkind == CTF_K_INTEGER || rkind == CTF_K_ENUM);
351 351
352 352 if (lkind == CTF_K_ENUM) {
353 353 lfp = DT_INT_CTFP(dtp);
354 354 ltype = lbase = DT_INT_TYPE(dtp);
355 355 }
356 356
357 357 if (rkind == CTF_K_ENUM) {
358 358 rfp = DT_INT_CTFP(dtp);
359 359 rtype = rbase = DT_INT_TYPE(dtp);
360 360 }
361 361
362 362 if (ctf_type_encoding(lfp, lbase, &le) == CTF_ERR) {
363 363 yypcb->pcb_hdl->dt_ctferr = ctf_errno(lfp);
364 364 longjmp(yypcb->pcb_jmpbuf, EDT_CTF);
365 365 }
366 366
367 367 if (ctf_type_encoding(rfp, rbase, &re) == CTF_ERR) {
368 368 yypcb->pcb_hdl->dt_ctferr = ctf_errno(rfp);
369 369 longjmp(yypcb->pcb_jmpbuf, EDT_CTF);
370 370 }
371 371
372 372 /*
373 373 * Compute an integer rank based on the size and unsigned status.
374 374 * If rank is identical, pick the "larger" of the equivalent types
375 375 * which we define as having a larger base ctf_id_t. If rank is
376 376 * different, pick the type with the greater rank.
377 377 */
378 378 lrank = le.cte_bits + ((le.cte_format & CTF_INT_SIGNED) == 0);
379 379 rrank = re.cte_bits + ((re.cte_format & CTF_INT_SIGNED) == 0);
380 380
381 381 if (lrank == rrank) {
382 382 if (lbase - rbase < 0)
383 383 goto return_rtype;
384 384 else
385 385 goto return_ltype;
386 386 } else if (lrank > rrank) {
387 387 goto return_ltype;
388 388 } else
389 389 goto return_rtype;
390 390
391 391 return_ltype:
392 392 *ofp = lfp;
393 393 *otype = ltype;
394 394 return;
395 395
396 396 return_rtype:
397 397 *ofp = rfp;
398 398 *otype = rtype;
399 399 }
400 400
401 401 void
402 402 dt_node_promote(dt_node_t *lp, dt_node_t *rp, dt_node_t *dnp)
403 403 {
404 404 dt_type_promote(lp, rp, &dnp->dn_ctfp, &dnp->dn_type);
405 405 dt_node_type_assign(dnp, dnp->dn_ctfp, dnp->dn_type, B_FALSE);
406 406 dt_node_attr_assign(dnp, dt_attr_min(lp->dn_attr, rp->dn_attr));
407 407 }
408 408
409 409 const char *
410 410 dt_node_name(const dt_node_t *dnp, char *buf, size_t len)
411 411 {
412 412 char n1[DT_TYPE_NAMELEN];
413 413 char n2[DT_TYPE_NAMELEN];
414 414
415 415 const char *prefix = "", *suffix = "";
416 416 const dtrace_syminfo_t *dts;
417 417 char *s;
418 418
419 419 switch (dnp->dn_kind) {
420 420 case DT_NODE_INT:
421 421 (void) snprintf(buf, len, "integer constant 0x%llx",
422 422 (u_longlong_t)dnp->dn_value);
423 423 break;
424 424 case DT_NODE_STRING:
425 425 s = strchr2esc(dnp->dn_string, strlen(dnp->dn_string));
426 426 (void) snprintf(buf, len, "string constant \"%s\"",
427 427 s != NULL ? s : dnp->dn_string);
428 428 free(s);
429 429 break;
430 430 case DT_NODE_IDENT:
431 431 (void) snprintf(buf, len, "identifier %s", dnp->dn_string);
432 432 break;
433 433 case DT_NODE_VAR:
434 434 case DT_NODE_FUNC:
435 435 case DT_NODE_AGG:
436 436 case DT_NODE_INLINE:
437 437 switch (dnp->dn_ident->di_kind) {
438 438 case DT_IDENT_FUNC:
439 439 case DT_IDENT_AGGFUNC:
440 440 case DT_IDENT_ACTFUNC:
441 441 suffix = "( )";
442 442 break;
443 443 case DT_IDENT_AGG:
444 444 prefix = "@";
445 445 break;
446 446 }
447 447 (void) snprintf(buf, len, "%s %s%s%s",
448 448 dt_idkind_name(dnp->dn_ident->di_kind),
449 449 prefix, dnp->dn_ident->di_name, suffix);
450 450 break;
451 451 case DT_NODE_SYM:
452 452 dts = dnp->dn_ident->di_data;
453 453 (void) snprintf(buf, len, "symbol %s`%s",
454 454 dts->dts_object, dts->dts_name);
455 455 break;
456 456 case DT_NODE_TYPE:
457 457 (void) snprintf(buf, len, "type %s",
458 458 dt_node_type_name(dnp, n1, sizeof (n1)));
459 459 break;
460 460 case DT_NODE_OP1:
461 461 case DT_NODE_OP2:
462 462 case DT_NODE_OP3:
463 463 (void) snprintf(buf, len, "operator %s", opstr(dnp->dn_op));
464 464 break;
465 465 case DT_NODE_DEXPR:
466 466 case DT_NODE_DFUNC:
467 467 if (dnp->dn_expr)
468 468 return (dt_node_name(dnp->dn_expr, buf, len));
469 469 (void) snprintf(buf, len, "%s", "statement");
470 470 break;
471 471 case DT_NODE_PDESC:
472 472 if (dnp->dn_desc->dtpd_id == 0) {
473 473 (void) snprintf(buf, len,
474 474 "probe description %s:%s:%s:%s",
475 475 dnp->dn_desc->dtpd_provider, dnp->dn_desc->dtpd_mod,
476 476 dnp->dn_desc->dtpd_func, dnp->dn_desc->dtpd_name);
477 477 } else {
478 478 (void) snprintf(buf, len, "probe description %u",
479 479 dnp->dn_desc->dtpd_id);
480 480 }
481 481 break;
482 482 case DT_NODE_CLAUSE:
483 483 (void) snprintf(buf, len, "%s", "clause");
484 484 break;
485 485 case DT_NODE_MEMBER:
486 486 (void) snprintf(buf, len, "member %s", dnp->dn_membname);
487 487 break;
488 488 case DT_NODE_XLATOR:
489 489 (void) snprintf(buf, len, "translator <%s> (%s)",
490 490 dt_type_name(dnp->dn_xlator->dx_dst_ctfp,
491 491 dnp->dn_xlator->dx_dst_type, n1, sizeof (n1)),
492 492 dt_type_name(dnp->dn_xlator->dx_src_ctfp,
493 493 dnp->dn_xlator->dx_src_type, n2, sizeof (n2)));
494 494 break;
495 495 case DT_NODE_PROG:
496 496 (void) snprintf(buf, len, "%s", "program");
497 497 break;
498 498 default:
499 499 (void) snprintf(buf, len, "node <%u>", dnp->dn_kind);
500 500 break;
501 501 }
502 502
503 503 return (buf);
504 504 }
505 505
506 506 /*
507 507 * dt_node_xalloc() can be used to create new parse nodes from any libdtrace
508 508 * caller. The caller is responsible for assigning dn_link appropriately.
509 509 */
510 510 dt_node_t *
511 511 dt_node_xalloc(dtrace_hdl_t *dtp, int kind)
512 512 {
513 513 dt_node_t *dnp = dt_alloc(dtp, sizeof (dt_node_t));
514 514
515 515 if (dnp == NULL)
516 516 return (NULL);
517 517
518 518 dnp->dn_ctfp = NULL;
519 519 dnp->dn_type = CTF_ERR;
520 520 dnp->dn_kind = (uchar_t)kind;
521 521 dnp->dn_flags = 0;
522 522 dnp->dn_op = 0;
523 523 dnp->dn_line = -1;
524 524 dnp->dn_reg = -1;
525 525 dnp->dn_attr = _dtrace_defattr;
526 526 dnp->dn_list = NULL;
527 527 dnp->dn_link = NULL;
528 528 bzero(&dnp->dn_u, sizeof (dnp->dn_u));
529 529
530 530 return (dnp);
531 531 }
532 532
533 533 /*
534 534 * dt_node_alloc() is used to create new parse nodes from the parser. It
535 535 * assigns the node location based on the current lexer line number and places
536 536 * the new node on the default allocation list. If allocation fails, we
537 537 * automatically longjmp the caller back to the enclosing compilation call.
538 538 */
539 539 static dt_node_t *
540 540 dt_node_alloc(int kind)
541 541 {
542 542 dt_node_t *dnp = dt_node_xalloc(yypcb->pcb_hdl, kind);
543 543
544 544 if (dnp == NULL)
545 545 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
546 546
547 547 dnp->dn_line = yylineno;
548 548 dnp->dn_link = yypcb->pcb_list;
549 549 yypcb->pcb_list = dnp;
550 550
551 551 return (dnp);
552 552 }
553 553
554 554 void
555 555 dt_node_free(dt_node_t *dnp)
556 556 {
557 557 uchar_t kind = dnp->dn_kind;
558 558
559 559 dnp->dn_kind = DT_NODE_FREE;
560 560
561 561 switch (kind) {
562 562 case DT_NODE_STRING:
563 563 case DT_NODE_IDENT:
564 564 case DT_NODE_TYPE:
565 565 free(dnp->dn_string);
566 566 dnp->dn_string = NULL;
567 567 break;
568 568
569 569 case DT_NODE_VAR:
570 570 case DT_NODE_FUNC:
571 571 case DT_NODE_PROBE:
572 572 if (dnp->dn_ident != NULL) {
573 573 if (dnp->dn_ident->di_flags & DT_IDFLG_ORPHAN)
574 574 dt_ident_destroy(dnp->dn_ident);
575 575 dnp->dn_ident = NULL;
576 576 }
577 577 dt_node_list_free(&dnp->dn_args);
578 578 break;
579 579
580 580 case DT_NODE_OP1:
581 581 if (dnp->dn_child != NULL) {
582 582 dt_node_free(dnp->dn_child);
583 583 dnp->dn_child = NULL;
584 584 }
585 585 break;
586 586
587 587 case DT_NODE_OP3:
588 588 if (dnp->dn_expr != NULL) {
589 589 dt_node_free(dnp->dn_expr);
590 590 dnp->dn_expr = NULL;
591 591 }
592 592 /*FALLTHRU*/
593 593 case DT_NODE_OP2:
594 594 if (dnp->dn_left != NULL) {
595 595 dt_node_free(dnp->dn_left);
596 596 dnp->dn_left = NULL;
597 597 }
598 598 if (dnp->dn_right != NULL) {
599 599 dt_node_free(dnp->dn_right);
600 600 dnp->dn_right = NULL;
601 601 }
602 602 break;
603 603
604 604 case DT_NODE_DEXPR:
605 605 case DT_NODE_DFUNC:
606 606 if (dnp->dn_expr != NULL) {
607 607 dt_node_free(dnp->dn_expr);
608 608 dnp->dn_expr = NULL;
609 609 }
610 610 break;
611 611
612 612 case DT_NODE_AGG:
613 613 if (dnp->dn_aggfun != NULL) {
614 614 dt_node_free(dnp->dn_aggfun);
615 615 dnp->dn_aggfun = NULL;
616 616 }
617 617 dt_node_list_free(&dnp->dn_aggtup);
618 618 break;
619 619
620 620 case DT_NODE_PDESC:
621 621 free(dnp->dn_spec);
622 622 dnp->dn_spec = NULL;
623 623 free(dnp->dn_desc);
624 624 dnp->dn_desc = NULL;
625 625 break;
626 626
627 627 case DT_NODE_CLAUSE:
628 628 if (dnp->dn_pred != NULL)
629 629 dt_node_free(dnp->dn_pred);
630 630 if (dnp->dn_locals != NULL)
631 631 dt_idhash_destroy(dnp->dn_locals);
632 632 dt_node_list_free(&dnp->dn_pdescs);
633 633 dt_node_list_free(&dnp->dn_acts);
634 634 break;
635 635
636 636 case DT_NODE_MEMBER:
637 637 free(dnp->dn_membname);
638 638 dnp->dn_membname = NULL;
639 639 if (dnp->dn_membexpr != NULL) {
640 640 dt_node_free(dnp->dn_membexpr);
641 641 dnp->dn_membexpr = NULL;
642 642 }
643 643 break;
644 644
645 645 case DT_NODE_PROVIDER:
646 646 dt_node_list_free(&dnp->dn_probes);
647 647 free(dnp->dn_provname);
648 648 dnp->dn_provname = NULL;
649 649 break;
650 650
651 651 case DT_NODE_PROG:
652 652 dt_node_list_free(&dnp->dn_list);
653 653 break;
654 654 }
655 655 }
656 656
657 657 void
658 658 dt_node_attr_assign(dt_node_t *dnp, dtrace_attribute_t attr)
659 659 {
660 660 if ((yypcb->pcb_cflags & DTRACE_C_EATTR) &&
661 661 (dt_attr_cmp(attr, yypcb->pcb_amin) < 0)) {
662 662 char a[DTRACE_ATTR2STR_MAX];
663 663 char s[BUFSIZ];
664 664
665 665 dnerror(dnp, D_ATTR_MIN, "attributes for %s (%s) are less than "
666 666 "predefined minimum\n", dt_node_name(dnp, s, sizeof (s)),
667 667 dtrace_attr2str(attr, a, sizeof (a)));
668 668 }
669 669
670 670 dnp->dn_attr = attr;
671 671 }
672 672
673 673 void
674 674 dt_node_type_assign(dt_node_t *dnp, ctf_file_t *fp, ctf_id_t type,
675 675 boolean_t user)
676 676 {
677 677 ctf_id_t base = ctf_type_resolve(fp, type);
678 678 uint_t kind = ctf_type_kind(fp, base);
679 679 ctf_encoding_t e;
680 680
681 681 dnp->dn_flags &=
682 682 ~(DT_NF_SIGNED | DT_NF_REF | DT_NF_BITFIELD | DT_NF_USERLAND);
683 683
684 684 if (kind == CTF_K_INTEGER && ctf_type_encoding(fp, base, &e) == 0) {
685 685 size_t size = e.cte_bits / NBBY;
686 686
687 687 if (size > 8 || (e.cte_bits % NBBY) != 0 || (size & (size - 1)))
688 688 dnp->dn_flags |= DT_NF_BITFIELD;
689 689
690 690 if (e.cte_format & CTF_INT_SIGNED)
691 691 dnp->dn_flags |= DT_NF_SIGNED;
692 692 }
693 693
694 694 if (kind == CTF_K_FLOAT && ctf_type_encoding(fp, base, &e) == 0) {
695 695 if (e.cte_bits / NBBY > sizeof (uint64_t))
696 696 dnp->dn_flags |= DT_NF_REF;
697 697 }
698 698
699 699 if (kind == CTF_K_STRUCT || kind == CTF_K_UNION ||
700 700 kind == CTF_K_FORWARD ||
701 701 kind == CTF_K_ARRAY || kind == CTF_K_FUNCTION)
702 702 dnp->dn_flags |= DT_NF_REF;
703 703 else if (yypcb != NULL && fp == DT_DYN_CTFP(yypcb->pcb_hdl) &&
704 704 type == DT_DYN_TYPE(yypcb->pcb_hdl))
705 705 dnp->dn_flags |= DT_NF_REF;
706 706
707 707 if (user)
708 708 dnp->dn_flags |= DT_NF_USERLAND;
709 709
710 710 dnp->dn_flags |= DT_NF_COOKED;
711 711 dnp->dn_ctfp = fp;
712 712 dnp->dn_type = type;
713 713 }
714 714
715 715 void
716 716 dt_node_type_propagate(const dt_node_t *src, dt_node_t *dst)
717 717 {
718 718 assert(src->dn_flags & DT_NF_COOKED);
719 719 dst->dn_flags = src->dn_flags & ~DT_NF_LVALUE;
720 720 dst->dn_ctfp = src->dn_ctfp;
721 721 dst->dn_type = src->dn_type;
722 722 }
723 723
724 724 const char *
725 725 dt_node_type_name(const dt_node_t *dnp, char *buf, size_t len)
726 726 {
727 727 if (dt_node_is_dynamic(dnp) && dnp->dn_ident != NULL) {
728 728 (void) snprintf(buf, len, "%s",
729 729 dt_idkind_name(dt_ident_resolve(dnp->dn_ident)->di_kind));
730 730 return (buf);
731 731 }
732 732
733 733 if (dnp->dn_flags & DT_NF_USERLAND) {
734 734 size_t n = snprintf(buf, len, "userland ");
735 735 len = len > n ? len - n : 0;
736 736 (void) dt_type_name(dnp->dn_ctfp, dnp->dn_type, buf + n, len);
737 737 return (buf);
738 738 }
739 739
740 740 return (dt_type_name(dnp->dn_ctfp, dnp->dn_type, buf, len));
741 741 }
742 742
743 743 size_t
744 744 dt_node_type_size(const dt_node_t *dnp)
745 745 {
746 746 ctf_id_t base;
747 747 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
748 748
749 749 if (dnp->dn_kind == DT_NODE_STRING)
750 750 return (strlen(dnp->dn_string) + 1);
751 751
752 752 if (dt_node_is_dynamic(dnp) && dnp->dn_ident != NULL)
753 753 return (dt_ident_size(dnp->dn_ident));
754 754
755 755 base = ctf_type_resolve(dnp->dn_ctfp, dnp->dn_type);
756 756
757 757 if (ctf_type_kind(dnp->dn_ctfp, base) == CTF_K_FORWARD)
758 758 return (0);
759 759
760 760 /*
761 761 * Here we have a 32-bit user pointer that is being used with a 64-bit
762 762 * kernel. When we're using it and its tagged as a userland reference --
763 763 * then we need to keep it as a 32-bit pointer. However, if we are
764 764 * referring to it as a kernel address, eg. being used after a copyin()
765 765 * then we need to make sure that we actually return the kernel's size
766 766 * of a pointer, 8 bytes.
767 767 */
768 768 if (ctf_type_kind(dnp->dn_ctfp, base) == CTF_K_POINTER &&
769 769 ctf_getmodel(dnp->dn_ctfp) == CTF_MODEL_ILP32 &&
770 770 !(dnp->dn_flags & DT_NF_USERLAND) &&
771 771 dtp->dt_conf.dtc_ctfmodel == CTF_MODEL_LP64)
772 772 return (8);
773 773
774 774 return (ctf_type_size(dnp->dn_ctfp, dnp->dn_type));
775 775 }
776 776
777 777 /*
778 778 * Determine if the specified parse tree node references an identifier of the
779 779 * specified kind, and if so return a pointer to it; otherwise return NULL.
780 780 * This function resolves the identifier itself, following through any inlines.
781 781 */
782 782 dt_ident_t *
783 783 dt_node_resolve(const dt_node_t *dnp, uint_t idkind)
784 784 {
785 785 dt_ident_t *idp;
786 786
787 787 switch (dnp->dn_kind) {
788 788 case DT_NODE_VAR:
789 789 case DT_NODE_SYM:
790 790 case DT_NODE_FUNC:
791 791 case DT_NODE_AGG:
792 792 case DT_NODE_INLINE:
793 793 case DT_NODE_PROBE:
794 794 idp = dt_ident_resolve(dnp->dn_ident);
795 795 return (idp->di_kind == idkind ? idp : NULL);
796 796 }
797 797
798 798 if (dt_node_is_dynamic(dnp)) {
799 799 idp = dt_ident_resolve(dnp->dn_ident);
800 800 return (idp->di_kind == idkind ? idp : NULL);
801 801 }
802 802
803 803 return (NULL);
804 804 }
805 805
806 806 size_t
807 807 dt_node_sizeof(const dt_node_t *dnp)
808 808 {
809 809 dtrace_syminfo_t *sip;
810 810 GElf_Sym sym;
811 811 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
812 812
813 813 /*
814 814 * The size of the node as used for the sizeof() operator depends on
815 815 * the kind of the node. If the node is a SYM, the size is obtained
816 816 * from the symbol table; if it is not a SYM, the size is determined
817 817 * from the node's type. This is slightly different from C's sizeof()
818 818 * operator in that (for example) when applied to a function, sizeof()
819 819 * will evaluate to the length of the function rather than the size of
820 820 * the function type.
821 821 */
822 822 if (dnp->dn_kind != DT_NODE_SYM)
823 823 return (dt_node_type_size(dnp));
824 824
825 825 sip = dnp->dn_ident->di_data;
826 826
827 827 if (dtrace_lookup_by_name(dtp, sip->dts_object,
828 828 sip->dts_name, &sym, NULL) == -1)
829 829 return (0);
830 830
831 831 return (sym.st_size);
832 832 }
833 833
834 834 int
835 835 dt_node_is_integer(const dt_node_t *dnp)
836 836 {
837 837 ctf_file_t *fp = dnp->dn_ctfp;
838 838 ctf_encoding_t e;
839 839 ctf_id_t type;
840 840 uint_t kind;
841 841
842 842 assert(dnp->dn_flags & DT_NF_COOKED);
843 843
844 844 type = ctf_type_resolve(fp, dnp->dn_type);
845 845 kind = ctf_type_kind(fp, type);
846 846
847 847 if (kind == CTF_K_INTEGER &&
848 848 ctf_type_encoding(fp, type, &e) == 0 && IS_VOID(e))
849 849 return (0); /* void integer */
850 850
851 851 return (kind == CTF_K_INTEGER || kind == CTF_K_ENUM);
852 852 }
853 853
854 854 int
855 855 dt_node_is_float(const dt_node_t *dnp)
856 856 {
857 857 ctf_file_t *fp = dnp->dn_ctfp;
858 858 ctf_encoding_t e;
859 859 ctf_id_t type;
860 860 uint_t kind;
861 861
862 862 assert(dnp->dn_flags & DT_NF_COOKED);
863 863
864 864 type = ctf_type_resolve(fp, dnp->dn_type);
865 865 kind = ctf_type_kind(fp, type);
866 866
867 867 return (kind == CTF_K_FLOAT &&
868 868 ctf_type_encoding(dnp->dn_ctfp, type, &e) == 0 && (
869 869 e.cte_format == CTF_FP_SINGLE || e.cte_format == CTF_FP_DOUBLE ||
870 870 e.cte_format == CTF_FP_LDOUBLE));
871 871 }
872 872
873 873 int
874 874 dt_node_is_scalar(const dt_node_t *dnp)
875 875 {
876 876 ctf_file_t *fp = dnp->dn_ctfp;
877 877 ctf_encoding_t e;
878 878 ctf_id_t type;
879 879 uint_t kind;
880 880
881 881 assert(dnp->dn_flags & DT_NF_COOKED);
882 882
883 883 type = ctf_type_resolve(fp, dnp->dn_type);
884 884 kind = ctf_type_kind(fp, type);
885 885
886 886 if (kind == CTF_K_INTEGER &&
887 887 ctf_type_encoding(fp, type, &e) == 0 && IS_VOID(e))
888 888 return (0); /* void cannot be used as a scalar */
889 889
890 890 return (kind == CTF_K_INTEGER || kind == CTF_K_ENUM ||
891 891 kind == CTF_K_POINTER);
892 892 }
893 893
894 894 int
895 895 dt_node_is_arith(const dt_node_t *dnp)
896 896 {
897 897 ctf_file_t *fp = dnp->dn_ctfp;
898 898 ctf_encoding_t e;
899 899 ctf_id_t type;
900 900 uint_t kind;
901 901
902 902 assert(dnp->dn_flags & DT_NF_COOKED);
903 903
904 904 type = ctf_type_resolve(fp, dnp->dn_type);
905 905 kind = ctf_type_kind(fp, type);
906 906
907 907 if (kind == CTF_K_INTEGER)
908 908 return (ctf_type_encoding(fp, type, &e) == 0 && !IS_VOID(e));
909 909 else
910 910 return (kind == CTF_K_ENUM);
911 911 }
912 912
913 913 int
914 914 dt_node_is_vfptr(const dt_node_t *dnp)
915 915 {
916 916 ctf_file_t *fp = dnp->dn_ctfp;
917 917 ctf_encoding_t e;
918 918 ctf_id_t type;
919 919 uint_t kind;
920 920
921 921 assert(dnp->dn_flags & DT_NF_COOKED);
922 922
923 923 type = ctf_type_resolve(fp, dnp->dn_type);
924 924 if (ctf_type_kind(fp, type) != CTF_K_POINTER)
925 925 return (0); /* type is not a pointer */
926 926
927 927 type = ctf_type_resolve(fp, ctf_type_reference(fp, type));
928 928 kind = ctf_type_kind(fp, type);
929 929
930 930 return (kind == CTF_K_FUNCTION || (kind == CTF_K_INTEGER &&
931 931 ctf_type_encoding(fp, type, &e) == 0 && IS_VOID(e)));
932 932 }
933 933
934 934 int
935 935 dt_node_is_dynamic(const dt_node_t *dnp)
936 936 {
937 937 if (dnp->dn_kind == DT_NODE_VAR &&
938 938 (dnp->dn_ident->di_flags & DT_IDFLG_INLINE)) {
939 939 const dt_idnode_t *inp = dnp->dn_ident->di_iarg;
940 940 return (inp->din_root ? dt_node_is_dynamic(inp->din_root) : 0);
941 941 }
942 942
943 943 return (dnp->dn_ctfp == DT_DYN_CTFP(yypcb->pcb_hdl) &&
944 944 dnp->dn_type == DT_DYN_TYPE(yypcb->pcb_hdl));
945 945 }
946 946
947 947 int
948 948 dt_node_is_string(const dt_node_t *dnp)
949 949 {
950 950 return (dnp->dn_ctfp == DT_STR_CTFP(yypcb->pcb_hdl) &&
951 951 dnp->dn_type == DT_STR_TYPE(yypcb->pcb_hdl));
952 952 }
953 953
954 954 int
955 955 dt_node_is_stack(const dt_node_t *dnp)
956 956 {
957 957 return (dnp->dn_ctfp == DT_STACK_CTFP(yypcb->pcb_hdl) &&
958 958 dnp->dn_type == DT_STACK_TYPE(yypcb->pcb_hdl));
959 959 }
960 960
961 961 int
962 962 dt_node_is_symaddr(const dt_node_t *dnp)
963 963 {
964 964 return (dnp->dn_ctfp == DT_SYMADDR_CTFP(yypcb->pcb_hdl) &&
965 965 dnp->dn_type == DT_SYMADDR_TYPE(yypcb->pcb_hdl));
966 966 }
967 967
968 968 int
969 969 dt_node_is_usymaddr(const dt_node_t *dnp)
970 970 {
971 971 return (dnp->dn_ctfp == DT_USYMADDR_CTFP(yypcb->pcb_hdl) &&
972 972 dnp->dn_type == DT_USYMADDR_TYPE(yypcb->pcb_hdl));
973 973 }
974 974
975 975 int
976 976 dt_node_is_strcompat(const dt_node_t *dnp)
977 977 {
978 978 ctf_file_t *fp = dnp->dn_ctfp;
979 979 ctf_encoding_t e;
980 980 ctf_arinfo_t r;
981 981 ctf_id_t base;
982 982 uint_t kind;
983 983
984 984 assert(dnp->dn_flags & DT_NF_COOKED);
985 985
986 986 base = ctf_type_resolve(fp, dnp->dn_type);
987 987 kind = ctf_type_kind(fp, base);
988 988
989 989 if (kind == CTF_K_POINTER &&
990 990 (base = ctf_type_reference(fp, base)) != CTF_ERR &&
991 991 (base = ctf_type_resolve(fp, base)) != CTF_ERR &&
992 992 ctf_type_encoding(fp, base, &e) == 0 && IS_CHAR(e))
993 993 return (1); /* promote char pointer to string */
994 994
995 995 if (kind == CTF_K_ARRAY && ctf_array_info(fp, base, &r) == 0 &&
996 996 (base = ctf_type_resolve(fp, r.ctr_contents)) != CTF_ERR &&
997 997 ctf_type_encoding(fp, base, &e) == 0 && IS_CHAR(e))
998 998 return (1); /* promote char array to string */
999 999
1000 1000 return (0);
1001 1001 }
1002 1002
1003 1003 int
1004 1004 dt_node_is_pointer(const dt_node_t *dnp)
1005 1005 {
1006 1006 ctf_file_t *fp = dnp->dn_ctfp;
1007 1007 uint_t kind;
1008 1008
1009 1009 assert(dnp->dn_flags & DT_NF_COOKED);
1010 1010
1011 1011 if (dt_node_is_string(dnp))
1012 1012 return (0); /* string are pass-by-ref but act like structs */
1013 1013
1014 1014 kind = ctf_type_kind(fp, ctf_type_resolve(fp, dnp->dn_type));
1015 1015 return (kind == CTF_K_POINTER || kind == CTF_K_ARRAY);
1016 1016 }
1017 1017
1018 1018 int
1019 1019 dt_node_is_void(const dt_node_t *dnp)
1020 1020 {
1021 1021 ctf_file_t *fp = dnp->dn_ctfp;
1022 1022 ctf_encoding_t e;
1023 1023 ctf_id_t type;
1024 1024
1025 1025 if (dt_node_is_dynamic(dnp))
1026 1026 return (0); /* <DYN> is an alias for void but not the same */
1027 1027
1028 1028 if (dt_node_is_stack(dnp))
1029 1029 return (0);
1030 1030
1031 1031 if (dt_node_is_symaddr(dnp) || dt_node_is_usymaddr(dnp))
1032 1032 return (0);
1033 1033
1034 1034 type = ctf_type_resolve(fp, dnp->dn_type);
1035 1035
1036 1036 return (ctf_type_kind(fp, type) == CTF_K_INTEGER &&
1037 1037 ctf_type_encoding(fp, type, &e) == 0 && IS_VOID(e));
1038 1038 }
1039 1039
1040 1040 int
1041 1041 dt_node_is_ptrcompat(const dt_node_t *lp, const dt_node_t *rp,
1042 1042 ctf_file_t **fpp, ctf_id_t *tp)
1043 1043 {
1044 1044 ctf_file_t *lfp = lp->dn_ctfp;
1045 1045 ctf_file_t *rfp = rp->dn_ctfp;
1046 1046
1047 1047 ctf_id_t lbase = CTF_ERR, rbase = CTF_ERR;
1048 1048 ctf_id_t lref = CTF_ERR, rref = CTF_ERR;
1049 1049
1050 1050 int lp_is_void, rp_is_void, lp_is_int, rp_is_int, compat;
1051 1051 uint_t lkind, rkind;
1052 1052 ctf_encoding_t e;
1053 1053 ctf_arinfo_t r;
1054 1054
1055 1055 assert(lp->dn_flags & DT_NF_COOKED);
1056 1056 assert(rp->dn_flags & DT_NF_COOKED);
1057 1057
1058 1058 if (dt_node_is_dynamic(lp) || dt_node_is_dynamic(rp))
1059 1059 return (0); /* fail if either node is a dynamic variable */
1060 1060
1061 1061 lp_is_int = dt_node_is_integer(lp);
1062 1062 rp_is_int = dt_node_is_integer(rp);
1063 1063
1064 1064 if (lp_is_int && rp_is_int)
1065 1065 return (0); /* fail if both nodes are integers */
1066 1066
1067 1067 if (lp_is_int && (lp->dn_kind != DT_NODE_INT || lp->dn_value != 0))
1068 1068 return (0); /* fail if lp is an integer that isn't 0 constant */
1069 1069
1070 1070 if (rp_is_int && (rp->dn_kind != DT_NODE_INT || rp->dn_value != 0))
1071 1071 return (0); /* fail if rp is an integer that isn't 0 constant */
1072 1072
1073 1073 if ((lp_is_int == 0 && rp_is_int == 0) && (
1074 1074 (lp->dn_flags & DT_NF_USERLAND) ^ (rp->dn_flags & DT_NF_USERLAND)))
1075 1075 return (0); /* fail if only one pointer is a userland address */
1076 1076
1077 1077 /*
1078 1078 * Resolve the left-hand and right-hand types to their base type, and
1079 1079 * then resolve the referenced type as well (assuming the base type
1080 1080 * is CTF_K_POINTER or CTF_K_ARRAY). Otherwise [lr]ref = CTF_ERR.
1081 1081 */
1082 1082 if (!lp_is_int) {
1083 1083 lbase = ctf_type_resolve(lfp, lp->dn_type);
1084 1084 lkind = ctf_type_kind(lfp, lbase);
1085 1085
1086 1086 if (lkind == CTF_K_POINTER) {
1087 1087 lref = ctf_type_resolve(lfp,
1088 1088 ctf_type_reference(lfp, lbase));
1089 1089 } else if (lkind == CTF_K_ARRAY &&
1090 1090 ctf_array_info(lfp, lbase, &r) == 0) {
1091 1091 lref = ctf_type_resolve(lfp, r.ctr_contents);
1092 1092 }
1093 1093 }
1094 1094
1095 1095 if (!rp_is_int) {
1096 1096 rbase = ctf_type_resolve(rfp, rp->dn_type);
1097 1097 rkind = ctf_type_kind(rfp, rbase);
1098 1098
1099 1099 if (rkind == CTF_K_POINTER) {
1100 1100 rref = ctf_type_resolve(rfp,
1101 1101 ctf_type_reference(rfp, rbase));
1102 1102 } else if (rkind == CTF_K_ARRAY &&
1103 1103 ctf_array_info(rfp, rbase, &r) == 0) {
1104 1104 rref = ctf_type_resolve(rfp, r.ctr_contents);
1105 1105 }
1106 1106 }
1107 1107
1108 1108 /*
1109 1109 * We know that one or the other type may still be a zero-valued
1110 1110 * integer constant. To simplify the code below, set the integer
1111 1111 * type variables equal to the non-integer types and proceed.
1112 1112 */
1113 1113 if (lp_is_int) {
1114 1114 lbase = rbase;
1115 1115 lkind = rkind;
1116 1116 lref = rref;
1117 1117 lfp = rfp;
1118 1118 } else if (rp_is_int) {
1119 1119 rbase = lbase;
1120 1120 rkind = lkind;
1121 1121 rref = lref;
1122 1122 rfp = lfp;
1123 1123 }
1124 1124
1125 1125 lp_is_void = ctf_type_encoding(lfp, lref, &e) == 0 && IS_VOID(e);
1126 1126 rp_is_void = ctf_type_encoding(rfp, rref, &e) == 0 && IS_VOID(e);
1127 1127
1128 1128 /*
1129 1129 * The types are compatible if both are pointers to the same type, or
1130 1130 * if either pointer is a void pointer. If they are compatible, set
1131 1131 * tp to point to the more specific pointer type and return it.
1132 1132 */
1133 1133 compat = (lkind == CTF_K_POINTER || lkind == CTF_K_ARRAY) &&
1134 1134 (rkind == CTF_K_POINTER || rkind == CTF_K_ARRAY) &&
1135 1135 (lp_is_void || rp_is_void || ctf_type_compat(lfp, lref, rfp, rref));
1136 1136
1137 1137 if (compat) {
1138 1138 if (fpp != NULL)
1139 1139 *fpp = rp_is_void ? lfp : rfp;
1140 1140 if (tp != NULL)
1141 1141 *tp = rp_is_void ? lbase : rbase;
1142 1142 }
1143 1143
1144 1144 return (compat);
1145 1145 }
1146 1146
1147 1147 /*
1148 1148 * The rules for checking argument types against parameter types are described
1149 1149 * in the ANSI-C spec (see K&R[A7.3.2] and K&R[A7.17]). We use the same rule
1150 1150 * set to determine whether associative array arguments match the prototype.
1151 1151 */
1152 1152 int
1153 1153 dt_node_is_argcompat(const dt_node_t *lp, const dt_node_t *rp)
1154 1154 {
1155 1155 ctf_file_t *lfp = lp->dn_ctfp;
1156 1156 ctf_file_t *rfp = rp->dn_ctfp;
1157 1157
1158 1158 assert(lp->dn_flags & DT_NF_COOKED);
1159 1159 assert(rp->dn_flags & DT_NF_COOKED);
1160 1160
1161 1161 if (dt_node_is_integer(lp) && dt_node_is_integer(rp))
1162 1162 return (1); /* integer types are compatible */
1163 1163
1164 1164 if (dt_node_is_strcompat(lp) && dt_node_is_strcompat(rp))
1165 1165 return (1); /* string types are compatible */
1166 1166
1167 1167 if (dt_node_is_stack(lp) && dt_node_is_stack(rp))
1168 1168 return (1); /* stack types are compatible */
1169 1169
1170 1170 if (dt_node_is_symaddr(lp) && dt_node_is_symaddr(rp))
1171 1171 return (1); /* symaddr types are compatible */
1172 1172
1173 1173 if (dt_node_is_usymaddr(lp) && dt_node_is_usymaddr(rp))
1174 1174 return (1); /* usymaddr types are compatible */
1175 1175
1176 1176 switch (ctf_type_kind(lfp, ctf_type_resolve(lfp, lp->dn_type))) {
1177 1177 case CTF_K_FUNCTION:
1178 1178 case CTF_K_STRUCT:
1179 1179 case CTF_K_UNION:
1180 1180 return (ctf_type_compat(lfp, lp->dn_type, rfp, rp->dn_type));
1181 1181 default:
1182 1182 return (dt_node_is_ptrcompat(lp, rp, NULL, NULL));
1183 1183 }
1184 1184 }
1185 1185
1186 1186 /*
1187 1187 * We provide dt_node_is_posconst() as a convenience routine for callers who
1188 1188 * wish to verify that an argument is a positive non-zero integer constant.
1189 1189 */
1190 1190 int
1191 1191 dt_node_is_posconst(const dt_node_t *dnp)
1192 1192 {
1193 1193 return (dnp->dn_kind == DT_NODE_INT && dnp->dn_value != 0 && (
1194 1194 (dnp->dn_flags & DT_NF_SIGNED) == 0 || (int64_t)dnp->dn_value > 0));
1195 1195 }
1196 1196
1197 1197 int
1198 1198 dt_node_is_actfunc(const dt_node_t *dnp)
1199 1199 {
1200 1200 return (dnp->dn_kind == DT_NODE_FUNC &&
1201 1201 dnp->dn_ident->di_kind == DT_IDENT_ACTFUNC);
1202 1202 }
1203 1203
1204 1204 /*
1205 1205 * The original rules for integer constant typing are described in K&R[A2.5.1].
1206 1206 * However, since we support long long, we instead use the rules from ISO C99
1207 1207 * clause 6.4.4.1 since that is where long longs are formally described. The
1208 1208 * rules require us to know whether the constant was specified in decimal or
1209 1209 * in octal or hex, which we do by looking at our lexer's 'yyintdecimal' flag.
1210 1210 * The type of an integer constant is the first of the corresponding list in
1211 1211 * which its value can be represented:
1212 1212 *
1213 1213 * unsuffixed decimal: int, long, long long
1214 1214 * unsuffixed oct/hex: int, unsigned int, long, unsigned long,
1215 1215 * long long, unsigned long long
1216 1216 * suffix [uU]: unsigned int, unsigned long, unsigned long long
1217 1217 * suffix [lL] decimal: long, long long
1218 1218 * suffix [lL] oct/hex: long, unsigned long, long long, unsigned long long
1219 1219 * suffix [uU][Ll]: unsigned long, unsigned long long
1220 1220 * suffix ll/LL decimal: long long
1221 1221 * suffix ll/LL oct/hex: long long, unsigned long long
1222 1222 * suffix [uU][ll/LL]: unsigned long long
1223 1223 *
1224 1224 * Given that our lexer has already validated the suffixes by regexp matching,
1225 1225 * there is an obvious way to concisely encode these rules: construct an array
1226 1226 * of the types in the order int, unsigned int, long, unsigned long, long long,
1227 1227 * unsigned long long. Compute an integer array starting index based on the
1228 1228 * suffix (e.g. none = 0, u = 1, ull = 5), and compute an increment based on
1229 1229 * the specifier (dec/oct/hex) and suffix (u). Then iterate from the starting
1230 1230 * index to the end, advancing using the increment, and searching until we
1231 1231 * find a limit that matches or we run out of choices (overflow). To make it
1232 1232 * even faster, we precompute the table of type information in dtrace_open().
1233 1233 */
1234 1234 dt_node_t *
1235 1235 dt_node_int(uintmax_t value)
1236 1236 {
1237 1237 dt_node_t *dnp = dt_node_alloc(DT_NODE_INT);
1238 1238 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
1239 1239
1240 1240 int n = (yyintdecimal | (yyintsuffix[0] == 'u')) + 1;
1241 1241 int i = 0;
1242 1242
1243 1243 const char *p;
1244 1244 char c;
1245 1245
1246 1246 dnp->dn_op = DT_TOK_INT;
1247 1247 dnp->dn_value = value;
1248 1248
1249 1249 for (p = yyintsuffix; (c = *p) != '\0'; p++) {
1250 1250 if (c == 'U' || c == 'u')
1251 1251 i += 1;
1252 1252 else if (c == 'L' || c == 'l')
1253 1253 i += 2;
1254 1254 }
1255 1255
1256 1256 for (; i < sizeof (dtp->dt_ints) / sizeof (dtp->dt_ints[0]); i += n) {
1257 1257 if (value <= dtp->dt_ints[i].did_limit) {
1258 1258 dt_node_type_assign(dnp,
1259 1259 dtp->dt_ints[i].did_ctfp,
1260 1260 dtp->dt_ints[i].did_type, B_FALSE);
1261 1261
1262 1262 /*
1263 1263 * If a prefix character is present in macro text, add
1264 1264 * in the corresponding operator node (see dt_lex.l).
1265 1265 */
1266 1266 switch (yyintprefix) {
1267 1267 case '+':
1268 1268 return (dt_node_op1(DT_TOK_IPOS, dnp));
1269 1269 case '-':
1270 1270 return (dt_node_op1(DT_TOK_INEG, dnp));
1271 1271 default:
1272 1272 return (dnp);
1273 1273 }
1274 1274 }
1275 1275 }
1276 1276
1277 1277 xyerror(D_INT_OFLOW, "integer constant 0x%llx cannot be represented "
1278 1278 "in any built-in integral type\n", (u_longlong_t)value);
1279 1279 /*NOTREACHED*/
1280 1280 return (NULL); /* keep gcc happy */
1281 1281 }
1282 1282
1283 1283 dt_node_t *
1284 1284 dt_node_string(char *string)
1285 1285 {
1286 1286 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
1287 1287 dt_node_t *dnp;
1288 1288
1289 1289 if (string == NULL)
1290 1290 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
1291 1291
1292 1292 dnp = dt_node_alloc(DT_NODE_STRING);
1293 1293 dnp->dn_op = DT_TOK_STRING;
1294 1294 dnp->dn_string = string;
1295 1295 dt_node_type_assign(dnp, DT_STR_CTFP(dtp), DT_STR_TYPE(dtp), B_FALSE);
1296 1296
1297 1297 return (dnp);
1298 1298 }
1299 1299
1300 1300 dt_node_t *
1301 1301 dt_node_ident(char *name)
1302 1302 {
1303 1303 dt_ident_t *idp;
1304 1304 dt_node_t *dnp;
1305 1305
1306 1306 if (name == NULL)
1307 1307 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
1308 1308
1309 1309 /*
1310 1310 * If the identifier is an inlined integer constant, then create an INT
1311 1311 * node that is a clone of the inline parse tree node and return that
1312 1312 * immediately, allowing this inline to be used in parsing contexts
1313 1313 * that require constant expressions (e.g. scalar array sizes).
1314 1314 */
1315 1315 if ((idp = dt_idstack_lookup(&yypcb->pcb_globals, name)) != NULL &&
1316 1316 (idp->di_flags & DT_IDFLG_INLINE)) {
1317 1317 dt_idnode_t *inp = idp->di_iarg;
1318 1318
1319 1319 if (inp->din_root != NULL &&
1320 1320 inp->din_root->dn_kind == DT_NODE_INT) {
1321 1321 free(name);
1322 1322
1323 1323 dnp = dt_node_alloc(DT_NODE_INT);
1324 1324 dnp->dn_op = DT_TOK_INT;
1325 1325 dnp->dn_value = inp->din_root->dn_value;
1326 1326 dt_node_type_propagate(inp->din_root, dnp);
1327 1327
1328 1328 return (dnp);
1329 1329 }
1330 1330 }
1331 1331
1332 1332 dnp = dt_node_alloc(DT_NODE_IDENT);
1333 1333 dnp->dn_op = name[0] == '@' ? DT_TOK_AGG : DT_TOK_IDENT;
1334 1334 dnp->dn_string = name;
1335 1335
1336 1336 return (dnp);
1337 1337 }
1338 1338
1339 1339 /*
1340 1340 * Create an empty node of type corresponding to the given declaration.
1341 1341 * Explicit references to user types (C or D) are assigned the default
1342 1342 * stability; references to other types are _dtrace_typattr (Private).
1343 1343 */
1344 1344 dt_node_t *
1345 1345 dt_node_type(dt_decl_t *ddp)
1346 1346 {
1347 1347 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
1348 1348 dtrace_typeinfo_t dtt;
1349 1349 dt_node_t *dnp;
1350 1350 char *name = NULL;
1351 1351 int err;
1352 1352
1353 1353 /*
1354 1354 * If 'ddp' is NULL, we get a decl by popping the decl stack. This
1355 1355 * form of dt_node_type() is used by parameter rules in dt_grammar.y.
1356 1356 */
1357 1357 if (ddp == NULL)
1358 1358 ddp = dt_decl_pop_param(&name);
1359 1359
1360 1360 err = dt_decl_type(ddp, &dtt);
1361 1361 dt_decl_free(ddp);
|
↓ open down ↓ |
1361 lines elided |
↑ open up ↑ |
1362 1362
1363 1363 if (err != 0) {
1364 1364 free(name);
1365 1365 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
1366 1366 }
1367 1367
1368 1368 dnp = dt_node_alloc(DT_NODE_TYPE);
1369 1369 dnp->dn_op = DT_TOK_IDENT;
1370 1370 dnp->dn_string = name;
1371 1371
1372 - dt_node_type_assign(dnp, dtt.dtt_ctfp, dtt.dtt_type, dtt.dtt_flags);
1372 + dt_node_type_assign(dnp, dtt.dtt_ctfp, dtt.dtt_type,
1373 + dtt.dtt_flags & DTT_FL_USER ? B_TRUE : B_FALSE);
1373 1374
1374 1375 if (dtt.dtt_ctfp == dtp->dt_cdefs->dm_ctfp ||
1375 1376 dtt.dtt_ctfp == dtp->dt_ddefs->dm_ctfp)
1376 1377 dt_node_attr_assign(dnp, _dtrace_defattr);
1377 1378 else
1378 1379 dt_node_attr_assign(dnp, _dtrace_typattr);
1379 1380
1380 1381 return (dnp);
1381 1382 }
1382 1383
1383 1384 /*
1384 1385 * Create a type node corresponding to a varargs (...) parameter by just
1385 1386 * assigning it type CTF_ERR. The decl processing code will handle this.
1386 1387 */
1387 1388 dt_node_t *
1388 1389 dt_node_vatype(void)
1389 1390 {
1390 1391 dt_node_t *dnp = dt_node_alloc(DT_NODE_TYPE);
1391 1392
1392 1393 dnp->dn_op = DT_TOK_IDENT;
1393 1394 dnp->dn_ctfp = yypcb->pcb_hdl->dt_cdefs->dm_ctfp;
1394 1395 dnp->dn_type = CTF_ERR;
1395 1396 dnp->dn_attr = _dtrace_defattr;
1396 1397
1397 1398 return (dnp);
1398 1399 }
1399 1400
1400 1401 /*
1401 1402 * Instantiate a decl using the contents of the current declaration stack. As
1402 1403 * we do not currently permit decls to be initialized, this function currently
1403 1404 * returns NULL and no parse node is created. When this function is called,
1404 1405 * the topmost scope's ds_ident pointer will be set to NULL (indicating no
1405 1406 * init_declarator rule was matched) or will point to the identifier to use.
1406 1407 */
1407 1408 dt_node_t *
1408 1409 dt_node_decl(void)
1409 1410 {
1410 1411 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
1411 1412 dt_scope_t *dsp = &yypcb->pcb_dstack;
1412 1413 dt_dclass_t class = dsp->ds_class;
1413 1414 dt_decl_t *ddp = dt_decl_top();
1414 1415
1415 1416 dt_module_t *dmp;
1416 1417 dtrace_typeinfo_t dtt;
1417 1418 ctf_id_t type;
1418 1419
1419 1420 char n1[DT_TYPE_NAMELEN];
1420 1421 char n2[DT_TYPE_NAMELEN];
1421 1422
1422 1423 if (dt_decl_type(ddp, &dtt) != 0)
1423 1424 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
1424 1425
1425 1426 /*
1426 1427 * If we have no declaration identifier, then this is either a spurious
1427 1428 * declaration of an intrinsic type (e.g. "extern int;") or declaration
1428 1429 * or redeclaration of a struct, union, or enum type or tag.
1429 1430 */
1430 1431 if (dsp->ds_ident == NULL) {
1431 1432 if (ddp->dd_kind != CTF_K_STRUCT &&
1432 1433 ddp->dd_kind != CTF_K_UNION && ddp->dd_kind != CTF_K_ENUM)
1433 1434 xyerror(D_DECL_USELESS, "useless declaration\n");
1434 1435
1435 1436 dt_dprintf("type %s added as id %ld\n", dt_type_name(
1436 1437 ddp->dd_ctfp, ddp->dd_type, n1, sizeof (n1)), ddp->dd_type);
1437 1438
1438 1439 return (NULL);
1439 1440 }
1440 1441
1441 1442 if (strchr(dsp->ds_ident, '`') != NULL) {
1442 1443 xyerror(D_DECL_SCOPE, "D scoping operator may not be used in "
1443 1444 "a declaration name (%s)\n", dsp->ds_ident);
1444 1445 }
1445 1446
1446 1447 /*
1447 1448 * If we are nested inside of a C include file, add the declaration to
1448 1449 * the C definition module; otherwise use the D definition module.
1449 1450 */
1450 1451 if (yypcb->pcb_idepth != 0)
1451 1452 dmp = dtp->dt_cdefs;
1452 1453 else
1453 1454 dmp = dtp->dt_ddefs;
1454 1455
1455 1456 /*
1456 1457 * If we see a global or static declaration of a function prototype,
1457 1458 * treat this as equivalent to a D extern declaration.
1458 1459 */
1459 1460 if (ctf_type_kind(dtt.dtt_ctfp, dtt.dtt_type) == CTF_K_FUNCTION &&
1460 1461 (class == DT_DC_DEFAULT || class == DT_DC_STATIC))
1461 1462 class = DT_DC_EXTERN;
1462 1463
1463 1464 switch (class) {
1464 1465 case DT_DC_AUTO:
1465 1466 case DT_DC_REGISTER:
1466 1467 case DT_DC_STATIC:
1467 1468 xyerror(D_DECL_BADCLASS, "specified storage class not "
1468 1469 "appropriate in D\n");
1469 1470 /*NOTREACHED*/
1470 1471
1471 1472 case DT_DC_EXTERN: {
1472 1473 dtrace_typeinfo_t ott;
1473 1474 dtrace_syminfo_t dts;
1474 1475 GElf_Sym sym;
1475 1476
1476 1477 int exists = dtrace_lookup_by_name(dtp,
1477 1478 dmp->dm_name, dsp->ds_ident, &sym, &dts) == 0;
1478 1479
1479 1480 if (exists && (dtrace_symbol_type(dtp, &sym, &dts, &ott) != 0 ||
1480 1481 ctf_type_cmp(dtt.dtt_ctfp, dtt.dtt_type,
1481 1482 ott.dtt_ctfp, ott.dtt_type) != 0)) {
1482 1483 xyerror(D_DECL_IDRED, "identifier redeclared: %s`%s\n"
1483 1484 "\t current: %s\n\tprevious: %s\n",
1484 1485 dmp->dm_name, dsp->ds_ident,
1485 1486 dt_type_name(dtt.dtt_ctfp, dtt.dtt_type,
1486 1487 n1, sizeof (n1)),
1487 1488 dt_type_name(ott.dtt_ctfp, ott.dtt_type,
1488 1489 n2, sizeof (n2)));
1489 1490 } else if (!exists && dt_module_extern(dtp, dmp,
1490 1491 dsp->ds_ident, &dtt) == NULL) {
1491 1492 xyerror(D_UNKNOWN,
1492 1493 "failed to extern %s: %s\n", dsp->ds_ident,
1493 1494 dtrace_errmsg(dtp, dtrace_errno(dtp)));
1494 1495 } else {
1495 1496 dt_dprintf("extern %s`%s type=<%s>\n",
1496 1497 dmp->dm_name, dsp->ds_ident,
1497 1498 dt_type_name(dtt.dtt_ctfp, dtt.dtt_type,
1498 1499 n1, sizeof (n1)));
1499 1500 }
1500 1501 break;
1501 1502 }
1502 1503
1503 1504 case DT_DC_TYPEDEF:
1504 1505 if (dt_idstack_lookup(&yypcb->pcb_globals, dsp->ds_ident)) {
1505 1506 xyerror(D_DECL_IDRED, "global variable identifier "
1506 1507 "redeclared: %s\n", dsp->ds_ident);
1507 1508 }
1508 1509
1509 1510 if (ctf_lookup_by_name(dmp->dm_ctfp,
1510 1511 dsp->ds_ident) != CTF_ERR) {
1511 1512 xyerror(D_DECL_IDRED,
1512 1513 "typedef redeclared: %s\n", dsp->ds_ident);
1513 1514 }
1514 1515
1515 1516 /*
1516 1517 * If the source type for the typedef is not defined in the
1517 1518 * target container or its parent, copy the type to the target
1518 1519 * container and reset dtt_ctfp and dtt_type to the copy.
1519 1520 */
1520 1521 if (dtt.dtt_ctfp != dmp->dm_ctfp &&
1521 1522 dtt.dtt_ctfp != ctf_parent_file(dmp->dm_ctfp)) {
1522 1523
1523 1524 dtt.dtt_type = ctf_add_type(dmp->dm_ctfp,
1524 1525 dtt.dtt_ctfp, dtt.dtt_type);
1525 1526 dtt.dtt_ctfp = dmp->dm_ctfp;
1526 1527
1527 1528 if (dtt.dtt_type == CTF_ERR ||
1528 1529 ctf_update(dtt.dtt_ctfp) == CTF_ERR) {
1529 1530 xyerror(D_UNKNOWN, "failed to copy typedef %s "
1530 1531 "source type: %s\n", dsp->ds_ident,
1531 1532 ctf_errmsg(ctf_errno(dtt.dtt_ctfp)));
1532 1533 }
1533 1534 }
1534 1535
1535 1536 type = ctf_add_typedef(dmp->dm_ctfp,
1536 1537 CTF_ADD_ROOT, dsp->ds_ident, dtt.dtt_type);
1537 1538
1538 1539 if (type == CTF_ERR || ctf_update(dmp->dm_ctfp) == CTF_ERR) {
1539 1540 xyerror(D_UNKNOWN, "failed to typedef %s: %s\n",
1540 1541 dsp->ds_ident, ctf_errmsg(ctf_errno(dmp->dm_ctfp)));
1541 1542 }
1542 1543
1543 1544 dt_dprintf("typedef %s added as id %ld\n", dsp->ds_ident, type);
1544 1545 break;
1545 1546
1546 1547 default: {
1547 1548 ctf_encoding_t cte;
1548 1549 dt_idhash_t *dhp;
1549 1550 dt_ident_t *idp;
1550 1551 dt_node_t idn;
1551 1552 int assc, idkind;
1552 1553 uint_t id, kind;
1553 1554 ushort_t idflags;
1554 1555
1555 1556 switch (class) {
1556 1557 case DT_DC_THIS:
1557 1558 dhp = yypcb->pcb_locals;
1558 1559 idflags = DT_IDFLG_LOCAL;
1559 1560 idp = dt_idhash_lookup(dhp, dsp->ds_ident);
1560 1561 break;
1561 1562 case DT_DC_SELF:
1562 1563 dhp = dtp->dt_tls;
1563 1564 idflags = DT_IDFLG_TLS;
1564 1565 idp = dt_idhash_lookup(dhp, dsp->ds_ident);
1565 1566 break;
1566 1567 default:
1567 1568 dhp = dtp->dt_globals;
1568 1569 idflags = 0;
1569 1570 idp = dt_idstack_lookup(
1570 1571 &yypcb->pcb_globals, dsp->ds_ident);
1571 1572 break;
1572 1573 }
1573 1574
1574 1575 if (ddp->dd_kind == CTF_K_ARRAY && ddp->dd_node == NULL) {
1575 1576 xyerror(D_DECL_ARRNULL,
1576 1577 "array declaration requires array dimension or "
1577 1578 "tuple signature: %s\n", dsp->ds_ident);
1578 1579 }
1579 1580
1580 1581 if (idp != NULL && idp->di_gen == 0) {
1581 1582 xyerror(D_DECL_IDRED, "built-in identifier "
1582 1583 "redeclared: %s\n", idp->di_name);
1583 1584 }
1584 1585
1585 1586 if (dtrace_lookup_by_type(dtp, DTRACE_OBJ_CDEFS,
1586 1587 dsp->ds_ident, NULL) == 0 ||
1587 1588 dtrace_lookup_by_type(dtp, DTRACE_OBJ_DDEFS,
1588 1589 dsp->ds_ident, NULL) == 0) {
1589 1590 xyerror(D_DECL_IDRED, "typedef identifier "
1590 1591 "redeclared: %s\n", dsp->ds_ident);
1591 1592 }
1592 1593
1593 1594 /*
1594 1595 * Cache some attributes of the decl to make the rest of this
1595 1596 * code simpler: if the decl is an array which is subscripted
1596 1597 * by a type rather than an integer, then it's an associative
1597 1598 * array (assc). We then expect to match either DT_IDENT_ARRAY
1598 1599 * for associative arrays or DT_IDENT_SCALAR for anything else.
1599 1600 */
1600 1601 assc = ddp->dd_kind == CTF_K_ARRAY &&
1601 1602 ddp->dd_node->dn_kind == DT_NODE_TYPE;
1602 1603
1603 1604 idkind = assc ? DT_IDENT_ARRAY : DT_IDENT_SCALAR;
1604 1605
1605 1606 /*
1606 1607 * Create a fake dt_node_t on the stack so we can determine the
1607 1608 * type of any matching identifier by assigning to this node.
1608 1609 * If the pre-existing ident has its di_type set, propagate
1609 1610 * the type by hand so as not to trigger a prototype check for
1610 1611 * arrays (yet); otherwise we use dt_ident_cook() on the ident
1611 1612 * to ensure it is fully initialized before looking at it.
1612 1613 */
1613 1614 bzero(&idn, sizeof (dt_node_t));
1614 1615
1615 1616 if (idp != NULL && idp->di_type != CTF_ERR)
1616 1617 dt_node_type_assign(&idn, idp->di_ctfp, idp->di_type,
1617 1618 B_FALSE);
1618 1619 else if (idp != NULL)
1619 1620 (void) dt_ident_cook(&idn, idp, NULL);
1620 1621
1621 1622 if (assc) {
1622 1623 if (class == DT_DC_THIS) {
1623 1624 xyerror(D_DECL_LOCASSC, "associative arrays "
1624 1625 "may not be declared as local variables:"
1625 1626 " %s\n", dsp->ds_ident);
1626 1627 }
1627 1628
1628 1629 if (dt_decl_type(ddp->dd_next, &dtt) != 0)
1629 1630 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
1630 1631 }
1631 1632
1632 1633 if (idp != NULL && (idp->di_kind != idkind ||
1633 1634 ctf_type_cmp(dtt.dtt_ctfp, dtt.dtt_type,
1634 1635 idn.dn_ctfp, idn.dn_type) != 0)) {
1635 1636 xyerror(D_DECL_IDRED, "identifier redeclared: %s\n"
1636 1637 "\t current: %s %s\n\tprevious: %s %s\n",
1637 1638 dsp->ds_ident, dt_idkind_name(idkind),
1638 1639 dt_type_name(dtt.dtt_ctfp,
1639 1640 dtt.dtt_type, n1, sizeof (n1)),
1640 1641 dt_idkind_name(idp->di_kind),
1641 1642 dt_node_type_name(&idn, n2, sizeof (n2)));
1642 1643
1643 1644 } else if (idp != NULL && assc) {
1644 1645 const dt_idsig_t *isp = idp->di_data;
1645 1646 dt_node_t *dnp = ddp->dd_node;
1646 1647 int argc = 0;
1647 1648
1648 1649 for (; dnp != NULL; dnp = dnp->dn_list, argc++) {
1649 1650 const dt_node_t *pnp = &isp->dis_args[argc];
1650 1651
1651 1652 if (argc >= isp->dis_argc)
1652 1653 continue; /* tuple length mismatch */
1653 1654
1654 1655 if (ctf_type_cmp(dnp->dn_ctfp, dnp->dn_type,
1655 1656 pnp->dn_ctfp, pnp->dn_type) == 0)
1656 1657 continue;
1657 1658
1658 1659 xyerror(D_DECL_IDRED,
1659 1660 "identifier redeclared: %s\n"
1660 1661 "\t current: %s, key #%d of type %s\n"
1661 1662 "\tprevious: %s, key #%d of type %s\n",
1662 1663 dsp->ds_ident,
1663 1664 dt_idkind_name(idkind), argc + 1,
1664 1665 dt_node_type_name(dnp, n1, sizeof (n1)),
1665 1666 dt_idkind_name(idp->di_kind), argc + 1,
1666 1667 dt_node_type_name(pnp, n2, sizeof (n2)));
1667 1668 }
1668 1669
1669 1670 if (isp->dis_argc != argc) {
1670 1671 xyerror(D_DECL_IDRED,
1671 1672 "identifier redeclared: %s\n"
1672 1673 "\t current: %s of %s, tuple length %d\n"
1673 1674 "\tprevious: %s of %s, tuple length %d\n",
1674 1675 dsp->ds_ident, dt_idkind_name(idkind),
1675 1676 dt_type_name(dtt.dtt_ctfp, dtt.dtt_type,
1676 1677 n1, sizeof (n1)), argc,
1677 1678 dt_idkind_name(idp->di_kind),
1678 1679 dt_node_type_name(&idn, n2, sizeof (n2)),
1679 1680 isp->dis_argc);
1680 1681 }
1681 1682
1682 1683 } else if (idp == NULL) {
1683 1684 type = ctf_type_resolve(dtt.dtt_ctfp, dtt.dtt_type);
1684 1685 kind = ctf_type_kind(dtt.dtt_ctfp, type);
1685 1686
1686 1687 switch (kind) {
1687 1688 case CTF_K_INTEGER:
1688 1689 if (ctf_type_encoding(dtt.dtt_ctfp, type,
1689 1690 &cte) == 0 && IS_VOID(cte)) {
1690 1691 xyerror(D_DECL_VOIDOBJ, "cannot have "
1691 1692 "void object: %s\n", dsp->ds_ident);
1692 1693 }
1693 1694 break;
1694 1695 case CTF_K_STRUCT:
1695 1696 case CTF_K_UNION:
1696 1697 if (ctf_type_size(dtt.dtt_ctfp, type) != 0)
1697 1698 break; /* proceed to declaring */
1698 1699 /*FALLTHRU*/
1699 1700 case CTF_K_FORWARD:
1700 1701 xyerror(D_DECL_INCOMPLETE,
1701 1702 "incomplete struct/union/enum %s: %s\n",
1702 1703 dt_type_name(dtt.dtt_ctfp, dtt.dtt_type,
1703 1704 n1, sizeof (n1)), dsp->ds_ident);
1704 1705 /*NOTREACHED*/
1705 1706 }
1706 1707
1707 1708 if (dt_idhash_nextid(dhp, &id) == -1) {
1708 1709 xyerror(D_ID_OFLOW, "cannot create %s: limit "
1709 1710 "on number of %s variables exceeded\n",
1710 1711 dsp->ds_ident, dt_idhash_name(dhp));
1711 1712 }
1712 1713
1713 1714 dt_dprintf("declare %s %s variable %s, id=%u\n",
1714 1715 dt_idhash_name(dhp), dt_idkind_name(idkind),
1715 1716 dsp->ds_ident, id);
1716 1717
1717 1718 idp = dt_idhash_insert(dhp, dsp->ds_ident, idkind,
1718 1719 idflags | DT_IDFLG_WRITE | DT_IDFLG_DECL, id,
1719 1720 _dtrace_defattr, 0, assc ? &dt_idops_assc :
1720 1721 &dt_idops_thaw, NULL, dtp->dt_gen);
1721 1722
1722 1723 if (idp == NULL)
1723 1724 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
1724 1725
1725 1726 dt_ident_type_assign(idp, dtt.dtt_ctfp, dtt.dtt_type);
1726 1727
1727 1728 /*
1728 1729 * If we are declaring an associative array, use our
1729 1730 * fake parse node to cook the new assoc identifier.
1730 1731 * This will force the ident code to instantiate the
1731 1732 * array type signature corresponding to the list of
1732 1733 * types pointed to by ddp->dd_node. We also reset
1733 1734 * the identifier's attributes based upon the result.
1734 1735 */
1735 1736 if (assc) {
1736 1737 idp->di_attr =
1737 1738 dt_ident_cook(&idn, idp, &ddp->dd_node);
1738 1739 }
1739 1740 }
1740 1741 }
1741 1742
1742 1743 } /* end of switch */
1743 1744
1744 1745 free(dsp->ds_ident);
1745 1746 dsp->ds_ident = NULL;
1746 1747
1747 1748 return (NULL);
1748 1749 }
1749 1750
1750 1751 dt_node_t *
1751 1752 dt_node_func(dt_node_t *dnp, dt_node_t *args)
1752 1753 {
1753 1754 dt_ident_t *idp;
1754 1755
1755 1756 if (dnp->dn_kind != DT_NODE_IDENT) {
1756 1757 xyerror(D_FUNC_IDENT,
1757 1758 "function designator is not of function type\n");
1758 1759 }
1759 1760
1760 1761 idp = dt_idstack_lookup(&yypcb->pcb_globals, dnp->dn_string);
1761 1762
1762 1763 if (idp == NULL) {
1763 1764 xyerror(D_FUNC_UNDEF,
1764 1765 "undefined function name: %s\n", dnp->dn_string);
1765 1766 }
1766 1767
1767 1768 if (idp->di_kind != DT_IDENT_FUNC &&
1768 1769 idp->di_kind != DT_IDENT_AGGFUNC &&
1769 1770 idp->di_kind != DT_IDENT_ACTFUNC) {
1770 1771 xyerror(D_FUNC_IDKIND, "%s '%s' may not be referenced as a "
1771 1772 "function\n", dt_idkind_name(idp->di_kind), idp->di_name);
1772 1773 }
1773 1774
1774 1775 free(dnp->dn_string);
1775 1776 dnp->dn_string = NULL;
1776 1777
1777 1778 dnp->dn_kind = DT_NODE_FUNC;
1778 1779 dnp->dn_flags &= ~DT_NF_COOKED;
1779 1780 dnp->dn_ident = idp;
1780 1781 dnp->dn_args = args;
1781 1782 dnp->dn_list = NULL;
1782 1783
1783 1784 return (dnp);
1784 1785 }
1785 1786
1786 1787 /*
1787 1788 * The offsetof() function is special because it takes a type name as an
1788 1789 * argument. It does not actually construct its own node; after looking up the
1789 1790 * structure or union offset, we just return an integer node with the offset.
1790 1791 */
|
↓ open down ↓ |
408 lines elided |
↑ open up ↑ |
1791 1792 dt_node_t *
1792 1793 dt_node_offsetof(dt_decl_t *ddp, char *s)
1793 1794 {
1794 1795 dtrace_typeinfo_t dtt;
1795 1796 dt_node_t dn;
1796 1797 char *name;
1797 1798 int err;
1798 1799
1799 1800 ctf_membinfo_t ctm;
1800 1801 ctf_id_t type;
1802 + ctf_file_t *ctfp;
1801 1803 uint_t kind;
1802 1804
1803 1805 name = strdupa(s);
1804 1806 free(s);
1805 1807
1806 1808 err = dt_decl_type(ddp, &dtt);
1807 1809 dt_decl_free(ddp);
1808 1810
1809 1811 if (err != 0)
1810 1812 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
1811 1813
1812 1814 type = ctf_type_resolve(dtt.dtt_ctfp, dtt.dtt_type);
1813 1815 kind = ctf_type_kind(dtt.dtt_ctfp, type);
1814 1816
1815 1817 if (kind != CTF_K_STRUCT && kind != CTF_K_UNION) {
|
↓ open down ↓ |
5 lines elided |
↑ open up ↑ |
1816 1818 xyerror(D_OFFSETOF_TYPE,
1817 1819 "offsetof operand must be a struct or union type\n");
1818 1820 }
1819 1821
1820 1822 if (ctf_member_info(dtt.dtt_ctfp, type, name, &ctm) == CTF_ERR) {
1821 1823 xyerror(D_UNKNOWN, "failed to determine offset of %s: %s\n",
1822 1824 name, ctf_errmsg(ctf_errno(dtt.dtt_ctfp)));
1823 1825 }
1824 1826
1825 1827 bzero(&dn, sizeof (dn));
1826 - dt_node_type_assign(&dn, dtt.dtt_ctfp, ctm.ctm_type, B_FALSE);
1828 + /*
1829 + * Resolution of CTF_K_FORWARD is unnecessary here, since it can't be
1830 + * both forward _and_ a bitfield, but is done for completeness.
1831 + */
1832 + type = ctm.ctm_type;
1833 + ctfp = dtt.dtt_ctfp;
1834 +
1835 + dt_resolve_forward_decl(&ctfp, &type);
1836 + dt_node_type_assign(&dn, ctfp, type, B_FALSE);
1827 1837
1828 1838 if (dn.dn_flags & DT_NF_BITFIELD) {
1829 1839 xyerror(D_OFFSETOF_BITFIELD,
1830 1840 "cannot take offset of a bit-field: %s\n", name);
1831 1841 }
1832 1842
1833 1843 return (dt_node_int(ctm.ctm_offset / NBBY));
1834 1844 }
1835 1845
1836 1846 dt_node_t *
1837 1847 dt_node_op1(int op, dt_node_t *cp)
1838 1848 {
1839 1849 dt_node_t *dnp;
1840 1850
1841 1851 if (cp->dn_kind == DT_NODE_INT) {
1842 1852 switch (op) {
1843 1853 case DT_TOK_INEG:
1844 1854 /*
1845 1855 * If we're negating an unsigned integer, zero out any
1846 1856 * extra top bits to truncate the value to the size of
1847 1857 * the effective type determined by dt_node_int().
1848 1858 */
1849 1859 cp->dn_value = -cp->dn_value;
1850 1860 if (!(cp->dn_flags & DT_NF_SIGNED)) {
1851 1861 cp->dn_value &= ~0ULL >>
1852 1862 (64 - dt_node_type_size(cp) * NBBY);
1853 1863 }
1854 1864 /*FALLTHRU*/
1855 1865 case DT_TOK_IPOS:
1856 1866 return (cp);
1857 1867 case DT_TOK_BNEG:
1858 1868 cp->dn_value = ~cp->dn_value;
1859 1869 return (cp);
1860 1870 case DT_TOK_LNEG:
1861 1871 cp->dn_value = !cp->dn_value;
1862 1872 return (cp);
1863 1873 }
1864 1874 }
1865 1875
1866 1876 /*
1867 1877 * If sizeof is applied to a type_name or string constant, we can
1868 1878 * transform 'cp' into an integer constant in the node construction
1869 1879 * pass so that it can then be used for arithmetic in this pass.
1870 1880 */
1871 1881 if (op == DT_TOK_SIZEOF &&
1872 1882 (cp->dn_kind == DT_NODE_STRING || cp->dn_kind == DT_NODE_TYPE)) {
1873 1883 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
1874 1884 size_t size = dt_node_type_size(cp);
1875 1885
1876 1886 if (size == 0) {
1877 1887 xyerror(D_SIZEOF_TYPE, "cannot apply sizeof to an "
1878 1888 "operand of unknown size\n");
1879 1889 }
1880 1890
1881 1891 dt_node_type_assign(cp, dtp->dt_ddefs->dm_ctfp,
1882 1892 ctf_lookup_by_name(dtp->dt_ddefs->dm_ctfp, "size_t"),
1883 1893 B_FALSE);
1884 1894
1885 1895 cp->dn_kind = DT_NODE_INT;
1886 1896 cp->dn_op = DT_TOK_INT;
1887 1897 cp->dn_value = size;
1888 1898
1889 1899 return (cp);
1890 1900 }
1891 1901
1892 1902 dnp = dt_node_alloc(DT_NODE_OP1);
1893 1903 assert(op <= USHRT_MAX);
1894 1904 dnp->dn_op = (ushort_t)op;
1895 1905 dnp->dn_child = cp;
1896 1906
1897 1907 return (dnp);
1898 1908 }
1899 1909
1900 1910 /*
1901 1911 * If an integer constant is being cast to another integer type, we can
1902 1912 * perform the cast as part of integer constant folding in this pass. We must
1903 1913 * take action when the integer is being cast to a smaller type or if it is
1904 1914 * changing signed-ness. If so, we first shift rp's bits bits high (losing
1905 1915 * excess bits if narrowing) and then shift them down with either a logical
1906 1916 * shift (unsigned) or arithmetic shift (signed).
1907 1917 */
1908 1918 static void
1909 1919 dt_cast(dt_node_t *lp, dt_node_t *rp)
1910 1920 {
1911 1921 size_t srcsize = dt_node_type_size(rp);
1912 1922 size_t dstsize = dt_node_type_size(lp);
1913 1923
1914 1924 if (dstsize < srcsize) {
1915 1925 int n = (sizeof (uint64_t) - dstsize) * NBBY;
1916 1926 rp->dn_value <<= n;
1917 1927 rp->dn_value >>= n;
1918 1928 } else if (dstsize > srcsize) {
1919 1929 int n = (sizeof (uint64_t) - srcsize) * NBBY;
1920 1930 int s = (dstsize - srcsize) * NBBY;
1921 1931
1922 1932 rp->dn_value <<= n;
1923 1933 if (rp->dn_flags & DT_NF_SIGNED) {
1924 1934 rp->dn_value = (intmax_t)rp->dn_value >> s;
1925 1935 rp->dn_value >>= n - s;
1926 1936 } else {
1927 1937 rp->dn_value >>= n;
1928 1938 }
1929 1939 }
1930 1940 }
1931 1941
1932 1942 dt_node_t *
1933 1943 dt_node_op2(int op, dt_node_t *lp, dt_node_t *rp)
1934 1944 {
1935 1945 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
1936 1946 dt_node_t *dnp;
1937 1947
1938 1948 /*
1939 1949 * First we check for operations that are illegal -- namely those that
1940 1950 * might result in integer division by zero, and abort if one is found.
1941 1951 */
1942 1952 if (rp->dn_kind == DT_NODE_INT && rp->dn_value == 0 &&
1943 1953 (op == DT_TOK_MOD || op == DT_TOK_DIV ||
1944 1954 op == DT_TOK_MOD_EQ || op == DT_TOK_DIV_EQ))
1945 1955 xyerror(D_DIV_ZERO, "expression contains division by zero\n");
1946 1956
1947 1957 /*
1948 1958 * If both children are immediate values, we can just perform inline
1949 1959 * calculation and return a new immediate node with the result.
1950 1960 */
1951 1961 if (lp->dn_kind == DT_NODE_INT && rp->dn_kind == DT_NODE_INT) {
1952 1962 uintmax_t l = lp->dn_value;
1953 1963 uintmax_t r = rp->dn_value;
1954 1964
1955 1965 dnp = dt_node_int(0); /* allocate new integer node for result */
1956 1966
1957 1967 switch (op) {
1958 1968 case DT_TOK_LOR:
1959 1969 dnp->dn_value = l || r;
1960 1970 dt_node_type_assign(dnp,
1961 1971 DT_INT_CTFP(dtp), DT_INT_TYPE(dtp), B_FALSE);
1962 1972 break;
1963 1973 case DT_TOK_LXOR:
1964 1974 dnp->dn_value = (l != 0) ^ (r != 0);
1965 1975 dt_node_type_assign(dnp,
1966 1976 DT_INT_CTFP(dtp), DT_INT_TYPE(dtp), B_FALSE);
1967 1977 break;
1968 1978 case DT_TOK_LAND:
1969 1979 dnp->dn_value = l && r;
1970 1980 dt_node_type_assign(dnp,
1971 1981 DT_INT_CTFP(dtp), DT_INT_TYPE(dtp), B_FALSE);
1972 1982 break;
1973 1983 case DT_TOK_BOR:
1974 1984 dnp->dn_value = l | r;
1975 1985 dt_node_promote(lp, rp, dnp);
1976 1986 break;
1977 1987 case DT_TOK_XOR:
1978 1988 dnp->dn_value = l ^ r;
1979 1989 dt_node_promote(lp, rp, dnp);
1980 1990 break;
1981 1991 case DT_TOK_BAND:
1982 1992 dnp->dn_value = l & r;
1983 1993 dt_node_promote(lp, rp, dnp);
1984 1994 break;
1985 1995 case DT_TOK_EQU:
1986 1996 dnp->dn_value = l == r;
1987 1997 dt_node_type_assign(dnp,
1988 1998 DT_INT_CTFP(dtp), DT_INT_TYPE(dtp), B_FALSE);
1989 1999 break;
1990 2000 case DT_TOK_NEQ:
1991 2001 dnp->dn_value = l != r;
1992 2002 dt_node_type_assign(dnp,
1993 2003 DT_INT_CTFP(dtp), DT_INT_TYPE(dtp), B_FALSE);
1994 2004 break;
1995 2005 case DT_TOK_LT:
1996 2006 dt_node_promote(lp, rp, dnp);
1997 2007 if (dnp->dn_flags & DT_NF_SIGNED)
1998 2008 dnp->dn_value = (intmax_t)l < (intmax_t)r;
1999 2009 else
2000 2010 dnp->dn_value = l < r;
2001 2011 dt_node_type_assign(dnp,
2002 2012 DT_INT_CTFP(dtp), DT_INT_TYPE(dtp), B_FALSE);
2003 2013 break;
2004 2014 case DT_TOK_LE:
2005 2015 dt_node_promote(lp, rp, dnp);
2006 2016 if (dnp->dn_flags & DT_NF_SIGNED)
2007 2017 dnp->dn_value = (intmax_t)l <= (intmax_t)r;
2008 2018 else
2009 2019 dnp->dn_value = l <= r;
2010 2020 dt_node_type_assign(dnp,
2011 2021 DT_INT_CTFP(dtp), DT_INT_TYPE(dtp), B_FALSE);
2012 2022 break;
2013 2023 case DT_TOK_GT:
2014 2024 dt_node_promote(lp, rp, dnp);
2015 2025 if (dnp->dn_flags & DT_NF_SIGNED)
2016 2026 dnp->dn_value = (intmax_t)l > (intmax_t)r;
2017 2027 else
2018 2028 dnp->dn_value = l > r;
2019 2029 dt_node_type_assign(dnp,
2020 2030 DT_INT_CTFP(dtp), DT_INT_TYPE(dtp), B_FALSE);
2021 2031 break;
2022 2032 case DT_TOK_GE:
2023 2033 dt_node_promote(lp, rp, dnp);
2024 2034 if (dnp->dn_flags & DT_NF_SIGNED)
2025 2035 dnp->dn_value = (intmax_t)l >= (intmax_t)r;
2026 2036 else
2027 2037 dnp->dn_value = l >= r;
2028 2038 dt_node_type_assign(dnp,
2029 2039 DT_INT_CTFP(dtp), DT_INT_TYPE(dtp), B_FALSE);
2030 2040 break;
2031 2041 case DT_TOK_LSH:
2032 2042 dnp->dn_value = l << r;
2033 2043 dt_node_type_propagate(lp, dnp);
2034 2044 dt_node_attr_assign(rp,
2035 2045 dt_attr_min(lp->dn_attr, rp->dn_attr));
2036 2046 break;
2037 2047 case DT_TOK_RSH:
2038 2048 dnp->dn_value = l >> r;
2039 2049 dt_node_type_propagate(lp, dnp);
2040 2050 dt_node_attr_assign(rp,
2041 2051 dt_attr_min(lp->dn_attr, rp->dn_attr));
2042 2052 break;
2043 2053 case DT_TOK_ADD:
2044 2054 dnp->dn_value = l + r;
2045 2055 dt_node_promote(lp, rp, dnp);
2046 2056 break;
2047 2057 case DT_TOK_SUB:
2048 2058 dnp->dn_value = l - r;
2049 2059 dt_node_promote(lp, rp, dnp);
2050 2060 break;
2051 2061 case DT_TOK_MUL:
2052 2062 dnp->dn_value = l * r;
2053 2063 dt_node_promote(lp, rp, dnp);
2054 2064 break;
2055 2065 case DT_TOK_DIV:
2056 2066 dt_node_promote(lp, rp, dnp);
2057 2067 if (dnp->dn_flags & DT_NF_SIGNED)
2058 2068 dnp->dn_value = (intmax_t)l / (intmax_t)r;
2059 2069 else
2060 2070 dnp->dn_value = l / r;
2061 2071 break;
2062 2072 case DT_TOK_MOD:
2063 2073 dt_node_promote(lp, rp, dnp);
2064 2074 if (dnp->dn_flags & DT_NF_SIGNED)
2065 2075 dnp->dn_value = (intmax_t)l % (intmax_t)r;
2066 2076 else
2067 2077 dnp->dn_value = l % r;
2068 2078 break;
2069 2079 default:
2070 2080 dt_node_free(dnp);
2071 2081 dnp = NULL;
2072 2082 }
2073 2083
2074 2084 if (dnp != NULL) {
2075 2085 dt_node_free(lp);
2076 2086 dt_node_free(rp);
2077 2087 return (dnp);
2078 2088 }
2079 2089 }
2080 2090
2081 2091 if (op == DT_TOK_LPAR && rp->dn_kind == DT_NODE_INT &&
2082 2092 dt_node_is_integer(lp)) {
2083 2093 dt_cast(lp, rp);
2084 2094 dt_node_type_propagate(lp, rp);
2085 2095 dt_node_attr_assign(rp, dt_attr_min(lp->dn_attr, rp->dn_attr));
2086 2096 dt_node_free(lp);
2087 2097
2088 2098 return (rp);
2089 2099 }
2090 2100
2091 2101 /*
2092 2102 * If no immediate optimizations are available, create an new OP2 node
2093 2103 * and glue the left and right children into place and return.
2094 2104 */
2095 2105 dnp = dt_node_alloc(DT_NODE_OP2);
2096 2106 assert(op <= USHRT_MAX);
2097 2107 dnp->dn_op = (ushort_t)op;
2098 2108 dnp->dn_left = lp;
2099 2109 dnp->dn_right = rp;
2100 2110
2101 2111 return (dnp);
2102 2112 }
2103 2113
2104 2114 dt_node_t *
2105 2115 dt_node_op3(dt_node_t *expr, dt_node_t *lp, dt_node_t *rp)
2106 2116 {
2107 2117 dt_node_t *dnp;
2108 2118
2109 2119 if (expr->dn_kind == DT_NODE_INT)
2110 2120 return (expr->dn_value != 0 ? lp : rp);
2111 2121
2112 2122 dnp = dt_node_alloc(DT_NODE_OP3);
2113 2123 dnp->dn_op = DT_TOK_QUESTION;
2114 2124 dnp->dn_expr = expr;
2115 2125 dnp->dn_left = lp;
2116 2126 dnp->dn_right = rp;
2117 2127
2118 2128 return (dnp);
2119 2129 }
2120 2130
2121 2131 dt_node_t *
2122 2132 dt_node_statement(dt_node_t *expr)
2123 2133 {
2124 2134 dt_node_t *dnp;
2125 2135
2126 2136 if (expr->dn_kind == DT_NODE_AGG)
2127 2137 return (expr);
2128 2138
2129 2139 if (expr->dn_kind == DT_NODE_FUNC &&
2130 2140 expr->dn_ident->di_kind == DT_IDENT_ACTFUNC)
2131 2141 dnp = dt_node_alloc(DT_NODE_DFUNC);
2132 2142 else
2133 2143 dnp = dt_node_alloc(DT_NODE_DEXPR);
2134 2144
2135 2145 dnp->dn_expr = expr;
2136 2146 return (dnp);
2137 2147 }
2138 2148
2139 2149 dt_node_t *
2140 2150 dt_node_pdesc_by_name(char *spec)
2141 2151 {
2142 2152 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
2143 2153 dt_node_t *dnp;
2144 2154
2145 2155 if (spec == NULL)
2146 2156 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2147 2157
2148 2158 dnp = dt_node_alloc(DT_NODE_PDESC);
2149 2159 dnp->dn_spec = spec;
2150 2160 dnp->dn_desc = malloc(sizeof (dtrace_probedesc_t));
2151 2161
2152 2162 if (dnp->dn_desc == NULL)
2153 2163 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2154 2164
2155 2165 if (dtrace_xstr2desc(dtp, yypcb->pcb_pspec, dnp->dn_spec,
2156 2166 yypcb->pcb_sargc, yypcb->pcb_sargv, dnp->dn_desc) != 0) {
2157 2167 xyerror(D_PDESC_INVAL, "invalid probe description \"%s\": %s\n",
2158 2168 dnp->dn_spec, dtrace_errmsg(dtp, dtrace_errno(dtp)));
2159 2169 }
2160 2170
2161 2171 free(dnp->dn_spec);
2162 2172 dnp->dn_spec = NULL;
2163 2173
2164 2174 return (dnp);
2165 2175 }
2166 2176
2167 2177 dt_node_t *
2168 2178 dt_node_pdesc_by_id(uintmax_t id)
2169 2179 {
2170 2180 static const char *const names[] = {
2171 2181 "providers", "modules", "functions"
2172 2182 };
2173 2183
2174 2184 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
2175 2185 dt_node_t *dnp = dt_node_alloc(DT_NODE_PDESC);
2176 2186
2177 2187 if ((dnp->dn_desc = malloc(sizeof (dtrace_probedesc_t))) == NULL)
2178 2188 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2179 2189
2180 2190 if (id > UINT_MAX) {
2181 2191 xyerror(D_PDESC_INVAL, "identifier %llu exceeds maximum "
2182 2192 "probe id\n", (u_longlong_t)id);
2183 2193 }
2184 2194
2185 2195 if (yypcb->pcb_pspec != DTRACE_PROBESPEC_NAME) {
2186 2196 xyerror(D_PDESC_INVAL, "probe identifier %llu not permitted "
2187 2197 "when specifying %s\n", (u_longlong_t)id,
2188 2198 names[yypcb->pcb_pspec]);
2189 2199 }
2190 2200
2191 2201 if (dtrace_id2desc(dtp, (dtrace_id_t)id, dnp->dn_desc) != 0) {
2192 2202 xyerror(D_PDESC_INVAL, "invalid probe identifier %llu: %s\n",
2193 2203 (u_longlong_t)id, dtrace_errmsg(dtp, dtrace_errno(dtp)));
2194 2204 }
2195 2205
2196 2206 return (dnp);
2197 2207 }
2198 2208
2199 2209 dt_node_t *
2200 2210 dt_node_clause(dt_node_t *pdescs, dt_node_t *pred, dt_node_t *acts)
2201 2211 {
2202 2212 dt_node_t *dnp = dt_node_alloc(DT_NODE_CLAUSE);
2203 2213
2204 2214 dnp->dn_pdescs = pdescs;
2205 2215 dnp->dn_pred = pred;
2206 2216 dnp->dn_acts = acts;
2207 2217
2208 2218 yybegin(YYS_CLAUSE);
2209 2219 return (dnp);
2210 2220 }
2211 2221
2212 2222 dt_node_t *
2213 2223 dt_node_inline(dt_node_t *expr)
2214 2224 {
2215 2225 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
2216 2226 dt_scope_t *dsp = &yypcb->pcb_dstack;
2217 2227 dt_decl_t *ddp = dt_decl_top();
2218 2228
2219 2229 char n[DT_TYPE_NAMELEN];
2220 2230 dtrace_typeinfo_t dtt;
2221 2231
2222 2232 dt_ident_t *idp, *rdp;
2223 2233 dt_idnode_t *inp;
2224 2234 dt_node_t *dnp;
2225 2235
2226 2236 if (dt_decl_type(ddp, &dtt) != 0)
2227 2237 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
2228 2238
2229 2239 if (dsp->ds_class != DT_DC_DEFAULT) {
2230 2240 xyerror(D_DECL_BADCLASS, "specified storage class not "
2231 2241 "appropriate for inline declaration\n");
2232 2242 }
2233 2243
2234 2244 if (dsp->ds_ident == NULL)
2235 2245 xyerror(D_DECL_USELESS, "inline declaration requires a name\n");
2236 2246
2237 2247 if ((idp = dt_idstack_lookup(
2238 2248 &yypcb->pcb_globals, dsp->ds_ident)) != NULL) {
2239 2249 xyerror(D_DECL_IDRED, "identifier redefined: %s\n\t current: "
2240 2250 "inline definition\n\tprevious: %s %s\n",
2241 2251 idp->di_name, dt_idkind_name(idp->di_kind),
2242 2252 (idp->di_flags & DT_IDFLG_INLINE) ? "inline" : "");
2243 2253 }
2244 2254
2245 2255 /*
2246 2256 * If we are declaring an inlined array, verify that we have a tuple
2247 2257 * signature, and then recompute 'dtt' as the array's value type.
2248 2258 */
2249 2259 if (ddp->dd_kind == CTF_K_ARRAY) {
2250 2260 if (ddp->dd_node == NULL) {
2251 2261 xyerror(D_DECL_ARRNULL, "inline declaration requires "
2252 2262 "array tuple signature: %s\n", dsp->ds_ident);
2253 2263 }
2254 2264
2255 2265 if (ddp->dd_node->dn_kind != DT_NODE_TYPE) {
2256 2266 xyerror(D_DECL_ARRNULL, "inline declaration cannot be "
2257 2267 "of scalar array type: %s\n", dsp->ds_ident);
2258 2268 }
2259 2269
2260 2270 if (dt_decl_type(ddp->dd_next, &dtt) != 0)
2261 2271 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
2262 2272 }
2263 2273
2264 2274 /*
2265 2275 * If the inline identifier is not defined, then create it with the
2266 2276 * orphan flag set. We do not insert the identifier into dt_globals
2267 2277 * until we have successfully cooked the right-hand expression, below.
2268 2278 */
2269 2279 dnp = dt_node_alloc(DT_NODE_INLINE);
2270 2280 dt_node_type_assign(dnp, dtt.dtt_ctfp, dtt.dtt_type, B_FALSE);
2271 2281 dt_node_attr_assign(dnp, _dtrace_defattr);
2272 2282
2273 2283 if (dt_node_is_void(dnp)) {
2274 2284 xyerror(D_DECL_VOIDOBJ,
2275 2285 "cannot declare void inline: %s\n", dsp->ds_ident);
2276 2286 }
2277 2287
2278 2288 if (ctf_type_kind(dnp->dn_ctfp, ctf_type_resolve(
2279 2289 dnp->dn_ctfp, dnp->dn_type)) == CTF_K_FORWARD) {
2280 2290 xyerror(D_DECL_INCOMPLETE,
2281 2291 "incomplete struct/union/enum %s: %s\n",
2282 2292 dt_node_type_name(dnp, n, sizeof (n)), dsp->ds_ident);
2283 2293 }
2284 2294
2285 2295 if ((inp = malloc(sizeof (dt_idnode_t))) == NULL)
2286 2296 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2287 2297
2288 2298 bzero(inp, sizeof (dt_idnode_t));
2289 2299
2290 2300 idp = dnp->dn_ident = dt_ident_create(dsp->ds_ident,
2291 2301 ddp->dd_kind == CTF_K_ARRAY ? DT_IDENT_ARRAY : DT_IDENT_SCALAR,
2292 2302 DT_IDFLG_INLINE | DT_IDFLG_REF | DT_IDFLG_DECL | DT_IDFLG_ORPHAN, 0,
2293 2303 _dtrace_defattr, 0, &dt_idops_inline, inp, dtp->dt_gen);
2294 2304
2295 2305 if (idp == NULL) {
2296 2306 free(inp);
2297 2307 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2298 2308 }
2299 2309
2300 2310 /*
2301 2311 * If we're inlining an associative array, create a private identifier
2302 2312 * hash containing the named parameters and store it in inp->din_hash.
2303 2313 * We then push this hash on to the top of the pcb_globals stack.
2304 2314 */
2305 2315 if (ddp->dd_kind == CTF_K_ARRAY) {
2306 2316 dt_idnode_t *pinp;
2307 2317 dt_ident_t *pidp;
2308 2318 dt_node_t *pnp;
2309 2319 uint_t i = 0;
2310 2320
2311 2321 for (pnp = ddp->dd_node; pnp != NULL; pnp = pnp->dn_list)
2312 2322 i++; /* count up parameters for din_argv[] */
2313 2323
2314 2324 inp->din_hash = dt_idhash_create("inline args", NULL, 0, 0);
2315 2325 inp->din_argv = calloc(i, sizeof (dt_ident_t *));
2316 2326
2317 2327 if (inp->din_hash == NULL || inp->din_argv == NULL)
2318 2328 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2319 2329
2320 2330 /*
2321 2331 * Create an identifier for each parameter as a scalar inline,
2322 2332 * and store it in din_hash and in position in din_argv[]. The
2323 2333 * parameter identifiers also use dt_idops_inline, but we leave
2324 2334 * the dt_idnode_t argument 'pinp' zeroed. This will be filled
2325 2335 * in by the code generation pass with references to the args.
2326 2336 */
2327 2337 for (i = 0, pnp = ddp->dd_node;
2328 2338 pnp != NULL; pnp = pnp->dn_list, i++) {
2329 2339
2330 2340 if (pnp->dn_string == NULL)
2331 2341 continue; /* ignore anonymous parameters */
2332 2342
2333 2343 if ((pinp = malloc(sizeof (dt_idnode_t))) == NULL)
2334 2344 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2335 2345
2336 2346 pidp = dt_idhash_insert(inp->din_hash, pnp->dn_string,
2337 2347 DT_IDENT_SCALAR, DT_IDFLG_DECL | DT_IDFLG_INLINE, 0,
2338 2348 _dtrace_defattr, 0, &dt_idops_inline,
2339 2349 pinp, dtp->dt_gen);
2340 2350
2341 2351 if (pidp == NULL) {
2342 2352 free(pinp);
2343 2353 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2344 2354 }
2345 2355
2346 2356 inp->din_argv[i] = pidp;
2347 2357 bzero(pinp, sizeof (dt_idnode_t));
2348 2358 dt_ident_type_assign(pidp, pnp->dn_ctfp, pnp->dn_type);
2349 2359 }
2350 2360
2351 2361 dt_idstack_push(&yypcb->pcb_globals, inp->din_hash);
2352 2362 }
2353 2363
2354 2364 /*
2355 2365 * Unlike most constructors, we need to explicitly cook the right-hand
2356 2366 * side of the inline definition immediately to prevent recursion. If
2357 2367 * the right-hand side uses the inline itself, the cook will fail.
2358 2368 */
2359 2369 expr = dt_node_cook(expr, DT_IDFLG_REF);
2360 2370
2361 2371 if (ddp->dd_kind == CTF_K_ARRAY)
2362 2372 dt_idstack_pop(&yypcb->pcb_globals, inp->din_hash);
2363 2373
2364 2374 /*
2365 2375 * Set the type, attributes, and flags for the inline. If the right-
2366 2376 * hand expression has an identifier, propagate its flags. Then cook
2367 2377 * the identifier to fully initialize it: if we're declaring an inline
2368 2378 * associative array this will construct a type signature from 'ddp'.
2369 2379 */
2370 2380 if (dt_node_is_dynamic(expr))
2371 2381 rdp = dt_ident_resolve(expr->dn_ident);
2372 2382 else if (expr->dn_kind == DT_NODE_VAR || expr->dn_kind == DT_NODE_SYM)
2373 2383 rdp = expr->dn_ident;
2374 2384 else
2375 2385 rdp = NULL;
2376 2386
2377 2387 if (rdp != NULL) {
2378 2388 idp->di_flags |= (rdp->di_flags &
2379 2389 (DT_IDFLG_WRITE | DT_IDFLG_USER | DT_IDFLG_PRIM));
2380 2390 }
2381 2391
2382 2392 idp->di_attr = dt_attr_min(_dtrace_defattr, expr->dn_attr);
2383 2393 dt_ident_type_assign(idp, dtt.dtt_ctfp, dtt.dtt_type);
2384 2394 (void) dt_ident_cook(dnp, idp, &ddp->dd_node);
2385 2395
2386 2396 /*
2387 2397 * Store the parse tree nodes for 'expr' inside of idp->di_data ('inp')
2388 2398 * so that they will be preserved with this identifier. Then pop the
2389 2399 * inline declaration from the declaration stack and restore the lexer.
2390 2400 */
2391 2401 inp->din_list = yypcb->pcb_list;
2392 2402 inp->din_root = expr;
2393 2403
2394 2404 dt_decl_free(dt_decl_pop());
2395 2405 yybegin(YYS_CLAUSE);
2396 2406
2397 2407 /*
2398 2408 * Finally, insert the inline identifier into dt_globals to make it
2399 2409 * visible, and then cook 'dnp' to check its type against 'expr'.
2400 2410 */
2401 2411 dt_idhash_xinsert(dtp->dt_globals, idp);
2402 2412 return (dt_node_cook(dnp, DT_IDFLG_REF));
2403 2413 }
2404 2414
2405 2415 dt_node_t *
2406 2416 dt_node_member(dt_decl_t *ddp, char *name, dt_node_t *expr)
2407 2417 {
2408 2418 dtrace_typeinfo_t dtt;
2409 2419 dt_node_t *dnp;
2410 2420 int err;
2411 2421
2412 2422 if (ddp != NULL) {
2413 2423 err = dt_decl_type(ddp, &dtt);
2414 2424 dt_decl_free(ddp);
2415 2425
|
↓ open down ↓ |
579 lines elided |
↑ open up ↑ |
2416 2426 if (err != 0)
2417 2427 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
2418 2428 }
2419 2429
2420 2430 dnp = dt_node_alloc(DT_NODE_MEMBER);
2421 2431 dnp->dn_membname = name;
2422 2432 dnp->dn_membexpr = expr;
2423 2433
2424 2434 if (ddp != NULL)
2425 2435 dt_node_type_assign(dnp, dtt.dtt_ctfp, dtt.dtt_type,
2426 - dtt.dtt_flags);
2436 + dtt.dtt_flags & DTT_FL_USER ? B_TRUE : B_FALSE);
2427 2437
2428 2438 return (dnp);
2429 2439 }
2430 2440
2431 2441 dt_node_t *
2432 2442 dt_node_xlator(dt_decl_t *ddp, dt_decl_t *sdp, char *name, dt_node_t *members)
2433 2443 {
2434 2444 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
2435 2445 dtrace_typeinfo_t src, dst;
2436 2446 dt_node_t sn, dn;
2437 2447 dt_xlator_t *dxp;
2438 2448 dt_node_t *dnp;
2439 2449 int edst, esrc;
2440 2450 uint_t kind;
2441 2451
2442 2452 char n1[DT_TYPE_NAMELEN];
2443 2453 char n2[DT_TYPE_NAMELEN];
2444 2454
2445 2455 edst = dt_decl_type(ddp, &dst);
2446 2456 dt_decl_free(ddp);
2447 2457
2448 2458 esrc = dt_decl_type(sdp, &src);
2449 2459 dt_decl_free(sdp);
2450 2460
2451 2461 if (edst != 0 || esrc != 0) {
2452 2462 free(name);
2453 2463 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
2454 2464 }
2455 2465
2456 2466 bzero(&sn, sizeof (sn));
2457 2467 dt_node_type_assign(&sn, src.dtt_ctfp, src.dtt_type, B_FALSE);
2458 2468
2459 2469 bzero(&dn, sizeof (dn));
2460 2470 dt_node_type_assign(&dn, dst.dtt_ctfp, dst.dtt_type, B_FALSE);
2461 2471
2462 2472 if (dt_xlator_lookup(dtp, &sn, &dn, DT_XLATE_EXACT) != NULL) {
2463 2473 xyerror(D_XLATE_REDECL,
2464 2474 "translator from %s to %s has already been declared\n",
2465 2475 dt_node_type_name(&sn, n1, sizeof (n1)),
2466 2476 dt_node_type_name(&dn, n2, sizeof (n2)));
2467 2477 }
2468 2478
2469 2479 kind = ctf_type_kind(dst.dtt_ctfp,
2470 2480 ctf_type_resolve(dst.dtt_ctfp, dst.dtt_type));
2471 2481
2472 2482 if (kind == CTF_K_FORWARD) {
2473 2483 xyerror(D_XLATE_SOU, "incomplete struct/union/enum %s\n",
2474 2484 dt_type_name(dst.dtt_ctfp, dst.dtt_type, n1, sizeof (n1)));
2475 2485 }
2476 2486
2477 2487 if (kind != CTF_K_STRUCT && kind != CTF_K_UNION) {
2478 2488 xyerror(D_XLATE_SOU,
2479 2489 "translator output type must be a struct or union\n");
2480 2490 }
2481 2491
2482 2492 dxp = dt_xlator_create(dtp, &src, &dst, name, members, yypcb->pcb_list);
2483 2493 yybegin(YYS_CLAUSE);
2484 2494 free(name);
2485 2495
2486 2496 if (dxp == NULL)
2487 2497 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2488 2498
2489 2499 dnp = dt_node_alloc(DT_NODE_XLATOR);
2490 2500 dnp->dn_xlator = dxp;
2491 2501 dnp->dn_members = members;
2492 2502
2493 2503 return (dt_node_cook(dnp, DT_IDFLG_REF));
2494 2504 }
2495 2505
2496 2506 dt_node_t *
2497 2507 dt_node_probe(char *s, int protoc, dt_node_t *nargs, dt_node_t *xargs)
2498 2508 {
2499 2509 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
2500 2510 int nargc, xargc;
2501 2511 dt_node_t *dnp;
2502 2512
2503 2513 size_t len = strlen(s) + 3; /* +3 for :: and \0 */
2504 2514 char *name = alloca(len);
2505 2515
2506 2516 (void) snprintf(name, len, "::%s", s);
2507 2517 (void) strhyphenate(name);
2508 2518 free(s);
2509 2519
2510 2520 if (strchr(name, '`') != NULL) {
2511 2521 xyerror(D_PROV_BADNAME, "probe name may not "
2512 2522 "contain scoping operator: %s\n", name);
2513 2523 }
2514 2524
2515 2525 if (strlen(name) - 2 >= DTRACE_NAMELEN) {
2516 2526 xyerror(D_PROV_BADNAME, "probe name may not exceed %d "
2517 2527 "characters: %s\n", DTRACE_NAMELEN - 1, name);
2518 2528 }
2519 2529
2520 2530 dnp = dt_node_alloc(DT_NODE_PROBE);
2521 2531
2522 2532 dnp->dn_ident = dt_ident_create(name, DT_IDENT_PROBE,
2523 2533 DT_IDFLG_ORPHAN, DTRACE_IDNONE, _dtrace_defattr, 0,
2524 2534 &dt_idops_probe, NULL, dtp->dt_gen);
2525 2535
2526 2536 nargc = dt_decl_prototype(nargs, nargs,
2527 2537 "probe input", DT_DP_VOID | DT_DP_ANON);
2528 2538
2529 2539 xargc = dt_decl_prototype(xargs, nargs,
2530 2540 "probe output", DT_DP_VOID);
2531 2541
2532 2542 if (nargc > UINT8_MAX) {
2533 2543 xyerror(D_PROV_PRARGLEN, "probe %s input prototype exceeds %u "
2534 2544 "parameters: %d params used\n", name, UINT8_MAX, nargc);
2535 2545 }
2536 2546
2537 2547 if (xargc > UINT8_MAX) {
2538 2548 xyerror(D_PROV_PRARGLEN, "probe %s output prototype exceeds %u "
2539 2549 "parameters: %d params used\n", name, UINT8_MAX, xargc);
2540 2550 }
2541 2551
2542 2552 if (dnp->dn_ident == NULL || dt_probe_create(dtp,
2543 2553 dnp->dn_ident, protoc, nargs, nargc, xargs, xargc) == NULL)
2544 2554 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2545 2555
2546 2556 return (dnp);
2547 2557 }
2548 2558
2549 2559 dt_node_t *
2550 2560 dt_node_provider(char *name, dt_node_t *probes)
2551 2561 {
2552 2562 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
2553 2563 dt_node_t *dnp = dt_node_alloc(DT_NODE_PROVIDER);
2554 2564 dt_node_t *lnp;
2555 2565 size_t len;
2556 2566
2557 2567 dnp->dn_provname = name;
2558 2568 dnp->dn_probes = probes;
2559 2569
2560 2570 if (strchr(name, '`') != NULL) {
2561 2571 dnerror(dnp, D_PROV_BADNAME, "provider name may not "
2562 2572 "contain scoping operator: %s\n", name);
2563 2573 }
2564 2574
2565 2575 if ((len = strlen(name)) >= DTRACE_PROVNAMELEN) {
2566 2576 dnerror(dnp, D_PROV_BADNAME, "provider name may not exceed %d "
2567 2577 "characters: %s\n", DTRACE_PROVNAMELEN - 1, name);
2568 2578 }
2569 2579
2570 2580 if (isdigit(name[len - 1])) {
2571 2581 dnerror(dnp, D_PROV_BADNAME, "provider name may not "
2572 2582 "end with a digit: %s\n", name);
2573 2583 }
2574 2584
2575 2585 /*
2576 2586 * Check to see if the provider is already defined or visible through
2577 2587 * dtrace(7D). If so, set dn_provred to treat it as a re-declaration.
2578 2588 * If not, create a new provider and set its interface-only flag. This
2579 2589 * flag may be cleared later by calls made to dt_probe_declare().
2580 2590 */
2581 2591 if ((dnp->dn_provider = dt_provider_lookup(dtp, name)) != NULL)
2582 2592 dnp->dn_provred = B_TRUE;
2583 2593 else if ((dnp->dn_provider = dt_provider_create(dtp, name)) == NULL)
2584 2594 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2585 2595 else
2586 2596 dnp->dn_provider->pv_flags |= DT_PROVIDER_INTF;
2587 2597
2588 2598 /*
2589 2599 * Store all parse nodes created since we consumed the DT_KEY_PROVIDER
2590 2600 * token with the provider and then restore our lexing state to CLAUSE.
2591 2601 * Note that if dnp->dn_provred is true, we may end up storing dups of
2592 2602 * a provider's interface and implementation: we eat this space because
2593 2603 * the implementation will likely need to redeclare probe members, and
2594 2604 * therefore may result in those member nodes becoming persistent.
2595 2605 */
2596 2606 for (lnp = yypcb->pcb_list; lnp->dn_link != NULL; lnp = lnp->dn_link)
2597 2607 continue; /* skip to end of allocation list */
2598 2608
2599 2609 lnp->dn_link = dnp->dn_provider->pv_nodes;
2600 2610 dnp->dn_provider->pv_nodes = yypcb->pcb_list;
2601 2611
2602 2612 yybegin(YYS_CLAUSE);
2603 2613 return (dnp);
2604 2614 }
2605 2615
2606 2616 dt_node_t *
2607 2617 dt_node_program(dt_node_t *lnp)
2608 2618 {
2609 2619 dt_node_t *dnp = dt_node_alloc(DT_NODE_PROG);
2610 2620 dnp->dn_list = lnp;
2611 2621 return (dnp);
2612 2622 }
2613 2623
2614 2624 /*
2615 2625 * This function provides the underlying implementation of cooking an
2616 2626 * identifier given its node, a hash of dynamic identifiers, an identifier
2617 2627 * kind, and a boolean flag indicating whether we are allowed to instantiate
2618 2628 * a new identifier if the string is not found. This function is either
2619 2629 * called from dt_cook_ident(), below, or directly by the various cooking
2620 2630 * routines that are allowed to instantiate identifiers (e.g. op2 TOK_ASGN).
2621 2631 */
2622 2632 static void
2623 2633 dt_xcook_ident(dt_node_t *dnp, dt_idhash_t *dhp, uint_t idkind, int create)
2624 2634 {
2625 2635 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
2626 2636 const char *sname = dt_idhash_name(dhp);
2627 2637 int uref = 0;
2628 2638
2629 2639 dtrace_attribute_t attr = _dtrace_defattr;
2630 2640 dt_ident_t *idp;
2631 2641 dtrace_syminfo_t dts;
2632 2642 GElf_Sym sym;
2633 2643
2634 2644 const char *scope, *mark;
2635 2645 uchar_t dnkind;
2636 2646 char *name;
2637 2647
2638 2648 /*
2639 2649 * Look for scoping marks in the identifier. If one is found, set our
2640 2650 * scope to either DTRACE_OBJ_KMODS or UMODS or to the first part of
2641 2651 * the string that specifies the scope using an explicit module name.
2642 2652 * If two marks in a row are found, set 'uref' (user symbol reference).
2643 2653 * Otherwise we set scope to DTRACE_OBJ_EXEC, indicating that normal
2644 2654 * scope is desired and we should search the specified idhash.
2645 2655 */
2646 2656 if ((name = strrchr(dnp->dn_string, '`')) != NULL) {
2647 2657 if (name > dnp->dn_string && name[-1] == '`') {
2648 2658 uref++;
2649 2659 name[-1] = '\0';
2650 2660 }
2651 2661
2652 2662 if (name == dnp->dn_string + uref)
2653 2663 scope = uref ? DTRACE_OBJ_UMODS : DTRACE_OBJ_KMODS;
2654 2664 else
2655 2665 scope = dnp->dn_string;
2656 2666
2657 2667 *name++ = '\0'; /* leave name pointing after scoping mark */
2658 2668 dnkind = DT_NODE_VAR;
2659 2669
2660 2670 } else if (idkind == DT_IDENT_AGG) {
2661 2671 scope = DTRACE_OBJ_EXEC;
2662 2672 name = dnp->dn_string + 1;
2663 2673 dnkind = DT_NODE_AGG;
2664 2674 } else {
2665 2675 scope = DTRACE_OBJ_EXEC;
2666 2676 name = dnp->dn_string;
2667 2677 dnkind = DT_NODE_VAR;
2668 2678 }
2669 2679
2670 2680 /*
2671 2681 * If create is set to false, and we fail our idhash lookup, preset
2672 2682 * the errno code to EDT_NOVAR for our final error message below.
2673 2683 * If we end up calling dtrace_lookup_by_name(), it will reset the
2674 2684 * errno appropriately and that error will be reported instead.
2675 2685 */
2676 2686 (void) dt_set_errno(dtp, EDT_NOVAR);
2677 2687 mark = uref ? "``" : "`";
2678 2688
2679 2689 if (scope == DTRACE_OBJ_EXEC && (
2680 2690 (dhp != dtp->dt_globals &&
2681 2691 (idp = dt_idhash_lookup(dhp, name)) != NULL) ||
2682 2692 (dhp == dtp->dt_globals &&
2683 2693 (idp = dt_idstack_lookup(&yypcb->pcb_globals, name)) != NULL))) {
2684 2694 /*
2685 2695 * Check that we are referencing the ident in the manner that
2686 2696 * matches its type if this is a global lookup. In the TLS or
2687 2697 * local case, we don't know how the ident will be used until
2688 2698 * the time operator -> is seen; more parsing is needed.
2689 2699 */
2690 2700 if (idp->di_kind != idkind && dhp == dtp->dt_globals) {
2691 2701 xyerror(D_IDENT_BADREF, "%s '%s' may not be referenced "
2692 2702 "as %s\n", dt_idkind_name(idp->di_kind),
2693 2703 idp->di_name, dt_idkind_name(idkind));
2694 2704 }
2695 2705
2696 2706 /*
2697 2707 * Arrays and aggregations are not cooked individually. They
2698 2708 * have dynamic types and must be referenced using operator [].
2699 2709 * This is handled explicitly by the code for DT_TOK_LBRAC.
2700 2710 */
2701 2711 if (idp->di_kind != DT_IDENT_ARRAY &&
2702 2712 idp->di_kind != DT_IDENT_AGG)
2703 2713 attr = dt_ident_cook(dnp, idp, NULL);
2704 2714 else {
2705 2715 dt_node_type_assign(dnp,
2706 2716 DT_DYN_CTFP(dtp), DT_DYN_TYPE(dtp), B_FALSE);
2707 2717 attr = idp->di_attr;
2708 2718 }
2709 2719
2710 2720 free(dnp->dn_string);
2711 2721 dnp->dn_string = NULL;
2712 2722 dnp->dn_kind = dnkind;
2713 2723 dnp->dn_ident = idp;
2714 2724 dnp->dn_flags |= DT_NF_LVALUE;
2715 2725
2716 2726 if (idp->di_flags & DT_IDFLG_WRITE)
2717 2727 dnp->dn_flags |= DT_NF_WRITABLE;
2718 2728
2719 2729 dt_node_attr_assign(dnp, attr);
2720 2730
2721 2731 } else if (dhp == dtp->dt_globals && scope != DTRACE_OBJ_EXEC &&
2722 2732 dtrace_lookup_by_name(dtp, scope, name, &sym, &dts) == 0) {
2723 2733
2724 2734 dt_module_t *mp = dt_module_lookup_by_name(dtp, dts.dts_object);
2725 2735 int umod = (mp->dm_flags & DT_DM_KERNEL) == 0;
2726 2736 static const char *const kunames[] = { "kernel", "user" };
2727 2737
2728 2738 dtrace_typeinfo_t dtt;
2729 2739 dtrace_syminfo_t *sip;
2730 2740
2731 2741 if (uref ^ umod) {
2732 2742 xyerror(D_SYM_BADREF, "%s module '%s' symbol '%s' may "
2733 2743 "not be referenced as a %s symbol\n", kunames[umod],
2734 2744 dts.dts_object, dts.dts_name, kunames[uref]);
2735 2745 }
2736 2746
2737 2747 if (dtrace_symbol_type(dtp, &sym, &dts, &dtt) != 0) {
2738 2748 /*
2739 2749 * For now, we special-case EDT_DATAMODEL to clarify
2740 2750 * that mixed data models are not currently supported.
2741 2751 */
2742 2752 if (dtp->dt_errno == EDT_DATAMODEL) {
2743 2753 xyerror(D_SYM_MODEL, "cannot use %s symbol "
2744 2754 "%s%s%s in a %s D program\n",
2745 2755 dt_module_modelname(mp),
2746 2756 dts.dts_object, mark, dts.dts_name,
2747 2757 dt_module_modelname(dtp->dt_ddefs));
2748 2758 }
2749 2759
2750 2760 xyerror(D_SYM_NOTYPES,
2751 2761 "no symbolic type information is available for "
2752 2762 "%s%s%s: %s\n", dts.dts_object, mark, dts.dts_name,
2753 2763 dtrace_errmsg(dtp, dtrace_errno(dtp)));
2754 2764 }
2755 2765
2756 2766 idp = dt_ident_create(name, DT_IDENT_SYMBOL, 0, 0,
2757 2767 _dtrace_symattr, 0, &dt_idops_thaw, NULL, dtp->dt_gen);
2758 2768
2759 2769 if (idp == NULL)
2760 2770 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2761 2771
2762 2772 if (mp->dm_flags & DT_DM_PRIMARY)
2763 2773 idp->di_flags |= DT_IDFLG_PRIM;
2764 2774
2765 2775 idp->di_next = dtp->dt_externs;
2766 2776 dtp->dt_externs = idp;
2767 2777
2768 2778 if ((sip = malloc(sizeof (dtrace_syminfo_t))) == NULL)
2769 2779 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2770 2780
2771 2781 bcopy(&dts, sip, sizeof (dtrace_syminfo_t));
2772 2782 idp->di_data = sip;
|
↓ open down ↓ |
336 lines elided |
↑ open up ↑ |
2773 2783 idp->di_ctfp = dtt.dtt_ctfp;
2774 2784 idp->di_type = dtt.dtt_type;
2775 2785
2776 2786 free(dnp->dn_string);
2777 2787 dnp->dn_string = NULL;
2778 2788 dnp->dn_kind = DT_NODE_SYM;
2779 2789 dnp->dn_ident = idp;
2780 2790 dnp->dn_flags |= DT_NF_LVALUE;
2781 2791
2782 2792 dt_node_type_assign(dnp, dtt.dtt_ctfp, dtt.dtt_type,
2783 - dtt.dtt_flags);
2793 + dtt.dtt_flags & DTT_FL_USER ? B_TRUE : B_FALSE);
2784 2794 dt_node_attr_assign(dnp, _dtrace_symattr);
2785 2795
2786 2796 if (uref) {
2787 2797 idp->di_flags |= DT_IDFLG_USER;
2788 2798 dnp->dn_flags |= DT_NF_USERLAND;
2789 2799 }
2790 2800
2791 2801 } else if (scope == DTRACE_OBJ_EXEC && create == B_TRUE) {
2792 2802 uint_t flags = DT_IDFLG_WRITE;
2793 2803 uint_t id;
2794 2804
2795 2805 if (dt_idhash_nextid(dhp, &id) == -1) {
2796 2806 xyerror(D_ID_OFLOW, "cannot create %s: limit on number "
2797 2807 "of %s variables exceeded\n", name, sname);
2798 2808 }
2799 2809
2800 2810 if (dhp == yypcb->pcb_locals)
2801 2811 flags |= DT_IDFLG_LOCAL;
2802 2812 else if (dhp == dtp->dt_tls)
2803 2813 flags |= DT_IDFLG_TLS;
2804 2814
2805 2815 dt_dprintf("create %s %s variable %s, id=%u\n",
2806 2816 sname, dt_idkind_name(idkind), name, id);
2807 2817
2808 2818 if (idkind == DT_IDENT_ARRAY || idkind == DT_IDENT_AGG) {
2809 2819 idp = dt_idhash_insert(dhp, name,
2810 2820 idkind, flags, id, _dtrace_defattr, 0,
2811 2821 &dt_idops_assc, NULL, dtp->dt_gen);
2812 2822 } else {
2813 2823 idp = dt_idhash_insert(dhp, name,
2814 2824 idkind, flags, id, _dtrace_defattr, 0,
2815 2825 &dt_idops_thaw, NULL, dtp->dt_gen);
2816 2826 }
2817 2827
2818 2828 if (idp == NULL)
2819 2829 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2820 2830
2821 2831 /*
2822 2832 * Arrays and aggregations are not cooked individually. They
2823 2833 * have dynamic types and must be referenced using operator [].
2824 2834 * This is handled explicitly by the code for DT_TOK_LBRAC.
2825 2835 */
2826 2836 if (idp->di_kind != DT_IDENT_ARRAY &&
2827 2837 idp->di_kind != DT_IDENT_AGG)
2828 2838 attr = dt_ident_cook(dnp, idp, NULL);
2829 2839 else {
2830 2840 dt_node_type_assign(dnp,
2831 2841 DT_DYN_CTFP(dtp), DT_DYN_TYPE(dtp), B_FALSE);
2832 2842 attr = idp->di_attr;
2833 2843 }
2834 2844
2835 2845 free(dnp->dn_string);
2836 2846 dnp->dn_string = NULL;
2837 2847 dnp->dn_kind = dnkind;
2838 2848 dnp->dn_ident = idp;
2839 2849 dnp->dn_flags |= DT_NF_LVALUE | DT_NF_WRITABLE;
2840 2850
2841 2851 dt_node_attr_assign(dnp, attr);
2842 2852
2843 2853 } else if (scope != DTRACE_OBJ_EXEC) {
2844 2854 xyerror(D_IDENT_UNDEF, "failed to resolve %s%s%s: %s\n",
2845 2855 dnp->dn_string, mark, name,
2846 2856 dtrace_errmsg(dtp, dtrace_errno(dtp)));
2847 2857 } else {
2848 2858 xyerror(D_IDENT_UNDEF, "failed to resolve %s: %s\n",
2849 2859 dnp->dn_string, dtrace_errmsg(dtp, dtrace_errno(dtp)));
2850 2860 }
2851 2861 }
2852 2862
2853 2863 static dt_node_t *
2854 2864 dt_cook_ident(dt_node_t *dnp, uint_t idflags)
2855 2865 {
2856 2866 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
2857 2867
2858 2868 if (dnp->dn_op == DT_TOK_AGG)
2859 2869 dt_xcook_ident(dnp, dtp->dt_aggs, DT_IDENT_AGG, B_FALSE);
2860 2870 else
2861 2871 dt_xcook_ident(dnp, dtp->dt_globals, DT_IDENT_SCALAR, B_FALSE);
2862 2872
2863 2873 return (dt_node_cook(dnp, idflags));
2864 2874 }
2865 2875
2866 2876 /*
2867 2877 * Since operators [ and -> can instantiate new variables before we know
2868 2878 * whether the reference is for a read or a write, we need to check read
2869 2879 * references to determine if the identifier is currently dt_ident_unref().
2870 2880 * If so, we report that this first access was to an undefined variable.
2871 2881 */
2872 2882 static dt_node_t *
2873 2883 dt_cook_var(dt_node_t *dnp, uint_t idflags)
2874 2884 {
2875 2885 dt_ident_t *idp = dnp->dn_ident;
2876 2886
2877 2887 if ((idflags & DT_IDFLG_REF) && dt_ident_unref(idp)) {
2878 2888 dnerror(dnp, D_VAR_UNDEF,
2879 2889 "%s%s has not yet been declared or assigned\n",
2880 2890 (idp->di_flags & DT_IDFLG_LOCAL) ? "this->" :
2881 2891 (idp->di_flags & DT_IDFLG_TLS) ? "self->" : "",
2882 2892 idp->di_name);
2883 2893 }
2884 2894
2885 2895 dt_node_attr_assign(dnp, dt_ident_cook(dnp, idp, &dnp->dn_args));
2886 2896 return (dnp);
2887 2897 }
2888 2898
2889 2899 /*ARGSUSED*/
2890 2900 static dt_node_t *
2891 2901 dt_cook_func(dt_node_t *dnp, uint_t idflags)
2892 2902 {
2893 2903 dt_node_attr_assign(dnp,
2894 2904 dt_ident_cook(dnp, dnp->dn_ident, &dnp->dn_args));
2895 2905
2896 2906 return (dnp);
2897 2907 }
2898 2908
2899 2909 static dt_node_t *
2900 2910 dt_cook_op1(dt_node_t *dnp, uint_t idflags)
2901 2911 {
2902 2912 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
2903 2913 dt_node_t *cp = dnp->dn_child;
2904 2914
2905 2915 char n[DT_TYPE_NAMELEN];
2906 2916 dtrace_typeinfo_t dtt;
2907 2917 dt_ident_t *idp;
2908 2918
2909 2919 ctf_encoding_t e;
2910 2920 ctf_arinfo_t r;
2911 2921 ctf_id_t type, base;
2912 2922 uint_t kind;
2913 2923
2914 2924 if (dnp->dn_op == DT_TOK_PREINC || dnp->dn_op == DT_TOK_POSTINC ||
2915 2925 dnp->dn_op == DT_TOK_PREDEC || dnp->dn_op == DT_TOK_POSTDEC)
2916 2926 idflags = DT_IDFLG_REF | DT_IDFLG_MOD;
2917 2927 else
2918 2928 idflags = DT_IDFLG_REF;
2919 2929
2920 2930 /*
2921 2931 * We allow the unary ++ and -- operators to instantiate new scalar
2922 2932 * variables if applied to an identifier; otherwise just cook as usual.
2923 2933 */
2924 2934 if (cp->dn_kind == DT_NODE_IDENT && (idflags & DT_IDFLG_MOD))
|
↓ open down ↓ |
131 lines elided |
↑ open up ↑ |
2925 2935 dt_xcook_ident(cp, dtp->dt_globals, DT_IDENT_SCALAR, B_TRUE);
2926 2936
2927 2937 cp = dnp->dn_child = dt_node_cook(cp, 0); /* don't set idflags yet */
2928 2938
2929 2939 if (cp->dn_kind == DT_NODE_VAR && dt_ident_unref(cp->dn_ident)) {
2930 2940 if (dt_type_lookup("int64_t", &dtt) != 0)
2931 2941 xyerror(D_TYPE_ERR, "failed to lookup int64_t\n");
2932 2942
2933 2943 dt_ident_type_assign(cp->dn_ident, dtt.dtt_ctfp, dtt.dtt_type);
2934 2944 dt_node_type_assign(cp, dtt.dtt_ctfp, dtt.dtt_type,
2935 - dtt.dtt_flags);
2945 + dtt.dtt_flags & DTT_FL_USER ? B_TRUE : B_FALSE);
2936 2946 }
2937 2947
2938 2948 if (cp->dn_kind == DT_NODE_VAR)
2939 2949 cp->dn_ident->di_flags |= idflags;
2940 2950
2941 2951 switch (dnp->dn_op) {
2942 2952 case DT_TOK_DEREF:
2943 2953 /*
2944 2954 * If the deref operator is applied to a translated pointer,
2945 2955 * we set our output type to the output of the translation.
2946 2956 */
2947 2957 if ((idp = dt_node_resolve(cp, DT_IDENT_XLPTR)) != NULL) {
2948 2958 dt_xlator_t *dxp = idp->di_data;
2949 2959
2950 2960 dnp->dn_ident = &dxp->dx_souid;
2951 2961 dt_node_type_assign(dnp,
2952 2962 dnp->dn_ident->di_ctfp, dnp->dn_ident->di_type,
2953 2963 cp->dn_flags & DT_NF_USERLAND);
2954 2964 break;
2955 2965 }
2956 2966
2957 2967 type = ctf_type_resolve(cp->dn_ctfp, cp->dn_type);
2958 2968 kind = ctf_type_kind(cp->dn_ctfp, type);
2959 2969
2960 2970 if (kind == CTF_K_ARRAY) {
2961 2971 if (ctf_array_info(cp->dn_ctfp, type, &r) != 0) {
2962 2972 dtp->dt_ctferr = ctf_errno(cp->dn_ctfp);
2963 2973 longjmp(yypcb->pcb_jmpbuf, EDT_CTF);
2964 2974 } else
2965 2975 type = r.ctr_contents;
2966 2976 } else if (kind == CTF_K_POINTER) {
2967 2977 type = ctf_type_reference(cp->dn_ctfp, type);
2968 2978 } else {
2969 2979 xyerror(D_DEREF_NONPTR,
2970 2980 "cannot dereference non-pointer type\n");
2971 2981 }
2972 2982
2973 2983 dt_node_type_assign(dnp, cp->dn_ctfp, type,
2974 2984 cp->dn_flags & DT_NF_USERLAND);
2975 2985 base = ctf_type_resolve(cp->dn_ctfp, type);
2976 2986 kind = ctf_type_kind(cp->dn_ctfp, base);
2977 2987
2978 2988 if (kind == CTF_K_INTEGER && ctf_type_encoding(cp->dn_ctfp,
2979 2989 base, &e) == 0 && IS_VOID(e)) {
2980 2990 xyerror(D_DEREF_VOID,
2981 2991 "cannot dereference pointer to void\n");
2982 2992 }
2983 2993
2984 2994 if (kind == CTF_K_FUNCTION) {
2985 2995 xyerror(D_DEREF_FUNC,
2986 2996 "cannot dereference pointer to function\n");
2987 2997 }
2988 2998
2989 2999 if (kind != CTF_K_ARRAY || dt_node_is_string(dnp))
2990 3000 dnp->dn_flags |= DT_NF_LVALUE; /* see K&R[A7.4.3] */
2991 3001
2992 3002 /*
2993 3003 * If we propagated the l-value bit and the child operand was
2994 3004 * a writable D variable or a binary operation of the form
2995 3005 * a + b where a is writable, then propagate the writable bit.
2996 3006 * This is necessary to permit assignments to scalar arrays,
2997 3007 * which are converted to expressions of the form *(a + i).
2998 3008 */
2999 3009 if ((cp->dn_flags & DT_NF_WRITABLE) ||
3000 3010 (cp->dn_kind == DT_NODE_OP2 && cp->dn_op == DT_TOK_ADD &&
3001 3011 (cp->dn_left->dn_flags & DT_NF_WRITABLE)))
3002 3012 dnp->dn_flags |= DT_NF_WRITABLE;
3003 3013
3004 3014 if ((cp->dn_flags & DT_NF_USERLAND) &&
3005 3015 (kind == CTF_K_POINTER || (dnp->dn_flags & DT_NF_REF)))
3006 3016 dnp->dn_flags |= DT_NF_USERLAND;
3007 3017 break;
3008 3018
3009 3019 case DT_TOK_IPOS:
3010 3020 case DT_TOK_INEG:
3011 3021 if (!dt_node_is_arith(cp)) {
3012 3022 xyerror(D_OP_ARITH, "operator %s requires an operand "
3013 3023 "of arithmetic type\n", opstr(dnp->dn_op));
3014 3024 }
3015 3025 dt_node_type_propagate(cp, dnp); /* see K&R[A7.4.4-6] */
3016 3026 break;
3017 3027
3018 3028 case DT_TOK_BNEG:
3019 3029 if (!dt_node_is_integer(cp)) {
3020 3030 xyerror(D_OP_INT, "operator %s requires an operand of "
3021 3031 "integral type\n", opstr(dnp->dn_op));
3022 3032 }
3023 3033 dt_node_type_propagate(cp, dnp); /* see K&R[A7.4.4-6] */
3024 3034 break;
3025 3035
3026 3036 case DT_TOK_LNEG:
3027 3037 if (!dt_node_is_scalar(cp)) {
3028 3038 xyerror(D_OP_SCALAR, "operator %s requires an operand "
3029 3039 "of scalar type\n", opstr(dnp->dn_op));
3030 3040 }
3031 3041 dt_node_type_assign(dnp, DT_INT_CTFP(dtp), DT_INT_TYPE(dtp),
3032 3042 B_FALSE);
3033 3043 break;
3034 3044
3035 3045 case DT_TOK_ADDROF:
3036 3046 if (cp->dn_kind == DT_NODE_VAR || cp->dn_kind == DT_NODE_AGG) {
3037 3047 xyerror(D_ADDROF_VAR,
3038 3048 "cannot take address of dynamic variable\n");
3039 3049 }
3040 3050
3041 3051 if (dt_node_is_dynamic(cp)) {
3042 3052 xyerror(D_ADDROF_VAR,
3043 3053 "cannot take address of dynamic object\n");
3044 3054 }
3045 3055
3046 3056 if (!(cp->dn_flags & DT_NF_LVALUE)) {
3047 3057 xyerror(D_ADDROF_LVAL, /* see K&R[A7.4.2] */
3048 3058 "unacceptable operand for unary & operator\n");
3049 3059 }
3050 3060
3051 3061 if (cp->dn_flags & DT_NF_BITFIELD) {
3052 3062 xyerror(D_ADDROF_BITFIELD,
3053 3063 "cannot take address of bit-field\n");
3054 3064 }
3055 3065
3056 3066 dtt.dtt_object = NULL;
3057 3067 dtt.dtt_ctfp = cp->dn_ctfp;
3058 3068 dtt.dtt_type = cp->dn_type;
3059 3069
3060 3070 if (dt_type_pointer(&dtt) == -1) {
3061 3071 xyerror(D_TYPE_ERR, "cannot find type for \"&\": %s*\n",
3062 3072 dt_node_type_name(cp, n, sizeof (n)));
3063 3073 }
3064 3074
3065 3075 dt_node_type_assign(dnp, dtt.dtt_ctfp, dtt.dtt_type,
3066 3076 cp->dn_flags & DT_NF_USERLAND);
3067 3077 break;
3068 3078
3069 3079 case DT_TOK_SIZEOF:
3070 3080 if (cp->dn_flags & DT_NF_BITFIELD) {
3071 3081 xyerror(D_SIZEOF_BITFIELD,
3072 3082 "cannot apply sizeof to a bit-field\n");
3073 3083 }
3074 3084
3075 3085 if (dt_node_sizeof(cp) == 0) {
3076 3086 xyerror(D_SIZEOF_TYPE, "cannot apply sizeof to an "
3077 3087 "operand of unknown size\n");
3078 3088 }
3079 3089
3080 3090 dt_node_type_assign(dnp, dtp->dt_ddefs->dm_ctfp,
3081 3091 ctf_lookup_by_name(dtp->dt_ddefs->dm_ctfp, "size_t"),
3082 3092 B_FALSE);
3083 3093 break;
3084 3094
3085 3095 case DT_TOK_STRINGOF:
3086 3096 if (!dt_node_is_scalar(cp) && !dt_node_is_pointer(cp) &&
3087 3097 !dt_node_is_strcompat(cp)) {
3088 3098 xyerror(D_STRINGOF_TYPE,
3089 3099 "cannot apply stringof to a value of type %s\n",
3090 3100 dt_node_type_name(cp, n, sizeof (n)));
3091 3101 }
3092 3102 dt_node_type_assign(dnp, DT_STR_CTFP(dtp), DT_STR_TYPE(dtp),
3093 3103 cp->dn_flags & DT_NF_USERLAND);
3094 3104 break;
3095 3105
3096 3106 case DT_TOK_PREINC:
3097 3107 case DT_TOK_POSTINC:
3098 3108 case DT_TOK_PREDEC:
3099 3109 case DT_TOK_POSTDEC:
3100 3110 if (dt_node_is_scalar(cp) == 0) {
3101 3111 xyerror(D_OP_SCALAR, "operator %s requires operand of "
3102 3112 "scalar type\n", opstr(dnp->dn_op));
3103 3113 }
3104 3114
3105 3115 if (dt_node_is_vfptr(cp)) {
3106 3116 xyerror(D_OP_VFPTR, "operator %s requires an operand "
3107 3117 "of known size\n", opstr(dnp->dn_op));
3108 3118 }
3109 3119
3110 3120 if (!(cp->dn_flags & DT_NF_LVALUE)) {
3111 3121 xyerror(D_OP_LVAL, "operator %s requires modifiable "
3112 3122 "lvalue as an operand\n", opstr(dnp->dn_op));
3113 3123 }
3114 3124
3115 3125 if (!(cp->dn_flags & DT_NF_WRITABLE)) {
3116 3126 xyerror(D_OP_WRITE, "operator %s can only be applied "
3117 3127 "to a writable variable\n", opstr(dnp->dn_op));
3118 3128 }
3119 3129
3120 3130 dt_node_type_propagate(cp, dnp); /* see K&R[A7.4.1] */
3121 3131 break;
3122 3132
3123 3133 default:
3124 3134 xyerror(D_UNKNOWN, "invalid unary op %s\n", opstr(dnp->dn_op));
3125 3135 }
3126 3136
3127 3137 dt_node_attr_assign(dnp, cp->dn_attr);
3128 3138 return (dnp);
3129 3139 }
3130 3140
3131 3141 static void
3132 3142 dt_assign_common(dt_node_t *dnp)
3133 3143 {
3134 3144 dt_node_t *lp = dnp->dn_left;
3135 3145 dt_node_t *rp = dnp->dn_right;
3136 3146 int op = dnp->dn_op;
3137 3147
3138 3148 if (rp->dn_kind == DT_NODE_INT)
3139 3149 dt_cast(lp, rp);
3140 3150
3141 3151 if (!(lp->dn_flags & DT_NF_LVALUE)) {
3142 3152 xyerror(D_OP_LVAL, "operator %s requires modifiable "
3143 3153 "lvalue as an operand\n", opstr(op));
3144 3154 /* see K&R[A7.17] */
3145 3155 }
3146 3156
3147 3157 if (!(lp->dn_flags & DT_NF_WRITABLE)) {
3148 3158 xyerror(D_OP_WRITE, "operator %s can only be applied "
3149 3159 "to a writable variable\n", opstr(op));
3150 3160 }
3151 3161
3152 3162 dt_node_type_propagate(lp, dnp); /* see K&R[A7.17] */
3153 3163 dt_node_attr_assign(dnp, dt_attr_min(lp->dn_attr, rp->dn_attr));
3154 3164 }
3155 3165
3156 3166 static dt_node_t *
3157 3167 dt_cook_op2(dt_node_t *dnp, uint_t idflags)
3158 3168 {
3159 3169 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
3160 3170 dt_node_t *lp = dnp->dn_left;
3161 3171 dt_node_t *rp = dnp->dn_right;
3162 3172 int op = dnp->dn_op;
3163 3173
3164 3174 ctf_membinfo_t m;
3165 3175 ctf_file_t *ctfp;
3166 3176 ctf_id_t type;
3167 3177 int kind, val, uref;
3168 3178 dt_ident_t *idp;
3169 3179
3170 3180 char n1[DT_TYPE_NAMELEN];
3171 3181 char n2[DT_TYPE_NAMELEN];
3172 3182
3173 3183 /*
3174 3184 * The expression E1[E2] is identical by definition to *((E1)+(E2)) so
3175 3185 * we convert "[" to "+" and glue on "*" at the end (see K&R[A7.3.1])
3176 3186 * unless the left-hand side is an untyped D scalar, associative array,
3177 3187 * or aggregation. In these cases, we proceed to case DT_TOK_LBRAC and
3178 3188 * handle associative array and aggregation references there.
3179 3189 */
3180 3190 if (op == DT_TOK_LBRAC) {
3181 3191 if (lp->dn_kind == DT_NODE_IDENT) {
3182 3192 dt_idhash_t *dhp;
3183 3193 uint_t idkind;
3184 3194
3185 3195 if (lp->dn_op == DT_TOK_AGG) {
3186 3196 dhp = dtp->dt_aggs;
3187 3197 idp = dt_idhash_lookup(dhp, lp->dn_string + 1);
3188 3198 idkind = DT_IDENT_AGG;
3189 3199 } else {
3190 3200 dhp = dtp->dt_globals;
3191 3201 idp = dt_idstack_lookup(
3192 3202 &yypcb->pcb_globals, lp->dn_string);
3193 3203 idkind = DT_IDENT_ARRAY;
3194 3204 }
3195 3205
3196 3206 if (idp == NULL || dt_ident_unref(idp))
3197 3207 dt_xcook_ident(lp, dhp, idkind, B_TRUE);
3198 3208 else
3199 3209 dt_xcook_ident(lp, dhp, idp->di_kind, B_FALSE);
3200 3210 } else
3201 3211 lp = dnp->dn_left = dt_node_cook(lp, 0);
3202 3212
3203 3213 /*
3204 3214 * Switch op to '+' for *(E1 + E2) array mode in these cases:
3205 3215 * (a) lp is a DT_IDENT_ARRAY variable that has already been
3206 3216 * referenced using [] notation (dn_args != NULL).
3207 3217 * (b) lp is a non-ARRAY variable that has already been given
3208 3218 * a type by assignment or declaration (!dt_ident_unref())
3209 3219 * (c) lp is neither a variable nor an aggregation
3210 3220 */
3211 3221 if (lp->dn_kind == DT_NODE_VAR) {
3212 3222 if (lp->dn_ident->di_kind == DT_IDENT_ARRAY) {
3213 3223 if (lp->dn_args != NULL)
3214 3224 op = DT_TOK_ADD;
3215 3225 } else if (!dt_ident_unref(lp->dn_ident))
3216 3226 op = DT_TOK_ADD;
3217 3227 } else if (lp->dn_kind != DT_NODE_AGG)
3218 3228 op = DT_TOK_ADD;
3219 3229 }
3220 3230
3221 3231 switch (op) {
3222 3232 case DT_TOK_BAND:
3223 3233 case DT_TOK_XOR:
3224 3234 case DT_TOK_BOR:
3225 3235 lp = dnp->dn_left = dt_node_cook(lp, DT_IDFLG_REF);
3226 3236 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3227 3237
3228 3238 if (!dt_node_is_integer(lp) || !dt_node_is_integer(rp)) {
3229 3239 xyerror(D_OP_INT, "operator %s requires operands of "
3230 3240 "integral type\n", opstr(op));
3231 3241 }
3232 3242
3233 3243 dt_node_promote(lp, rp, dnp); /* see K&R[A7.11-13] */
3234 3244 break;
3235 3245
3236 3246 case DT_TOK_LSH:
3237 3247 case DT_TOK_RSH:
3238 3248 lp = dnp->dn_left = dt_node_cook(lp, DT_IDFLG_REF);
3239 3249 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3240 3250
3241 3251 if (!dt_node_is_integer(lp) || !dt_node_is_integer(rp)) {
3242 3252 xyerror(D_OP_INT, "operator %s requires operands of "
3243 3253 "integral type\n", opstr(op));
3244 3254 }
3245 3255
3246 3256 dt_node_type_propagate(lp, dnp); /* see K&R[A7.8] */
3247 3257 dt_node_attr_assign(dnp, dt_attr_min(lp->dn_attr, rp->dn_attr));
3248 3258 break;
3249 3259
3250 3260 case DT_TOK_MOD:
3251 3261 lp = dnp->dn_left = dt_node_cook(lp, DT_IDFLG_REF);
3252 3262 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3253 3263
3254 3264 if (!dt_node_is_integer(lp) || !dt_node_is_integer(rp)) {
3255 3265 xyerror(D_OP_INT, "operator %s requires operands of "
3256 3266 "integral type\n", opstr(op));
3257 3267 }
3258 3268
3259 3269 dt_node_promote(lp, rp, dnp); /* see K&R[A7.6] */
3260 3270 break;
3261 3271
3262 3272 case DT_TOK_MUL:
3263 3273 case DT_TOK_DIV:
3264 3274 lp = dnp->dn_left = dt_node_cook(lp, DT_IDFLG_REF);
3265 3275 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3266 3276
3267 3277 if (!dt_node_is_arith(lp) || !dt_node_is_arith(rp)) {
3268 3278 xyerror(D_OP_ARITH, "operator %s requires operands of "
3269 3279 "arithmetic type\n", opstr(op));
3270 3280 }
3271 3281
3272 3282 dt_node_promote(lp, rp, dnp); /* see K&R[A7.6] */
3273 3283 break;
3274 3284
3275 3285 case DT_TOK_LAND:
3276 3286 case DT_TOK_LXOR:
3277 3287 case DT_TOK_LOR:
3278 3288 lp = dnp->dn_left = dt_node_cook(lp, DT_IDFLG_REF);
3279 3289 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3280 3290
3281 3291 if (!dt_node_is_scalar(lp) || !dt_node_is_scalar(rp)) {
3282 3292 xyerror(D_OP_SCALAR, "operator %s requires operands "
3283 3293 "of scalar type\n", opstr(op));
3284 3294 }
3285 3295
3286 3296 dt_node_type_assign(dnp, DT_INT_CTFP(dtp), DT_INT_TYPE(dtp),
3287 3297 B_FALSE);
3288 3298 dt_node_attr_assign(dnp, dt_attr_min(lp->dn_attr, rp->dn_attr));
3289 3299 break;
3290 3300
3291 3301 case DT_TOK_LT:
3292 3302 case DT_TOK_LE:
3293 3303 case DT_TOK_GT:
3294 3304 case DT_TOK_GE:
3295 3305 case DT_TOK_EQU:
3296 3306 case DT_TOK_NEQ:
3297 3307 /*
3298 3308 * The D comparison operators provide the ability to transform
3299 3309 * a right-hand identifier into a corresponding enum tag value
3300 3310 * if the left-hand side is an enum type. To do this, we cook
3301 3311 * the left-hand side, and then see if the right-hand side is
3302 3312 * an unscoped identifier defined in the enum. If so, we
3303 3313 * convert into an integer constant node with the tag's value.
3304 3314 */
3305 3315 lp = dnp->dn_left = dt_node_cook(lp, DT_IDFLG_REF);
3306 3316
3307 3317 kind = ctf_type_kind(lp->dn_ctfp,
3308 3318 ctf_type_resolve(lp->dn_ctfp, lp->dn_type));
3309 3319
3310 3320 if (kind == CTF_K_ENUM && rp->dn_kind == DT_NODE_IDENT &&
3311 3321 strchr(rp->dn_string, '`') == NULL && ctf_enum_value(
3312 3322 lp->dn_ctfp, lp->dn_type, rp->dn_string, &val) == 0) {
3313 3323
3314 3324 if ((idp = dt_idstack_lookup(&yypcb->pcb_globals,
3315 3325 rp->dn_string)) != NULL) {
3316 3326 xyerror(D_IDENT_AMBIG,
3317 3327 "ambiguous use of operator %s: %s is "
3318 3328 "both a %s enum tag and a global %s\n",
3319 3329 opstr(op), rp->dn_string,
3320 3330 dt_node_type_name(lp, n1, sizeof (n1)),
3321 3331 dt_idkind_name(idp->di_kind));
3322 3332 }
3323 3333
3324 3334 free(rp->dn_string);
3325 3335 rp->dn_string = NULL;
3326 3336 rp->dn_kind = DT_NODE_INT;
3327 3337 rp->dn_flags |= DT_NF_COOKED;
3328 3338 rp->dn_op = DT_TOK_INT;
3329 3339 rp->dn_value = (intmax_t)val;
3330 3340
3331 3341 dt_node_type_assign(rp, lp->dn_ctfp, lp->dn_type,
3332 3342 B_FALSE);
3333 3343 dt_node_attr_assign(rp, _dtrace_symattr);
3334 3344 }
3335 3345
3336 3346 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3337 3347
3338 3348 /*
3339 3349 * The rules for type checking for the relational operators are
3340 3350 * described in the ANSI-C spec (see K&R[A7.9-10]). We perform
3341 3351 * the various tests in order from least to most expensive. We
3342 3352 * also allow derived strings to be compared as a first-class
3343 3353 * type (resulting in a strcmp(3C)-style comparison), and we
3344 3354 * slightly relax the A7.9 rules to permit void pointer
3345 3355 * comparisons as in A7.10. Our users won't be confused by
3346 3356 * this since they understand pointers are just numbers, and
3347 3357 * relaxing this constraint simplifies the implementation.
3348 3358 */
3349 3359 if (ctf_type_compat(lp->dn_ctfp, lp->dn_type,
3350 3360 rp->dn_ctfp, rp->dn_type))
3351 3361 /*EMPTY*/;
3352 3362 else if (dt_node_is_integer(lp) && dt_node_is_integer(rp))
3353 3363 /*EMPTY*/;
3354 3364 else if (dt_node_is_strcompat(lp) && dt_node_is_strcompat(rp) &&
3355 3365 (dt_node_is_string(lp) || dt_node_is_string(rp)))
3356 3366 /*EMPTY*/;
3357 3367 else if (dt_node_is_ptrcompat(lp, rp, NULL, NULL) == 0) {
3358 3368 xyerror(D_OP_INCOMPAT, "operands have "
3359 3369 "incompatible types: \"%s\" %s \"%s\"\n",
3360 3370 dt_node_type_name(lp, n1, sizeof (n1)), opstr(op),
3361 3371 dt_node_type_name(rp, n2, sizeof (n2)));
3362 3372 }
3363 3373
3364 3374 dt_node_type_assign(dnp, DT_INT_CTFP(dtp), DT_INT_TYPE(dtp),
3365 3375 B_FALSE);
3366 3376 dt_node_attr_assign(dnp, dt_attr_min(lp->dn_attr, rp->dn_attr));
3367 3377 break;
3368 3378
3369 3379 case DT_TOK_ADD:
3370 3380 case DT_TOK_SUB: {
3371 3381 /*
3372 3382 * The rules for type checking for the additive operators are
3373 3383 * described in the ANSI-C spec (see K&R[A7.7]). Pointers and
3374 3384 * integers may be manipulated according to specific rules. In
3375 3385 * these cases D permits strings to be treated as pointers.
3376 3386 */
3377 3387 int lp_is_ptr, lp_is_int, rp_is_ptr, rp_is_int;
3378 3388
3379 3389 lp = dnp->dn_left = dt_node_cook(lp, DT_IDFLG_REF);
3380 3390 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3381 3391
3382 3392 lp_is_ptr = dt_node_is_string(lp) ||
3383 3393 (dt_node_is_pointer(lp) && !dt_node_is_vfptr(lp));
3384 3394 lp_is_int = dt_node_is_integer(lp);
3385 3395
3386 3396 rp_is_ptr = dt_node_is_string(rp) ||
3387 3397 (dt_node_is_pointer(rp) && !dt_node_is_vfptr(rp));
3388 3398 rp_is_int = dt_node_is_integer(rp);
3389 3399
3390 3400 if (lp_is_int && rp_is_int) {
3391 3401 dt_type_promote(lp, rp, &ctfp, &type);
3392 3402 uref = 0;
3393 3403 } else if (lp_is_ptr && rp_is_int) {
3394 3404 ctfp = lp->dn_ctfp;
3395 3405 type = lp->dn_type;
3396 3406 uref = lp->dn_flags & DT_NF_USERLAND;
3397 3407 } else if (lp_is_int && rp_is_ptr && op == DT_TOK_ADD) {
3398 3408 ctfp = rp->dn_ctfp;
3399 3409 type = rp->dn_type;
3400 3410 uref = rp->dn_flags & DT_NF_USERLAND;
3401 3411 } else if (lp_is_ptr && rp_is_ptr && op == DT_TOK_SUB &&
3402 3412 dt_node_is_ptrcompat(lp, rp, NULL, NULL)) {
3403 3413 ctfp = dtp->dt_ddefs->dm_ctfp;
3404 3414 type = ctf_lookup_by_name(ctfp, "ptrdiff_t");
3405 3415 uref = 0;
3406 3416 } else {
3407 3417 xyerror(D_OP_INCOMPAT, "operands have incompatible "
3408 3418 "types: \"%s\" %s \"%s\"\n",
3409 3419 dt_node_type_name(lp, n1, sizeof (n1)), opstr(op),
3410 3420 dt_node_type_name(rp, n2, sizeof (n2)));
3411 3421 }
3412 3422
3413 3423 dt_node_type_assign(dnp, ctfp, type, B_FALSE);
3414 3424 dt_node_attr_assign(dnp, dt_attr_min(lp->dn_attr, rp->dn_attr));
3415 3425
3416 3426 if (uref)
3417 3427 dnp->dn_flags |= DT_NF_USERLAND;
3418 3428 break;
3419 3429 }
3420 3430
3421 3431 case DT_TOK_OR_EQ:
3422 3432 case DT_TOK_XOR_EQ:
3423 3433 case DT_TOK_AND_EQ:
3424 3434 case DT_TOK_LSH_EQ:
3425 3435 case DT_TOK_RSH_EQ:
3426 3436 case DT_TOK_MOD_EQ:
3427 3437 if (lp->dn_kind == DT_NODE_IDENT) {
3428 3438 dt_xcook_ident(lp, dtp->dt_globals,
3429 3439 DT_IDENT_SCALAR, B_TRUE);
3430 3440 }
3431 3441
3432 3442 lp = dnp->dn_left =
3433 3443 dt_node_cook(lp, DT_IDFLG_REF | DT_IDFLG_MOD);
3434 3444
3435 3445 rp = dnp->dn_right =
3436 3446 dt_node_cook(rp, DT_IDFLG_REF | DT_IDFLG_MOD);
3437 3447
3438 3448 if (!dt_node_is_integer(lp) || !dt_node_is_integer(rp)) {
3439 3449 xyerror(D_OP_INT, "operator %s requires operands of "
3440 3450 "integral type\n", opstr(op));
3441 3451 }
3442 3452 goto asgn_common;
3443 3453
3444 3454 case DT_TOK_MUL_EQ:
3445 3455 case DT_TOK_DIV_EQ:
3446 3456 if (lp->dn_kind == DT_NODE_IDENT) {
3447 3457 dt_xcook_ident(lp, dtp->dt_globals,
3448 3458 DT_IDENT_SCALAR, B_TRUE);
3449 3459 }
3450 3460
3451 3461 lp = dnp->dn_left =
3452 3462 dt_node_cook(lp, DT_IDFLG_REF | DT_IDFLG_MOD);
3453 3463
3454 3464 rp = dnp->dn_right =
3455 3465 dt_node_cook(rp, DT_IDFLG_REF | DT_IDFLG_MOD);
3456 3466
3457 3467 if (!dt_node_is_arith(lp) || !dt_node_is_arith(rp)) {
3458 3468 xyerror(D_OP_ARITH, "operator %s requires operands of "
3459 3469 "arithmetic type\n", opstr(op));
3460 3470 }
3461 3471 goto asgn_common;
3462 3472
3463 3473 case DT_TOK_ASGN:
3464 3474 /*
3465 3475 * If the left-hand side is an identifier, attempt to resolve
3466 3476 * it as either an aggregation or scalar variable. We pass
3467 3477 * B_TRUE to dt_xcook_ident to indicate that a new variable can
3468 3478 * be created if no matching variable exists in the namespace.
3469 3479 */
3470 3480 if (lp->dn_kind == DT_NODE_IDENT) {
3471 3481 if (lp->dn_op == DT_TOK_AGG) {
3472 3482 dt_xcook_ident(lp, dtp->dt_aggs,
3473 3483 DT_IDENT_AGG, B_TRUE);
3474 3484 } else {
3475 3485 dt_xcook_ident(lp, dtp->dt_globals,
3476 3486 DT_IDENT_SCALAR, B_TRUE);
3477 3487 }
3478 3488 }
3479 3489
3480 3490 lp = dnp->dn_left = dt_node_cook(lp, 0); /* don't set mod yet */
3481 3491 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3482 3492
3483 3493 /*
3484 3494 * If the left-hand side is an aggregation, verify that we are
3485 3495 * assigning it the result of an aggregating function. Once
3486 3496 * we've done so, hide the func node in the aggregation and
3487 3497 * return the aggregation itself up to the parse tree parent.
3488 3498 * This transformation is legal since the assigned function
3489 3499 * cannot change identity across disjoint cooking passes and
3490 3500 * the argument list subtree is retained for later cooking.
3491 3501 */
3492 3502 if (lp->dn_kind == DT_NODE_AGG) {
3493 3503 const char *aname = lp->dn_ident->di_name;
3494 3504 dt_ident_t *oid = lp->dn_ident->di_iarg;
3495 3505
3496 3506 if (rp->dn_kind != DT_NODE_FUNC ||
3497 3507 rp->dn_ident->di_kind != DT_IDENT_AGGFUNC) {
3498 3508 xyerror(D_AGG_FUNC,
3499 3509 "@%s must be assigned the result of "
3500 3510 "an aggregating function\n", aname);
3501 3511 }
3502 3512
3503 3513 if (oid != NULL && oid != rp->dn_ident) {
3504 3514 xyerror(D_AGG_REDEF,
3505 3515 "aggregation redefined: @%s\n\t "
3506 3516 "current: @%s = %s( )\n\tprevious: @%s = "
3507 3517 "%s( ) : line %d\n", aname, aname,
3508 3518 rp->dn_ident->di_name, aname, oid->di_name,
3509 3519 lp->dn_ident->di_lineno);
3510 3520 } else if (oid == NULL)
3511 3521 lp->dn_ident->di_iarg = rp->dn_ident;
3512 3522
3513 3523 /*
3514 3524 * Do not allow multiple aggregation assignments in a
3515 3525 * single statement, e.g. (@a = count()) = count();
3516 3526 * We produce a message as if the result of aggregating
3517 3527 * function does not propagate DT_NF_LVALUE.
3518 3528 */
3519 3529 if (lp->dn_aggfun != NULL) {
3520 3530 xyerror(D_OP_LVAL, "operator = requires "
3521 3531 "modifiable lvalue as an operand\n");
3522 3532 }
3523 3533
3524 3534 lp->dn_aggfun = rp;
3525 3535 lp = dt_node_cook(lp, DT_IDFLG_MOD);
3526 3536
3527 3537 dnp->dn_left = dnp->dn_right = NULL;
3528 3538 dt_node_free(dnp);
3529 3539
3530 3540 return (lp);
3531 3541 }
3532 3542
3533 3543 /*
3534 3544 * If the right-hand side is a dynamic variable that is the
3535 3545 * output of a translator, our result is the translated type.
3536 3546 */
3537 3547 if ((idp = dt_node_resolve(rp, DT_IDENT_XLSOU)) != NULL) {
3538 3548 ctfp = idp->di_ctfp;
3539 3549 type = idp->di_type;
3540 3550 uref = idp->di_flags & DT_IDFLG_USER;
3541 3551 } else {
3542 3552 ctfp = rp->dn_ctfp;
3543 3553 type = rp->dn_type;
3544 3554 uref = rp->dn_flags & DT_NF_USERLAND;
3545 3555 }
3546 3556
3547 3557 /*
3548 3558 * If the left-hand side of an assignment statement is a virgin
3549 3559 * variable created by this compilation pass, reset the type of
3550 3560 * this variable to the type of the right-hand side.
3551 3561 */
3552 3562 if (lp->dn_kind == DT_NODE_VAR &&
3553 3563 dt_ident_unref(lp->dn_ident)) {
3554 3564 dt_node_type_assign(lp, ctfp, type, B_FALSE);
3555 3565 dt_ident_type_assign(lp->dn_ident, ctfp, type);
3556 3566
3557 3567 if (uref) {
3558 3568 lp->dn_flags |= DT_NF_USERLAND;
3559 3569 lp->dn_ident->di_flags |= DT_IDFLG_USER;
3560 3570 }
3561 3571 }
3562 3572
3563 3573 if (lp->dn_kind == DT_NODE_VAR)
3564 3574 lp->dn_ident->di_flags |= DT_IDFLG_MOD;
3565 3575
3566 3576 /*
3567 3577 * The rules for type checking for the assignment operators are
3568 3578 * described in the ANSI-C spec (see K&R[A7.17]). We share
3569 3579 * most of this code with the argument list checking code.
3570 3580 */
3571 3581 if (!dt_node_is_string(lp)) {
3572 3582 kind = ctf_type_kind(lp->dn_ctfp,
3573 3583 ctf_type_resolve(lp->dn_ctfp, lp->dn_type));
3574 3584
3575 3585 if (kind == CTF_K_ARRAY || kind == CTF_K_FUNCTION) {
3576 3586 xyerror(D_OP_ARRFUN, "operator %s may not be "
3577 3587 "applied to operand of type \"%s\"\n",
3578 3588 opstr(op),
3579 3589 dt_node_type_name(lp, n1, sizeof (n1)));
3580 3590 }
3581 3591 }
3582 3592
3583 3593 if (idp != NULL && idp->di_kind == DT_IDENT_XLSOU &&
3584 3594 ctf_type_compat(lp->dn_ctfp, lp->dn_type, ctfp, type))
3585 3595 goto asgn_common;
3586 3596
3587 3597 if (dt_node_is_argcompat(lp, rp))
3588 3598 goto asgn_common;
3589 3599
3590 3600 xyerror(D_OP_INCOMPAT,
3591 3601 "operands have incompatible types: \"%s\" %s \"%s\"\n",
3592 3602 dt_node_type_name(lp, n1, sizeof (n1)), opstr(op),
3593 3603 dt_node_type_name(rp, n2, sizeof (n2)));
3594 3604 /*NOTREACHED*/
3595 3605
3596 3606 case DT_TOK_ADD_EQ:
3597 3607 case DT_TOK_SUB_EQ:
3598 3608 if (lp->dn_kind == DT_NODE_IDENT) {
3599 3609 dt_xcook_ident(lp, dtp->dt_globals,
3600 3610 DT_IDENT_SCALAR, B_TRUE);
3601 3611 }
3602 3612
3603 3613 lp = dnp->dn_left =
3604 3614 dt_node_cook(lp, DT_IDFLG_REF | DT_IDFLG_MOD);
3605 3615
3606 3616 rp = dnp->dn_right =
3607 3617 dt_node_cook(rp, DT_IDFLG_REF | DT_IDFLG_MOD);
3608 3618
3609 3619 if (dt_node_is_string(lp) || dt_node_is_string(rp)) {
3610 3620 xyerror(D_OP_INCOMPAT, "operands have "
3611 3621 "incompatible types: \"%s\" %s \"%s\"\n",
3612 3622 dt_node_type_name(lp, n1, sizeof (n1)), opstr(op),
3613 3623 dt_node_type_name(rp, n2, sizeof (n2)));
3614 3624 }
3615 3625
3616 3626 /*
3617 3627 * The rules for type checking for the assignment operators are
3618 3628 * described in the ANSI-C spec (see K&R[A7.17]). To these
3619 3629 * rules we add that only writable D nodes can be modified.
3620 3630 */
3621 3631 if (dt_node_is_integer(lp) == 0 ||
3622 3632 dt_node_is_integer(rp) == 0) {
3623 3633 if (!dt_node_is_pointer(lp) || dt_node_is_vfptr(lp)) {
3624 3634 xyerror(D_OP_VFPTR,
3625 3635 "operator %s requires left-hand scalar "
3626 3636 "operand of known size\n", opstr(op));
3627 3637 } else if (dt_node_is_integer(rp) == 0 &&
3628 3638 dt_node_is_ptrcompat(lp, rp, NULL, NULL) == 0) {
3629 3639 xyerror(D_OP_INCOMPAT, "operands have "
3630 3640 "incompatible types: \"%s\" %s \"%s\"\n",
3631 3641 dt_node_type_name(lp, n1, sizeof (n1)),
3632 3642 opstr(op),
3633 3643 dt_node_type_name(rp, n2, sizeof (n2)));
3634 3644 }
3635 3645 }
3636 3646 asgn_common:
3637 3647 dt_assign_common(dnp);
3638 3648 break;
3639 3649
3640 3650 case DT_TOK_PTR:
3641 3651 /*
3642 3652 * If the left-hand side of operator -> is the name "self",
3643 3653 * then we permit a TLS variable to be created or referenced.
3644 3654 */
3645 3655 if (lp->dn_kind == DT_NODE_IDENT &&
3646 3656 strcmp(lp->dn_string, "self") == 0) {
3647 3657 if (rp->dn_kind != DT_NODE_VAR) {
3648 3658 dt_xcook_ident(rp, dtp->dt_tls,
3649 3659 DT_IDENT_SCALAR, B_TRUE);
3650 3660 }
3651 3661
3652 3662 if (idflags != 0)
3653 3663 rp = dt_node_cook(rp, idflags);
3654 3664
3655 3665 dnp->dn_right = dnp->dn_left; /* avoid freeing rp */
3656 3666 dt_node_free(dnp);
3657 3667 return (rp);
3658 3668 }
3659 3669
3660 3670 /*
3661 3671 * If the left-hand side of operator -> is the name "this",
3662 3672 * then we permit a local variable to be created or referenced.
3663 3673 */
3664 3674 if (lp->dn_kind == DT_NODE_IDENT &&
3665 3675 strcmp(lp->dn_string, "this") == 0) {
3666 3676 if (rp->dn_kind != DT_NODE_VAR) {
3667 3677 dt_xcook_ident(rp, yypcb->pcb_locals,
3668 3678 DT_IDENT_SCALAR, B_TRUE);
3669 3679 }
3670 3680
3671 3681 if (idflags != 0)
3672 3682 rp = dt_node_cook(rp, idflags);
3673 3683
3674 3684 dnp->dn_right = dnp->dn_left; /* avoid freeing rp */
3675 3685 dt_node_free(dnp);
3676 3686 return (rp);
3677 3687 }
3678 3688
3679 3689 /*FALLTHRU*/
3680 3690
3681 3691 case DT_TOK_DOT:
3682 3692 lp = dnp->dn_left = dt_node_cook(lp, DT_IDFLG_REF);
3683 3693
3684 3694 if (rp->dn_kind != DT_NODE_IDENT) {
3685 3695 xyerror(D_OP_IDENT, "operator %s must be followed by "
3686 3696 "an identifier\n", opstr(op));
3687 3697 }
3688 3698
3689 3699 if ((idp = dt_node_resolve(lp, DT_IDENT_XLSOU)) != NULL ||
3690 3700 (idp = dt_node_resolve(lp, DT_IDENT_XLPTR)) != NULL) {
3691 3701 /*
3692 3702 * If the left-hand side is a translated struct or ptr,
3693 3703 * the type of the left is the translation output type.
3694 3704 */
3695 3705 dt_xlator_t *dxp = idp->di_data;
3696 3706
3697 3707 if (dt_xlator_member(dxp, rp->dn_string) == NULL) {
3698 3708 xyerror(D_XLATE_NOCONV,
3699 3709 "translator does not define conversion "
3700 3710 "for member: %s\n", rp->dn_string);
3701 3711 }
3702 3712
3703 3713 ctfp = idp->di_ctfp;
3704 3714 type = ctf_type_resolve(ctfp, idp->di_type);
3705 3715 uref = idp->di_flags & DT_IDFLG_USER;
3706 3716 } else {
3707 3717 ctfp = lp->dn_ctfp;
3708 3718 type = ctf_type_resolve(ctfp, lp->dn_type);
3709 3719 uref = lp->dn_flags & DT_NF_USERLAND;
3710 3720 }
3711 3721
3712 3722 kind = ctf_type_kind(ctfp, type);
3713 3723
3714 3724 if (op == DT_TOK_PTR) {
3715 3725 if (kind != CTF_K_POINTER) {
3716 3726 xyerror(D_OP_PTR, "operator %s must be "
3717 3727 "applied to a pointer\n", opstr(op));
|
↓ open down ↓ |
772 lines elided |
↑ open up ↑ |
3718 3728 }
3719 3729 type = ctf_type_reference(ctfp, type);
3720 3730 type = ctf_type_resolve(ctfp, type);
3721 3731 kind = ctf_type_kind(ctfp, type);
3722 3732 }
3723 3733
3724 3734 /*
3725 3735 * If we follow a reference to a forward declaration tag,
3726 3736 * search the entire type space for the actual definition.
3727 3737 */
3728 - while (kind == CTF_K_FORWARD) {
3729 - char *tag = ctf_type_name(ctfp, type, n1, sizeof (n1));
3730 - dtrace_typeinfo_t dtt;
3731 -
3732 - if (tag != NULL && dt_type_lookup(tag, &dtt) == 0 &&
3733 - (dtt.dtt_ctfp != ctfp || dtt.dtt_type != type)) {
3734 - ctfp = dtt.dtt_ctfp;
3735 - type = ctf_type_resolve(ctfp, dtt.dtt_type);
3736 - kind = ctf_type_kind(ctfp, type);
3737 - } else {
3738 - xyerror(D_OP_INCOMPLETE,
3739 - "operator %s cannot be applied to a "
3740 - "forward declaration: no %s definition "
3741 - "is available\n", opstr(op), tag);
3742 - }
3743 - }
3738 + dt_resolve_forward_decl(&ctfp, &type);
3739 + kind = ctf_type_kind(ctfp, type);
3744 3740
3745 - if (kind != CTF_K_STRUCT && kind != CTF_K_UNION) {
3741 + if (kind == CTF_K_FORWARD) {
3742 + xyerror(D_OP_INCOMPLETE,
3743 + "operator %s cannot be applied to a "
3744 + "forward declaration: no %s definition "
3745 + "is available\n", opstr(op),
3746 + ctf_type_name(ctfp, type, n1, sizeof (n1)));
3747 + } else if (kind != CTF_K_STRUCT && kind != CTF_K_UNION) {
3746 3748 if (op == DT_TOK_PTR) {
3747 3749 xyerror(D_OP_SOU, "operator -> cannot be "
3748 3750 "applied to pointer to type \"%s\"; must "
3749 3751 "be applied to a struct or union pointer\n",
3750 3752 ctf_type_name(ctfp, type, n1, sizeof (n1)));
3751 3753 } else {
3752 3754 xyerror(D_OP_SOU, "operator %s cannot be "
3753 3755 "applied to type \"%s\"; must be applied "
3754 3756 "to a struct or union\n", opstr(op),
3755 3757 ctf_type_name(ctfp, type, n1, sizeof (n1)));
3756 3758 }
3757 3759 }
3758 3760
3759 3761 if (ctf_member_info(ctfp, type, rp->dn_string, &m) == CTF_ERR) {
3760 3762 xyerror(D_TYPE_MEMBER,
3761 3763 "%s is not a member of %s\n", rp->dn_string,
3762 3764 ctf_type_name(ctfp, type, n1, sizeof (n1)));
3763 3765 }
3764 3766
3765 - type = ctf_type_resolve(ctfp, m.ctm_type);
3766 - kind = ctf_type_kind(ctfp, type);
3767 + type = m.ctm_type;
3767 3768
3768 - dt_node_type_assign(dnp, ctfp, m.ctm_type, B_FALSE);
3769 + dt_resolve_forward_decl(&ctfp, &type);
3770 + dt_node_type_assign(dnp, ctfp, type, B_FALSE);
3769 3771 dt_node_attr_assign(dnp, lp->dn_attr);
3770 3772
3773 + type = ctf_type_resolve(ctfp, type);
3774 + kind = ctf_type_kind(ctfp, type);
3775 +
3771 3776 if (op == DT_TOK_PTR && (kind != CTF_K_ARRAY ||
3772 3777 dt_node_is_string(dnp)))
3773 3778 dnp->dn_flags |= DT_NF_LVALUE; /* see K&R[A7.3.3] */
3774 3779
3775 3780 if (op == DT_TOK_DOT && (lp->dn_flags & DT_NF_LVALUE) &&
3776 3781 (kind != CTF_K_ARRAY || dt_node_is_string(dnp)))
3777 3782 dnp->dn_flags |= DT_NF_LVALUE; /* see K&R[A7.3.3] */
3778 3783
3779 3784 if (lp->dn_flags & DT_NF_WRITABLE)
3780 3785 dnp->dn_flags |= DT_NF_WRITABLE;
3781 3786
3782 3787 if (uref && (kind == CTF_K_POINTER ||
3783 3788 (dnp->dn_flags & DT_NF_REF)))
3784 3789 dnp->dn_flags |= DT_NF_USERLAND;
3785 3790 break;
3786 3791
3787 3792 case DT_TOK_LBRAC: {
3788 3793 /*
3789 3794 * If op is DT_TOK_LBRAC, we know from the special-case code at
3790 3795 * the top that lp is either a D variable or an aggregation.
3791 3796 */
3792 3797 dt_node_t *lnp;
3793 3798
3794 3799 /*
3795 3800 * If the left-hand side is an aggregation, just set dn_aggtup
3796 3801 * to the right-hand side and return the cooked aggregation.
3797 3802 * This transformation is legal since we are just collapsing
3798 3803 * nodes to simplify later processing, and the entire aggtup
3799 3804 * parse subtree is retained for subsequent cooking passes.
3800 3805 */
3801 3806 if (lp->dn_kind == DT_NODE_AGG) {
3802 3807 if (lp->dn_aggtup != NULL) {
3803 3808 xyerror(D_AGG_MDIM, "improper attempt to "
3804 3809 "reference @%s as a multi-dimensional "
3805 3810 "array\n", lp->dn_ident->di_name);
3806 3811 }
3807 3812
3808 3813 lp->dn_aggtup = rp;
3809 3814 lp = dt_node_cook(lp, 0);
3810 3815
3811 3816 dnp->dn_left = dnp->dn_right = NULL;
3812 3817 dt_node_free(dnp);
3813 3818
3814 3819 return (lp);
3815 3820 }
3816 3821
3817 3822 assert(lp->dn_kind == DT_NODE_VAR);
3818 3823 idp = lp->dn_ident;
3819 3824
3820 3825 /*
3821 3826 * If the left-hand side is a non-global scalar that hasn't yet
3822 3827 * been referenced or modified, it was just created by self->
3823 3828 * or this-> and we can convert it from scalar to assoc array.
3824 3829 */
3825 3830 if (idp->di_kind == DT_IDENT_SCALAR && dt_ident_unref(idp) &&
3826 3831 (idp->di_flags & (DT_IDFLG_LOCAL | DT_IDFLG_TLS)) != 0) {
3827 3832
3828 3833 if (idp->di_flags & DT_IDFLG_LOCAL) {
3829 3834 xyerror(D_ARR_LOCAL,
3830 3835 "local variables may not be used as "
3831 3836 "associative arrays: %s\n", idp->di_name);
3832 3837 }
3833 3838
3834 3839 dt_dprintf("morph variable %s (id %u) from scalar to "
3835 3840 "array\n", idp->di_name, idp->di_id);
3836 3841
3837 3842 dt_ident_morph(idp, DT_IDENT_ARRAY,
3838 3843 &dt_idops_assc, NULL);
3839 3844 }
3840 3845
3841 3846 if (idp->di_kind != DT_IDENT_ARRAY) {
3842 3847 xyerror(D_IDENT_BADREF, "%s '%s' may not be referenced "
3843 3848 "as %s\n", dt_idkind_name(idp->di_kind),
3844 3849 idp->di_name, dt_idkind_name(DT_IDENT_ARRAY));
3845 3850 }
3846 3851
3847 3852 /*
3848 3853 * Now that we've confirmed our left-hand side is a DT_NODE_VAR
3849 3854 * of idkind DT_IDENT_ARRAY, we need to splice the [ node from
3850 3855 * the parse tree and leave a cooked DT_NODE_VAR in its place
3851 3856 * where dn_args for the VAR node is the right-hand 'rp' tree,
3852 3857 * as shown in the parse tree diagram below:
3853 3858 *
3854 3859 * / /
3855 3860 * [ OP2 "[" ]=dnp [ VAR ]=dnp
3856 3861 * / \ => |
3857 3862 * / \ +- dn_args -> [ ??? ]=rp
3858 3863 * [ VAR ]=lp [ ??? ]=rp
3859 3864 *
3860 3865 * Since the final dt_node_cook(dnp) can fail using longjmp we
3861 3866 * must perform the transformations as a group first by over-
3862 3867 * writing 'dnp' to become the VAR node, so that the parse tree
3863 3868 * is guaranteed to be in a consistent state if the cook fails.
3864 3869 */
3865 3870 assert(lp->dn_kind == DT_NODE_VAR);
3866 3871 assert(lp->dn_args == NULL);
3867 3872
3868 3873 lnp = dnp->dn_link;
3869 3874 bcopy(lp, dnp, sizeof (dt_node_t));
3870 3875 dnp->dn_link = lnp;
3871 3876
3872 3877 dnp->dn_args = rp;
3873 3878 dnp->dn_list = NULL;
3874 3879
3875 3880 dt_node_free(lp);
3876 3881 return (dt_node_cook(dnp, idflags));
3877 3882 }
3878 3883
3879 3884 case DT_TOK_XLATE: {
3880 3885 dt_xlator_t *dxp;
3881 3886
3882 3887 assert(lp->dn_kind == DT_NODE_TYPE);
3883 3888 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3884 3889 dxp = dt_xlator_lookup(dtp, rp, lp, DT_XLATE_FUZZY);
3885 3890
3886 3891 if (dxp == NULL) {
3887 3892 xyerror(D_XLATE_NONE,
3888 3893 "cannot translate from \"%s\" to \"%s\"\n",
3889 3894 dt_node_type_name(rp, n1, sizeof (n1)),
3890 3895 dt_node_type_name(lp, n2, sizeof (n2)));
3891 3896 }
3892 3897
3893 3898 dnp->dn_ident = dt_xlator_ident(dxp, lp->dn_ctfp, lp->dn_type);
3894 3899 dt_node_type_assign(dnp, DT_DYN_CTFP(dtp), DT_DYN_TYPE(dtp),
3895 3900 B_FALSE);
3896 3901 dt_node_attr_assign(dnp,
3897 3902 dt_attr_min(rp->dn_attr, dnp->dn_ident->di_attr));
3898 3903 break;
3899 3904 }
3900 3905
3901 3906 case DT_TOK_LPAR: {
3902 3907 ctf_id_t ltype, rtype;
3903 3908 uint_t lkind, rkind;
3904 3909
3905 3910 assert(lp->dn_kind == DT_NODE_TYPE);
3906 3911 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3907 3912
3908 3913 ltype = ctf_type_resolve(lp->dn_ctfp, lp->dn_type);
3909 3914 lkind = ctf_type_kind(lp->dn_ctfp, ltype);
3910 3915
3911 3916 rtype = ctf_type_resolve(rp->dn_ctfp, rp->dn_type);
3912 3917 rkind = ctf_type_kind(rp->dn_ctfp, rtype);
3913 3918
3914 3919 /*
3915 3920 * The rules for casting are loosely explained in K&R[A7.5]
3916 3921 * and K&R[A6]. Basically, we can cast to the same type or
3917 3922 * same base type, between any kind of scalar values, from
3918 3923 * arrays to pointers, and we can cast anything to void.
3919 3924 * To these rules D adds casts from scalars to strings.
3920 3925 */
3921 3926 if (ctf_type_compat(lp->dn_ctfp, lp->dn_type,
3922 3927 rp->dn_ctfp, rp->dn_type))
3923 3928 /*EMPTY*/;
3924 3929 else if (dt_node_is_scalar(lp) &&
3925 3930 (dt_node_is_scalar(rp) || rkind == CTF_K_FUNCTION))
3926 3931 /*EMPTY*/;
3927 3932 else if (dt_node_is_void(lp))
3928 3933 /*EMPTY*/;
3929 3934 else if (lkind == CTF_K_POINTER && dt_node_is_pointer(rp))
3930 3935 /*EMPTY*/;
3931 3936 else if (dt_node_is_string(lp) && (dt_node_is_scalar(rp) ||
3932 3937 dt_node_is_pointer(rp) || dt_node_is_strcompat(rp)))
3933 3938 /*EMPTY*/;
3934 3939 else {
3935 3940 xyerror(D_CAST_INVAL,
3936 3941 "invalid cast expression: \"%s\" to \"%s\"\n",
3937 3942 dt_node_type_name(rp, n1, sizeof (n1)),
3938 3943 dt_node_type_name(lp, n2, sizeof (n2)));
3939 3944 }
3940 3945
3941 3946 dt_node_type_propagate(lp, dnp); /* see K&R[A7.5] */
3942 3947 dt_node_attr_assign(dnp, dt_attr_min(lp->dn_attr, rp->dn_attr));
3943 3948
3944 3949 /*
3945 3950 * If it's a pointer then should be able to (attempt to)
3946 3951 * assign to it.
3947 3952 */
3948 3953 if (lkind == CTF_K_POINTER)
3949 3954 dnp->dn_flags |= DT_NF_WRITABLE;
3950 3955
3951 3956 break;
3952 3957 }
3953 3958
3954 3959 case DT_TOK_COMMA:
3955 3960 lp = dnp->dn_left = dt_node_cook(lp, DT_IDFLG_REF);
3956 3961 rp = dnp->dn_right = dt_node_cook(rp, DT_IDFLG_REF);
3957 3962
3958 3963 if (dt_node_is_dynamic(lp) || dt_node_is_dynamic(rp)) {
3959 3964 xyerror(D_OP_DYN, "operator %s operands "
3960 3965 "cannot be of dynamic type\n", opstr(op));
3961 3966 }
3962 3967
3963 3968 if (dt_node_is_actfunc(lp) || dt_node_is_actfunc(rp)) {
3964 3969 xyerror(D_OP_ACT, "operator %s operands "
3965 3970 "cannot be actions\n", opstr(op));
3966 3971 }
3967 3972
3968 3973 dt_node_type_propagate(rp, dnp); /* see K&R[A7.18] */
3969 3974 dt_node_attr_assign(dnp, dt_attr_min(lp->dn_attr, rp->dn_attr));
3970 3975 break;
3971 3976
3972 3977 default:
3973 3978 xyerror(D_UNKNOWN, "invalid binary op %s\n", opstr(op));
3974 3979 }
3975 3980
3976 3981 /*
3977 3982 * Complete the conversion of E1[E2] to *((E1)+(E2)) that we started
3978 3983 * at the top of our switch() above (see K&R[A7.3.1]). Since E2 is
3979 3984 * parsed as an argument_expression_list by dt_grammar.y, we can
3980 3985 * end up with a comma-separated list inside of a non-associative
3981 3986 * array reference. We check for this and report an appropriate error.
3982 3987 */
3983 3988 if (dnp->dn_op == DT_TOK_LBRAC && op == DT_TOK_ADD) {
3984 3989 dt_node_t *pnp;
3985 3990
3986 3991 if (rp->dn_list != NULL) {
3987 3992 xyerror(D_ARR_BADREF,
3988 3993 "cannot access %s as an associative array\n",
3989 3994 dt_node_name(lp, n1, sizeof (n1)));
3990 3995 }
3991 3996
3992 3997 dnp->dn_op = DT_TOK_ADD;
3993 3998 pnp = dt_node_op1(DT_TOK_DEREF, dnp);
3994 3999
3995 4000 /*
3996 4001 * Cook callbacks are not typically permitted to allocate nodes.
3997 4002 * When we do, we must insert them in the middle of an existing
3998 4003 * allocation list rather than having them appended to the pcb
3999 4004 * list because the sub-expression may be part of a definition.
4000 4005 */
4001 4006 assert(yypcb->pcb_list == pnp);
4002 4007 yypcb->pcb_list = pnp->dn_link;
4003 4008
4004 4009 pnp->dn_link = dnp->dn_link;
4005 4010 dnp->dn_link = pnp;
4006 4011
4007 4012 return (dt_node_cook(pnp, DT_IDFLG_REF));
4008 4013 }
4009 4014
4010 4015 return (dnp);
4011 4016 }
4012 4017
4013 4018 /*ARGSUSED*/
4014 4019 static dt_node_t *
4015 4020 dt_cook_op3(dt_node_t *dnp, uint_t idflags)
4016 4021 {
4017 4022 dt_node_t *lp, *rp;
4018 4023 ctf_file_t *ctfp;
4019 4024 ctf_id_t type;
4020 4025
4021 4026 dnp->dn_expr = dt_node_cook(dnp->dn_expr, DT_IDFLG_REF);
4022 4027 lp = dnp->dn_left = dt_node_cook(dnp->dn_left, DT_IDFLG_REF);
4023 4028 rp = dnp->dn_right = dt_node_cook(dnp->dn_right, DT_IDFLG_REF);
4024 4029
4025 4030 if (!dt_node_is_scalar(dnp->dn_expr)) {
4026 4031 xyerror(D_OP_SCALAR,
4027 4032 "operator ?: expression must be of scalar type\n");
4028 4033 }
4029 4034
4030 4035 if (dt_node_is_dynamic(lp) || dt_node_is_dynamic(rp)) {
4031 4036 xyerror(D_OP_DYN,
4032 4037 "operator ?: operands cannot be of dynamic type\n");
4033 4038 }
4034 4039
4035 4040 /*
4036 4041 * The rules for type checking for the ternary operator are complex and
4037 4042 * are described in the ANSI-C spec (see K&R[A7.16]). We implement
4038 4043 * the various tests in order from least to most expensive.
4039 4044 */
4040 4045 if (ctf_type_compat(lp->dn_ctfp, lp->dn_type,
4041 4046 rp->dn_ctfp, rp->dn_type)) {
4042 4047 ctfp = lp->dn_ctfp;
4043 4048 type = lp->dn_type;
4044 4049 } else if (dt_node_is_integer(lp) && dt_node_is_integer(rp)) {
4045 4050 dt_type_promote(lp, rp, &ctfp, &type);
4046 4051 } else if (dt_node_is_strcompat(lp) && dt_node_is_strcompat(rp) &&
4047 4052 (dt_node_is_string(lp) || dt_node_is_string(rp))) {
4048 4053 ctfp = DT_STR_CTFP(yypcb->pcb_hdl);
4049 4054 type = DT_STR_TYPE(yypcb->pcb_hdl);
4050 4055 } else if (dt_node_is_ptrcompat(lp, rp, &ctfp, &type) == 0) {
4051 4056 xyerror(D_OP_INCOMPAT,
4052 4057 "operator ?: operands must have compatible types\n");
4053 4058 }
4054 4059
4055 4060 if (dt_node_is_actfunc(lp) || dt_node_is_actfunc(rp)) {
4056 4061 xyerror(D_OP_ACT, "action cannot be "
4057 4062 "used in a conditional context\n");
4058 4063 }
4059 4064
4060 4065 dt_node_type_assign(dnp, ctfp, type, B_FALSE);
4061 4066 dt_node_attr_assign(dnp, dt_attr_min(dnp->dn_expr->dn_attr,
4062 4067 dt_attr_min(lp->dn_attr, rp->dn_attr)));
4063 4068
4064 4069 return (dnp);
4065 4070 }
4066 4071
4067 4072 static dt_node_t *
4068 4073 dt_cook_statement(dt_node_t *dnp, uint_t idflags)
4069 4074 {
4070 4075 dnp->dn_expr = dt_node_cook(dnp->dn_expr, idflags);
4071 4076 dt_node_attr_assign(dnp, dnp->dn_expr->dn_attr);
4072 4077
4073 4078 return (dnp);
4074 4079 }
4075 4080
4076 4081 /*
4077 4082 * If dn_aggfun is set, this node is a collapsed aggregation assignment (see
4078 4083 * the special case code for DT_TOK_ASGN in dt_cook_op2() above), in which
4079 4084 * case we cook both the tuple and the function call. If dn_aggfun is NULL,
4080 4085 * this node is just a reference to the aggregation's type and attributes.
4081 4086 */
4082 4087 /*ARGSUSED*/
4083 4088 static dt_node_t *
4084 4089 dt_cook_aggregation(dt_node_t *dnp, uint_t idflags)
4085 4090 {
4086 4091 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
4087 4092
4088 4093 if (dnp->dn_aggfun != NULL) {
4089 4094 dnp->dn_aggfun = dt_node_cook(dnp->dn_aggfun, DT_IDFLG_REF);
4090 4095 dt_node_attr_assign(dnp, dt_ident_cook(dnp,
4091 4096 dnp->dn_ident, &dnp->dn_aggtup));
4092 4097 } else {
4093 4098 dt_node_type_assign(dnp, DT_DYN_CTFP(dtp), DT_DYN_TYPE(dtp),
4094 4099 B_FALSE);
4095 4100 dt_node_attr_assign(dnp, dnp->dn_ident->di_attr);
4096 4101 }
4097 4102
4098 4103 return (dnp);
4099 4104 }
4100 4105
4101 4106 /*
4102 4107 * Since D permits new variable identifiers to be instantiated in any program
4103 4108 * expression, we may need to cook a clause's predicate either before or after
4104 4109 * the action list depending on the program code in question. Consider:
4105 4110 *
4106 4111 * probe-description-list probe-description-list
4107 4112 * /x++/ /x == 0/
4108 4113 * { {
4109 4114 * trace(x); trace(x++);
4110 4115 * } }
4111 4116 *
4112 4117 * In the left-hand example, the predicate uses operator ++ to instantiate 'x'
4113 4118 * as a variable of type int64_t. The predicate must be cooked first because
4114 4119 * otherwise the statement trace(x) refers to an unknown identifier. In the
4115 4120 * right-hand example, the action list uses ++ to instantiate 'x'; the action
4116 4121 * list must be cooked first because otherwise the predicate x == 0 refers to
4117 4122 * an unknown identifier. In order to simplify programming, we support both.
4118 4123 *
4119 4124 * When cooking a clause, we cook the action statements before the predicate by
4120 4125 * default, since it seems more common to create or modify identifiers in the
4121 4126 * action list. If cooking fails due to an unknown identifier, we attempt to
4122 4127 * cook the predicate (i.e. do it first) and then go back and cook the actions.
4123 4128 * If this, too, fails (or if we get an error other than D_IDENT_UNDEF) we give
4124 4129 * up and report failure back to the user. There are five possible paths:
4125 4130 *
4126 4131 * cook actions = OK, cook predicate = OK -> OK
4127 4132 * cook actions = OK, cook predicate = ERR -> ERR
4128 4133 * cook actions = ERR, cook predicate = ERR -> ERR
4129 4134 * cook actions = ERR, cook predicate = OK, cook actions = OK -> OK
4130 4135 * cook actions = ERR, cook predicate = OK, cook actions = ERR -> ERR
4131 4136 *
4132 4137 * The programmer can still defeat our scheme by creating circular definition
4133 4138 * dependencies between predicates and actions, as in this example clause:
4134 4139 *
4135 4140 * probe-description-list
4136 4141 * /x++ && y == 0/
4137 4142 * {
4138 4143 * trace(x + y++);
4139 4144 * }
4140 4145 *
4141 4146 * but it doesn't seem worth the complexity to handle such rare cases. The
4142 4147 * user can simply use the D variable declaration syntax to work around them.
4143 4148 */
4144 4149 static dt_node_t *
4145 4150 dt_cook_clause(dt_node_t *dnp, uint_t idflags)
4146 4151 {
4147 4152 volatile int err, tries;
4148 4153 jmp_buf ojb;
4149 4154
4150 4155 /*
4151 4156 * Before assigning dn_ctxattr, temporarily assign the probe attribute
4152 4157 * to 'dnp' itself to force an attribute check and minimum violation.
4153 4158 */
4154 4159 dt_node_attr_assign(dnp, yypcb->pcb_pinfo.dtp_attr);
4155 4160 dnp->dn_ctxattr = yypcb->pcb_pinfo.dtp_attr;
4156 4161
4157 4162 bcopy(yypcb->pcb_jmpbuf, ojb, sizeof (jmp_buf));
4158 4163 tries = 0;
4159 4164
4160 4165 if (dnp->dn_pred != NULL && (err = setjmp(yypcb->pcb_jmpbuf)) != 0) {
4161 4166 bcopy(ojb, yypcb->pcb_jmpbuf, sizeof (jmp_buf));
4162 4167 if (tries++ != 0 || err != EDT_COMPILER || (
4163 4168 yypcb->pcb_hdl->dt_errtag != dt_errtag(D_IDENT_UNDEF) &&
4164 4169 yypcb->pcb_hdl->dt_errtag != dt_errtag(D_VAR_UNDEF)))
4165 4170 longjmp(yypcb->pcb_jmpbuf, err);
4166 4171 }
4167 4172
4168 4173 if (tries == 0) {
4169 4174 yylabel("action list");
4170 4175
4171 4176 dt_node_attr_assign(dnp,
4172 4177 dt_node_list_cook(&dnp->dn_acts, idflags));
4173 4178
4174 4179 bcopy(ojb, yypcb->pcb_jmpbuf, sizeof (jmp_buf));
4175 4180 yylabel(NULL);
4176 4181 }
4177 4182
4178 4183 if (dnp->dn_pred != NULL) {
4179 4184 yylabel("predicate");
4180 4185
4181 4186 dnp->dn_pred = dt_node_cook(dnp->dn_pred, idflags);
4182 4187 dt_node_attr_assign(dnp,
4183 4188 dt_attr_min(dnp->dn_attr, dnp->dn_pred->dn_attr));
4184 4189
4185 4190 if (!dt_node_is_scalar(dnp->dn_pred)) {
4186 4191 xyerror(D_PRED_SCALAR,
4187 4192 "predicate result must be of scalar type\n");
4188 4193 }
4189 4194
4190 4195 yylabel(NULL);
4191 4196 }
4192 4197
4193 4198 if (tries != 0) {
4194 4199 yylabel("action list");
4195 4200
4196 4201 dt_node_attr_assign(dnp,
4197 4202 dt_node_list_cook(&dnp->dn_acts, idflags));
4198 4203
4199 4204 yylabel(NULL);
4200 4205 }
4201 4206
4202 4207 return (dnp);
4203 4208 }
4204 4209
4205 4210 /*ARGSUSED*/
4206 4211 static dt_node_t *
4207 4212 dt_cook_inline(dt_node_t *dnp, uint_t idflags)
4208 4213 {
4209 4214 dt_idnode_t *inp = dnp->dn_ident->di_iarg;
4210 4215 dt_ident_t *rdp;
4211 4216
4212 4217 char n1[DT_TYPE_NAMELEN];
4213 4218 char n2[DT_TYPE_NAMELEN];
4214 4219
4215 4220 assert(dnp->dn_ident->di_flags & DT_IDFLG_INLINE);
4216 4221 assert(inp->din_root->dn_flags & DT_NF_COOKED);
4217 4222
4218 4223 /*
4219 4224 * If we are inlining a translation, verify that the inline declaration
4220 4225 * type exactly matches the type that is returned by the translation.
4221 4226 * Otherwise just use dt_node_is_argcompat() to check the types.
4222 4227 */
4223 4228 if ((rdp = dt_node_resolve(inp->din_root, DT_IDENT_XLSOU)) != NULL ||
4224 4229 (rdp = dt_node_resolve(inp->din_root, DT_IDENT_XLPTR)) != NULL) {
4225 4230
4226 4231 ctf_file_t *lctfp = dnp->dn_ctfp;
4227 4232 ctf_id_t ltype = ctf_type_resolve(lctfp, dnp->dn_type);
4228 4233
4229 4234 dt_xlator_t *dxp = rdp->di_data;
4230 4235 ctf_file_t *rctfp = dxp->dx_dst_ctfp;
4231 4236 ctf_id_t rtype = dxp->dx_dst_base;
4232 4237
4233 4238 if (ctf_type_kind(lctfp, ltype) == CTF_K_POINTER) {
4234 4239 ltype = ctf_type_reference(lctfp, ltype);
4235 4240 ltype = ctf_type_resolve(lctfp, ltype);
4236 4241 }
4237 4242
4238 4243 if (ctf_type_compat(lctfp, ltype, rctfp, rtype) == 0) {
4239 4244 dnerror(dnp, D_OP_INCOMPAT,
4240 4245 "inline %s definition uses incompatible types: "
4241 4246 "\"%s\" = \"%s\"\n", dnp->dn_ident->di_name,
4242 4247 dt_type_name(lctfp, ltype, n1, sizeof (n1)),
4243 4248 dt_type_name(rctfp, rtype, n2, sizeof (n2)));
4244 4249 }
4245 4250
4246 4251 } else if (dt_node_is_argcompat(dnp, inp->din_root) == 0) {
4247 4252 dnerror(dnp, D_OP_INCOMPAT,
4248 4253 "inline %s definition uses incompatible types: "
4249 4254 "\"%s\" = \"%s\"\n", dnp->dn_ident->di_name,
4250 4255 dt_node_type_name(dnp, n1, sizeof (n1)),
4251 4256 dt_node_type_name(inp->din_root, n2, sizeof (n2)));
4252 4257 }
4253 4258
4254 4259 return (dnp);
4255 4260 }
4256 4261
4257 4262 static dt_node_t *
4258 4263 dt_cook_member(dt_node_t *dnp, uint_t idflags)
4259 4264 {
4260 4265 dnp->dn_membexpr = dt_node_cook(dnp->dn_membexpr, idflags);
4261 4266 dt_node_attr_assign(dnp, dnp->dn_membexpr->dn_attr);
4262 4267 return (dnp);
4263 4268 }
4264 4269
4265 4270 /*ARGSUSED*/
4266 4271 static dt_node_t *
4267 4272 dt_cook_xlator(dt_node_t *dnp, uint_t idflags)
|
↓ open down ↓ |
487 lines elided |
↑ open up ↑ |
4268 4273 {
4269 4274 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
4270 4275 dt_xlator_t *dxp = dnp->dn_xlator;
4271 4276 dt_node_t *mnp;
4272 4277
4273 4278 char n1[DT_TYPE_NAMELEN];
4274 4279 char n2[DT_TYPE_NAMELEN];
4275 4280
4276 4281 dtrace_attribute_t attr = _dtrace_maxattr;
4277 4282 ctf_membinfo_t ctm;
4283 + ctf_id_t type;
4284 + ctf_file_t *ctfp;
4278 4285
4279 4286 /*
4280 4287 * Before cooking each translator member, we push a reference to the
4281 4288 * hash containing translator-local identifiers on to pcb_globals to
4282 4289 * temporarily interpose these identifiers in front of other globals.
4283 4290 */
4284 4291 dt_idstack_push(&yypcb->pcb_globals, dxp->dx_locals);
4285 4292
4286 4293 for (mnp = dnp->dn_members; mnp != NULL; mnp = mnp->dn_list) {
4287 4294 if (ctf_member_info(dxp->dx_dst_ctfp, dxp->dx_dst_type,
4288 4295 mnp->dn_membname, &ctm) == CTF_ERR) {
4289 4296 xyerror(D_XLATE_MEMB,
4290 4297 "translator member %s is not a member of %s\n",
4291 4298 mnp->dn_membname, ctf_type_name(dxp->dx_dst_ctfp,
4292 4299 dxp->dx_dst_type, n1, sizeof (n1)));
4293 4300 }
4294 4301
4295 4302 (void) dt_node_cook(mnp, DT_IDFLG_REF);
4296 - dt_node_type_assign(mnp, dxp->dx_dst_ctfp, ctm.ctm_type,
4303 + ctfp = dxp->dx_dst_ctfp;
4304 + type = ctm.ctm_type;
4305 +
4306 + /*
4307 + *
4308 + * This probably doesn't need to be resolved, because it's of
4309 + * the translator, but is done for completeness right now.
4310 + */
4311 + dt_resolve_forward_decl(&ctfp, &type);
4312 + dt_node_type_assign(mnp, ctfp, type,
4297 4313 B_FALSE);
4298 4314 attr = dt_attr_min(attr, mnp->dn_attr);
4299 4315
4300 4316 if (dt_node_is_argcompat(mnp, mnp->dn_membexpr) == 0) {
4301 4317 xyerror(D_XLATE_INCOMPAT,
4302 4318 "translator member %s definition uses "
4303 4319 "incompatible types: \"%s\" = \"%s\"\n",
4304 4320 mnp->dn_membname,
4305 4321 dt_node_type_name(mnp, n1, sizeof (n1)),
4306 4322 dt_node_type_name(mnp->dn_membexpr,
4307 4323 n2, sizeof (n2)));
4308 4324 }
4309 4325 }
4310 4326
4311 4327 dt_idstack_pop(&yypcb->pcb_globals, dxp->dx_locals);
4312 4328
4313 4329 dxp->dx_souid.di_attr = attr;
4314 4330 dxp->dx_ptrid.di_attr = attr;
4315 4331
4316 4332 dt_node_type_assign(dnp, DT_DYN_CTFP(dtp), DT_DYN_TYPE(dtp), B_FALSE);
4317 4333 dt_node_attr_assign(dnp, _dtrace_defattr);
4318 4334
4319 4335 return (dnp);
4320 4336 }
4321 4337
4322 4338 static void
4323 4339 dt_node_provider_cmp_argv(dt_provider_t *pvp, dt_node_t *pnp, const char *kind,
4324 4340 uint_t old_argc, dt_node_t *old_argv, uint_t new_argc, dt_node_t *new_argv)
4325 4341 {
4326 4342 dt_probe_t *prp = pnp->dn_ident->di_data;
4327 4343 uint_t i;
4328 4344
4329 4345 char n1[DT_TYPE_NAMELEN];
4330 4346 char n2[DT_TYPE_NAMELEN];
4331 4347
4332 4348 if (old_argc != new_argc) {
4333 4349 dnerror(pnp, D_PROV_INCOMPAT,
4334 4350 "probe %s:%s %s prototype mismatch:\n"
4335 4351 "\t current: %u arg%s\n\tprevious: %u arg%s\n",
4336 4352 pvp->pv_desc.dtvd_name, prp->pr_ident->di_name, kind,
4337 4353 new_argc, new_argc != 1 ? "s" : "",
4338 4354 old_argc, old_argc != 1 ? "s" : "");
4339 4355 }
4340 4356
4341 4357 for (i = 0; i < old_argc; i++,
4342 4358 old_argv = old_argv->dn_list, new_argv = new_argv->dn_list) {
4343 4359 if (ctf_type_cmp(old_argv->dn_ctfp, old_argv->dn_type,
4344 4360 new_argv->dn_ctfp, new_argv->dn_type) == 0)
4345 4361 continue;
4346 4362
4347 4363 dnerror(pnp, D_PROV_INCOMPAT,
4348 4364 "probe %s:%s %s prototype argument #%u mismatch:\n"
4349 4365 "\t current: %s\n\tprevious: %s\n",
4350 4366 pvp->pv_desc.dtvd_name, prp->pr_ident->di_name, kind, i + 1,
4351 4367 dt_node_type_name(new_argv, n1, sizeof (n1)),
4352 4368 dt_node_type_name(old_argv, n2, sizeof (n2)));
4353 4369 }
4354 4370 }
4355 4371
4356 4372 /*
4357 4373 * Compare a new probe declaration with an existing probe definition (either
4358 4374 * from a previous declaration or cached from the kernel). If the existing
4359 4375 * definition and declaration both have an input and output parameter list,
4360 4376 * compare both lists. Otherwise compare only the output parameter lists.
4361 4377 */
4362 4378 static void
4363 4379 dt_node_provider_cmp(dt_provider_t *pvp, dt_node_t *pnp,
4364 4380 dt_probe_t *old, dt_probe_t *new)
4365 4381 {
4366 4382 dt_node_provider_cmp_argv(pvp, pnp, "output",
4367 4383 old->pr_xargc, old->pr_xargs, new->pr_xargc, new->pr_xargs);
4368 4384
4369 4385 if (old->pr_nargs != old->pr_xargs && new->pr_nargs != new->pr_xargs) {
4370 4386 dt_node_provider_cmp_argv(pvp, pnp, "input",
4371 4387 old->pr_nargc, old->pr_nargs, new->pr_nargc, new->pr_nargs);
4372 4388 }
4373 4389
4374 4390 if (old->pr_nargs == old->pr_xargs && new->pr_nargs != new->pr_xargs) {
4375 4391 if (pvp->pv_flags & DT_PROVIDER_IMPL) {
4376 4392 dnerror(pnp, D_PROV_INCOMPAT,
4377 4393 "provider interface mismatch: %s\n"
4378 4394 "\t current: probe %s:%s has an output prototype\n"
4379 4395 "\tprevious: probe %s:%s has no output prototype\n",
4380 4396 pvp->pv_desc.dtvd_name, pvp->pv_desc.dtvd_name,
4381 4397 new->pr_ident->di_name, pvp->pv_desc.dtvd_name,
4382 4398 old->pr_ident->di_name);
4383 4399 }
4384 4400
4385 4401 if (old->pr_ident->di_gen == yypcb->pcb_hdl->dt_gen)
4386 4402 old->pr_ident->di_flags |= DT_IDFLG_ORPHAN;
4387 4403
4388 4404 dt_idhash_delete(pvp->pv_probes, old->pr_ident);
4389 4405 dt_probe_declare(pvp, new);
4390 4406 }
4391 4407 }
4392 4408
4393 4409 static void
4394 4410 dt_cook_probe(dt_node_t *dnp, dt_provider_t *pvp)
4395 4411 {
4396 4412 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
4397 4413 dt_probe_t *prp = dnp->dn_ident->di_data;
4398 4414
4399 4415 dt_xlator_t *dxp;
4400 4416 uint_t i;
4401 4417
4402 4418 char n1[DT_TYPE_NAMELEN];
4403 4419 char n2[DT_TYPE_NAMELEN];
4404 4420
4405 4421 if (prp->pr_nargs == prp->pr_xargs)
4406 4422 return;
4407 4423
4408 4424 for (i = 0; i < prp->pr_xargc; i++) {
4409 4425 dt_node_t *xnp = prp->pr_xargv[i];
4410 4426 dt_node_t *nnp = prp->pr_nargv[prp->pr_mapping[i]];
4411 4427
4412 4428 if ((dxp = dt_xlator_lookup(dtp,
4413 4429 nnp, xnp, DT_XLATE_FUZZY)) != NULL) {
4414 4430 if (dt_provider_xref(dtp, pvp, dxp->dx_id) != 0)
4415 4431 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
4416 4432 continue;
4417 4433 }
4418 4434
4419 4435 if (dt_node_is_argcompat(nnp, xnp))
4420 4436 continue; /* no translator defined and none required */
4421 4437
4422 4438 dnerror(dnp, D_PROV_PRXLATOR, "translator for %s:%s output "
4423 4439 "argument #%u from %s to %s is not defined\n",
4424 4440 pvp->pv_desc.dtvd_name, dnp->dn_ident->di_name, i + 1,
4425 4441 dt_node_type_name(nnp, n1, sizeof (n1)),
4426 4442 dt_node_type_name(xnp, n2, sizeof (n2)));
4427 4443 }
4428 4444 }
4429 4445
4430 4446 /*ARGSUSED*/
4431 4447 static dt_node_t *
4432 4448 dt_cook_provider(dt_node_t *dnp, uint_t idflags)
4433 4449 {
4434 4450 dt_provider_t *pvp = dnp->dn_provider;
4435 4451 dt_node_t *pnp;
4436 4452
4437 4453 /*
4438 4454 * If we're declaring a provider for the first time and it is unknown
4439 4455 * to dtrace(7D), insert the probe definitions into the provider's hash.
4440 4456 * If we're redeclaring a known provider, verify the interface matches.
4441 4457 */
4442 4458 for (pnp = dnp->dn_probes; pnp != NULL; pnp = pnp->dn_list) {
4443 4459 const char *probename = pnp->dn_ident->di_name;
4444 4460 dt_probe_t *prp = dt_probe_lookup(pvp, probename);
4445 4461
4446 4462 assert(pnp->dn_kind == DT_NODE_PROBE);
4447 4463
4448 4464 if (prp != NULL && dnp->dn_provred) {
4449 4465 dt_node_provider_cmp(pvp, pnp,
4450 4466 prp, pnp->dn_ident->di_data);
4451 4467 } else if (prp == NULL && dnp->dn_provred) {
4452 4468 dnerror(pnp, D_PROV_INCOMPAT,
4453 4469 "provider interface mismatch: %s\n"
4454 4470 "\t current: probe %s:%s defined\n"
4455 4471 "\tprevious: probe %s:%s not defined\n",
4456 4472 dnp->dn_provname, dnp->dn_provname,
4457 4473 probename, dnp->dn_provname, probename);
4458 4474 } else if (prp != NULL) {
4459 4475 dnerror(pnp, D_PROV_PRDUP, "probe redeclared: %s:%s\n",
4460 4476 dnp->dn_provname, probename);
4461 4477 } else
4462 4478 dt_probe_declare(pvp, pnp->dn_ident->di_data);
4463 4479
4464 4480 dt_cook_probe(pnp, pvp);
4465 4481 }
4466 4482
4467 4483 return (dnp);
4468 4484 }
4469 4485
4470 4486 /*ARGSUSED*/
4471 4487 static dt_node_t *
4472 4488 dt_cook_none(dt_node_t *dnp, uint_t idflags)
4473 4489 {
4474 4490 return (dnp);
4475 4491 }
4476 4492
4477 4493 static dt_node_t *(*dt_cook_funcs[])(dt_node_t *, uint_t) = {
4478 4494 dt_cook_none, /* DT_NODE_FREE */
4479 4495 dt_cook_none, /* DT_NODE_INT */
4480 4496 dt_cook_none, /* DT_NODE_STRING */
4481 4497 dt_cook_ident, /* DT_NODE_IDENT */
4482 4498 dt_cook_var, /* DT_NODE_VAR */
4483 4499 dt_cook_none, /* DT_NODE_SYM */
4484 4500 dt_cook_none, /* DT_NODE_TYPE */
4485 4501 dt_cook_func, /* DT_NODE_FUNC */
4486 4502 dt_cook_op1, /* DT_NODE_OP1 */
4487 4503 dt_cook_op2, /* DT_NODE_OP2 */
4488 4504 dt_cook_op3, /* DT_NODE_OP3 */
4489 4505 dt_cook_statement, /* DT_NODE_DEXPR */
4490 4506 dt_cook_statement, /* DT_NODE_DFUNC */
4491 4507 dt_cook_aggregation, /* DT_NODE_AGG */
4492 4508 dt_cook_none, /* DT_NODE_PDESC */
4493 4509 dt_cook_clause, /* DT_NODE_CLAUSE */
4494 4510 dt_cook_inline, /* DT_NODE_INLINE */
4495 4511 dt_cook_member, /* DT_NODE_MEMBER */
4496 4512 dt_cook_xlator, /* DT_NODE_XLATOR */
4497 4513 dt_cook_none, /* DT_NODE_PROBE */
4498 4514 dt_cook_provider, /* DT_NODE_PROVIDER */
4499 4515 dt_cook_none /* DT_NODE_PROG */
4500 4516 };
4501 4517
4502 4518 /*
4503 4519 * Recursively cook the parse tree starting at the specified node. The idflags
4504 4520 * parameter is used to indicate the type of reference (r/w) and is applied to
4505 4521 * the resulting identifier if it is a D variable or D aggregation.
4506 4522 */
4507 4523 dt_node_t *
4508 4524 dt_node_cook(dt_node_t *dnp, uint_t idflags)
4509 4525 {
4510 4526 int oldlineno = yylineno;
4511 4527
4512 4528 yylineno = dnp->dn_line;
4513 4529
4514 4530 dnp = dt_cook_funcs[dnp->dn_kind](dnp, idflags);
4515 4531 dnp->dn_flags |= DT_NF_COOKED;
4516 4532
4517 4533 if (dnp->dn_kind == DT_NODE_VAR || dnp->dn_kind == DT_NODE_AGG)
4518 4534 dnp->dn_ident->di_flags |= idflags;
4519 4535
4520 4536 yylineno = oldlineno;
4521 4537 return (dnp);
4522 4538 }
4523 4539
4524 4540 dtrace_attribute_t
4525 4541 dt_node_list_cook(dt_node_t **pnp, uint_t idflags)
4526 4542 {
4527 4543 dtrace_attribute_t attr = _dtrace_defattr;
4528 4544 dt_node_t *dnp, *nnp;
4529 4545
4530 4546 for (dnp = (pnp != NULL ? *pnp : NULL); dnp != NULL; dnp = nnp) {
4531 4547 nnp = dnp->dn_list;
4532 4548 dnp = *pnp = dt_node_cook(dnp, idflags);
4533 4549 attr = dt_attr_min(attr, dnp->dn_attr);
4534 4550 dnp->dn_list = nnp;
4535 4551 pnp = &dnp->dn_list;
4536 4552 }
4537 4553
4538 4554 return (attr);
4539 4555 }
4540 4556
4541 4557 void
4542 4558 dt_node_list_free(dt_node_t **pnp)
4543 4559 {
4544 4560 dt_node_t *dnp, *nnp;
4545 4561
4546 4562 for (dnp = (pnp != NULL ? *pnp : NULL); dnp != NULL; dnp = nnp) {
4547 4563 nnp = dnp->dn_list;
4548 4564 dt_node_free(dnp);
4549 4565 }
4550 4566
4551 4567 if (pnp != NULL)
4552 4568 *pnp = NULL;
4553 4569 }
4554 4570
4555 4571 void
4556 4572 dt_node_link_free(dt_node_t **pnp)
4557 4573 {
4558 4574 dt_node_t *dnp, *nnp;
4559 4575
4560 4576 for (dnp = (pnp != NULL ? *pnp : NULL); dnp != NULL; dnp = nnp) {
4561 4577 nnp = dnp->dn_link;
4562 4578 dt_node_free(dnp);
4563 4579 }
4564 4580
4565 4581 for (dnp = (pnp != NULL ? *pnp : NULL); dnp != NULL; dnp = nnp) {
4566 4582 nnp = dnp->dn_link;
4567 4583 free(dnp);
4568 4584 }
4569 4585
4570 4586 if (pnp != NULL)
4571 4587 *pnp = NULL;
4572 4588 }
4573 4589
4574 4590 dt_node_t *
4575 4591 dt_node_link(dt_node_t *lp, dt_node_t *rp)
4576 4592 {
4577 4593 dt_node_t *dnp;
4578 4594
4579 4595 if (lp == NULL)
4580 4596 return (rp);
4581 4597 else if (rp == NULL)
4582 4598 return (lp);
4583 4599
4584 4600 for (dnp = lp; dnp->dn_list != NULL; dnp = dnp->dn_list)
4585 4601 continue;
4586 4602
4587 4603 dnp->dn_list = rp;
4588 4604 return (lp);
4589 4605 }
4590 4606
4591 4607 /*
4592 4608 * Compute the DOF dtrace_diftype_t representation of a node's type. This is
4593 4609 * called from a variety of places in the library so it cannot assume yypcb
4594 4610 * is valid: any references to handle-specific data must be made through 'dtp'.
4595 4611 */
4596 4612 void
4597 4613 dt_node_diftype(dtrace_hdl_t *dtp, const dt_node_t *dnp, dtrace_diftype_t *tp)
4598 4614 {
4599 4615 if (dnp->dn_ctfp == DT_STR_CTFP(dtp) &&
4600 4616 dnp->dn_type == DT_STR_TYPE(dtp)) {
4601 4617 tp->dtdt_kind = DIF_TYPE_STRING;
4602 4618 tp->dtdt_ckind = CTF_K_UNKNOWN;
4603 4619 } else {
4604 4620 tp->dtdt_kind = DIF_TYPE_CTF;
4605 4621 tp->dtdt_ckind = ctf_type_kind(dnp->dn_ctfp,
4606 4622 ctf_type_resolve(dnp->dn_ctfp, dnp->dn_type));
4607 4623 }
4608 4624
4609 4625 tp->dtdt_flags = (dnp->dn_flags & DT_NF_REF) ?
4610 4626 (dnp->dn_flags & DT_NF_USERLAND) ? DIF_TF_BYUREF :
4611 4627 DIF_TF_BYREF : 0;
4612 4628 tp->dtdt_pad = 0;
4613 4629 tp->dtdt_size = ctf_type_size(dnp->dn_ctfp, dnp->dn_type);
4614 4630 }
4615 4631
4616 4632 void
4617 4633 dt_node_printr(dt_node_t *dnp, FILE *fp, int depth)
4618 4634 {
4619 4635 char n[DT_TYPE_NAMELEN], buf[BUFSIZ], a[8];
4620 4636 const dtrace_syminfo_t *dts;
4621 4637 const dt_idnode_t *inp;
4622 4638 dt_node_t *arg;
4623 4639
4624 4640 (void) fprintf(fp, "%*s", depth * 2, "");
4625 4641 (void) dt_attr_str(dnp->dn_attr, a, sizeof (a));
4626 4642
4627 4643 if (dnp->dn_ctfp != NULL && dnp->dn_type != CTF_ERR &&
4628 4644 ctf_type_name(dnp->dn_ctfp, dnp->dn_type, n, sizeof (n)) != NULL) {
4629 4645 (void) snprintf(buf, BUFSIZ, "type=<%s> attr=%s flags=", n, a);
4630 4646 } else {
4631 4647 (void) snprintf(buf, BUFSIZ, "type=<%ld> attr=%s flags=",
4632 4648 dnp->dn_type, a);
4633 4649 }
4634 4650
4635 4651 if (dnp->dn_flags != 0) {
4636 4652 n[0] = '\0';
4637 4653 if (dnp->dn_flags & DT_NF_SIGNED)
4638 4654 (void) strcat(n, ",SIGN");
4639 4655 if (dnp->dn_flags & DT_NF_COOKED)
4640 4656 (void) strcat(n, ",COOK");
4641 4657 if (dnp->dn_flags & DT_NF_REF)
4642 4658 (void) strcat(n, ",REF");
4643 4659 if (dnp->dn_flags & DT_NF_LVALUE)
4644 4660 (void) strcat(n, ",LVAL");
4645 4661 if (dnp->dn_flags & DT_NF_WRITABLE)
4646 4662 (void) strcat(n, ",WRITE");
4647 4663 if (dnp->dn_flags & DT_NF_BITFIELD)
4648 4664 (void) strcat(n, ",BITF");
4649 4665 if (dnp->dn_flags & DT_NF_USERLAND)
4650 4666 (void) strcat(n, ",USER");
4651 4667 (void) strcat(buf, n + 1);
4652 4668 } else
4653 4669 (void) strcat(buf, "0");
4654 4670
4655 4671 switch (dnp->dn_kind) {
4656 4672 case DT_NODE_FREE:
4657 4673 (void) fprintf(fp, "FREE <node %p>\n", (void *)dnp);
4658 4674 break;
4659 4675
4660 4676 case DT_NODE_INT:
4661 4677 (void) fprintf(fp, "INT 0x%llx (%s)\n",
4662 4678 (u_longlong_t)dnp->dn_value, buf);
4663 4679 break;
4664 4680
4665 4681 case DT_NODE_STRING:
4666 4682 (void) fprintf(fp, "STRING \"%s\" (%s)\n", dnp->dn_string, buf);
4667 4683 break;
4668 4684
4669 4685 case DT_NODE_IDENT:
4670 4686 (void) fprintf(fp, "IDENT %s (%s)\n", dnp->dn_string, buf);
4671 4687 break;
4672 4688
4673 4689 case DT_NODE_VAR:
4674 4690 (void) fprintf(fp, "VARIABLE %s%s (%s)\n",
4675 4691 (dnp->dn_ident->di_flags & DT_IDFLG_LOCAL) ? "this->" :
4676 4692 (dnp->dn_ident->di_flags & DT_IDFLG_TLS) ? "self->" : "",
4677 4693 dnp->dn_ident->di_name, buf);
4678 4694
4679 4695 if (dnp->dn_args != NULL)
4680 4696 (void) fprintf(fp, "%*s[\n", depth * 2, "");
4681 4697
4682 4698 for (arg = dnp->dn_args; arg != NULL; arg = arg->dn_list) {
4683 4699 dt_node_printr(arg, fp, depth + 1);
4684 4700 if (arg->dn_list != NULL)
4685 4701 (void) fprintf(fp, "%*s,\n", depth * 2, "");
4686 4702 }
4687 4703
4688 4704 if (dnp->dn_args != NULL)
4689 4705 (void) fprintf(fp, "%*s]\n", depth * 2, "");
4690 4706 break;
4691 4707
4692 4708 case DT_NODE_SYM:
4693 4709 dts = dnp->dn_ident->di_data;
4694 4710 (void) fprintf(fp, "SYMBOL %s`%s (%s)\n",
4695 4711 dts->dts_object, dts->dts_name, buf);
4696 4712 break;
4697 4713
4698 4714 case DT_NODE_TYPE:
4699 4715 if (dnp->dn_string != NULL) {
4700 4716 (void) fprintf(fp, "TYPE (%s) %s\n",
4701 4717 buf, dnp->dn_string);
4702 4718 } else
4703 4719 (void) fprintf(fp, "TYPE (%s)\n", buf);
4704 4720 break;
4705 4721
4706 4722 case DT_NODE_FUNC:
4707 4723 (void) fprintf(fp, "FUNC %s (%s)\n",
4708 4724 dnp->dn_ident->di_name, buf);
4709 4725
4710 4726 for (arg = dnp->dn_args; arg != NULL; arg = arg->dn_list) {
4711 4727 dt_node_printr(arg, fp, depth + 1);
4712 4728 if (arg->dn_list != NULL)
4713 4729 (void) fprintf(fp, "%*s,\n", depth * 2, "");
4714 4730 }
4715 4731 break;
4716 4732
4717 4733 case DT_NODE_OP1:
4718 4734 (void) fprintf(fp, "OP1 %s (%s)\n", opstr(dnp->dn_op), buf);
4719 4735 dt_node_printr(dnp->dn_child, fp, depth + 1);
4720 4736 break;
4721 4737
4722 4738 case DT_NODE_OP2:
4723 4739 (void) fprintf(fp, "OP2 %s (%s)\n", opstr(dnp->dn_op), buf);
4724 4740 dt_node_printr(dnp->dn_left, fp, depth + 1);
4725 4741 dt_node_printr(dnp->dn_right, fp, depth + 1);
4726 4742 break;
4727 4743
4728 4744 case DT_NODE_OP3:
4729 4745 (void) fprintf(fp, "OP3 (%s)\n", buf);
4730 4746 dt_node_printr(dnp->dn_expr, fp, depth + 1);
4731 4747 (void) fprintf(fp, "%*s?\n", depth * 2, "");
4732 4748 dt_node_printr(dnp->dn_left, fp, depth + 1);
4733 4749 (void) fprintf(fp, "%*s:\n", depth * 2, "");
4734 4750 dt_node_printr(dnp->dn_right, fp, depth + 1);
4735 4751 break;
4736 4752
4737 4753 case DT_NODE_DEXPR:
4738 4754 case DT_NODE_DFUNC:
4739 4755 (void) fprintf(fp, "D EXPRESSION attr=%s\n", a);
4740 4756 dt_node_printr(dnp->dn_expr, fp, depth + 1);
4741 4757 break;
4742 4758
4743 4759 case DT_NODE_AGG:
4744 4760 (void) fprintf(fp, "AGGREGATE @%s attr=%s [\n",
4745 4761 dnp->dn_ident->di_name, a);
4746 4762
4747 4763 for (arg = dnp->dn_aggtup; arg != NULL; arg = arg->dn_list) {
4748 4764 dt_node_printr(arg, fp, depth + 1);
4749 4765 if (arg->dn_list != NULL)
4750 4766 (void) fprintf(fp, "%*s,\n", depth * 2, "");
4751 4767 }
4752 4768
4753 4769 if (dnp->dn_aggfun) {
4754 4770 (void) fprintf(fp, "%*s] = ", depth * 2, "");
4755 4771 dt_node_printr(dnp->dn_aggfun, fp, depth + 1);
4756 4772 } else
4757 4773 (void) fprintf(fp, "%*s]\n", depth * 2, "");
4758 4774
4759 4775 if (dnp->dn_aggfun)
4760 4776 (void) fprintf(fp, "%*s)\n", depth * 2, "");
4761 4777 break;
4762 4778
4763 4779 case DT_NODE_PDESC:
4764 4780 (void) fprintf(fp, "PDESC %s:%s:%s:%s [%u]\n",
4765 4781 dnp->dn_desc->dtpd_provider, dnp->dn_desc->dtpd_mod,
4766 4782 dnp->dn_desc->dtpd_func, dnp->dn_desc->dtpd_name,
4767 4783 dnp->dn_desc->dtpd_id);
4768 4784 break;
4769 4785
4770 4786 case DT_NODE_CLAUSE:
4771 4787 (void) fprintf(fp, "CLAUSE attr=%s\n", a);
4772 4788
4773 4789 for (arg = dnp->dn_pdescs; arg != NULL; arg = arg->dn_list)
4774 4790 dt_node_printr(arg, fp, depth + 1);
4775 4791
4776 4792 (void) fprintf(fp, "%*sCTXATTR %s\n", depth * 2, "",
4777 4793 dt_attr_str(dnp->dn_ctxattr, a, sizeof (a)));
4778 4794
4779 4795 if (dnp->dn_pred != NULL) {
4780 4796 (void) fprintf(fp, "%*sPREDICATE /\n", depth * 2, "");
4781 4797 dt_node_printr(dnp->dn_pred, fp, depth + 1);
4782 4798 (void) fprintf(fp, "%*s/\n", depth * 2, "");
4783 4799 }
4784 4800
4785 4801 for (arg = dnp->dn_acts; arg != NULL; arg = arg->dn_list)
4786 4802 dt_node_printr(arg, fp, depth + 1);
4787 4803 break;
4788 4804
4789 4805 case DT_NODE_INLINE:
4790 4806 inp = dnp->dn_ident->di_iarg;
4791 4807
4792 4808 (void) fprintf(fp, "INLINE %s (%s)\n",
4793 4809 dnp->dn_ident->di_name, buf);
4794 4810 dt_node_printr(inp->din_root, fp, depth + 1);
4795 4811 break;
4796 4812
4797 4813 case DT_NODE_MEMBER:
4798 4814 (void) fprintf(fp, "MEMBER %s (%s)\n", dnp->dn_membname, buf);
4799 4815 if (dnp->dn_membexpr)
4800 4816 dt_node_printr(dnp->dn_membexpr, fp, depth + 1);
4801 4817 break;
4802 4818
4803 4819 case DT_NODE_XLATOR:
4804 4820 (void) fprintf(fp, "XLATOR (%s)", buf);
4805 4821
4806 4822 if (ctf_type_name(dnp->dn_xlator->dx_src_ctfp,
4807 4823 dnp->dn_xlator->dx_src_type, n, sizeof (n)) != NULL)
4808 4824 (void) fprintf(fp, " from <%s>", n);
4809 4825
4810 4826 if (ctf_type_name(dnp->dn_xlator->dx_dst_ctfp,
4811 4827 dnp->dn_xlator->dx_dst_type, n, sizeof (n)) != NULL)
4812 4828 (void) fprintf(fp, " to <%s>", n);
4813 4829
4814 4830 (void) fprintf(fp, "\n");
4815 4831
4816 4832 for (arg = dnp->dn_members; arg != NULL; arg = arg->dn_list)
4817 4833 dt_node_printr(arg, fp, depth + 1);
4818 4834 break;
4819 4835
4820 4836 case DT_NODE_PROBE:
4821 4837 (void) fprintf(fp, "PROBE %s\n", dnp->dn_ident->di_name);
4822 4838 break;
4823 4839
4824 4840 case DT_NODE_PROVIDER:
4825 4841 (void) fprintf(fp, "PROVIDER %s (%s)\n",
4826 4842 dnp->dn_provname, dnp->dn_provred ? "redecl" : "decl");
4827 4843 for (arg = dnp->dn_probes; arg != NULL; arg = arg->dn_list)
4828 4844 dt_node_printr(arg, fp, depth + 1);
4829 4845 break;
4830 4846
4831 4847 case DT_NODE_PROG:
4832 4848 (void) fprintf(fp, "PROGRAM attr=%s\n", a);
4833 4849 for (arg = dnp->dn_list; arg != NULL; arg = arg->dn_list)
4834 4850 dt_node_printr(arg, fp, depth + 1);
4835 4851 break;
4836 4852
4837 4853 default:
4838 4854 (void) fprintf(fp, "<bad node %p, kind %d>\n",
4839 4855 (void *)dnp, dnp->dn_kind);
4840 4856 }
4841 4857 }
4842 4858
4843 4859 int
4844 4860 dt_node_root(dt_node_t *dnp)
4845 4861 {
4846 4862 yypcb->pcb_root = dnp;
4847 4863 return (0);
4848 4864 }
4849 4865
4850 4866 /*PRINTFLIKE3*/
4851 4867 void
4852 4868 dnerror(const dt_node_t *dnp, dt_errtag_t tag, const char *format, ...)
4853 4869 {
4854 4870 int oldlineno = yylineno;
4855 4871 va_list ap;
4856 4872
4857 4873 yylineno = dnp->dn_line;
4858 4874
4859 4875 va_start(ap, format);
4860 4876 xyvwarn(tag, format, ap);
4861 4877 va_end(ap);
4862 4878
4863 4879 yylineno = oldlineno;
4864 4880 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
4865 4881 }
4866 4882
4867 4883 /*PRINTFLIKE3*/
4868 4884 void
4869 4885 dnwarn(const dt_node_t *dnp, dt_errtag_t tag, const char *format, ...)
4870 4886 {
4871 4887 int oldlineno = yylineno;
4872 4888 va_list ap;
4873 4889
4874 4890 yylineno = dnp->dn_line;
4875 4891
4876 4892 va_start(ap, format);
4877 4893 xyvwarn(tag, format, ap);
4878 4894 va_end(ap);
4879 4895
4880 4896 yylineno = oldlineno;
4881 4897 }
4882 4898
4883 4899 /*PRINTFLIKE2*/
4884 4900 void
4885 4901 xyerror(dt_errtag_t tag, const char *format, ...)
4886 4902 {
4887 4903 va_list ap;
4888 4904
4889 4905 va_start(ap, format);
4890 4906 xyvwarn(tag, format, ap);
4891 4907 va_end(ap);
4892 4908
4893 4909 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
4894 4910 }
4895 4911
4896 4912 /*PRINTFLIKE2*/
4897 4913 void
4898 4914 xywarn(dt_errtag_t tag, const char *format, ...)
4899 4915 {
4900 4916 va_list ap;
4901 4917
4902 4918 va_start(ap, format);
4903 4919 xyvwarn(tag, format, ap);
4904 4920 va_end(ap);
4905 4921 }
4906 4922
4907 4923 void
4908 4924 xyvwarn(dt_errtag_t tag, const char *format, va_list ap)
4909 4925 {
4910 4926 if (yypcb == NULL)
4911 4927 return; /* compiler is not currently active: act as a no-op */
4912 4928
4913 4929 dt_set_errmsg(yypcb->pcb_hdl, dt_errtag(tag), yypcb->pcb_region,
4914 4930 yypcb->pcb_filetag, yypcb->pcb_fileptr ? yylineno : 0, format, ap);
4915 4931 }
4916 4932
4917 4933 /*PRINTFLIKE1*/
4918 4934 void
4919 4935 yyerror(const char *format, ...)
4920 4936 {
4921 4937 va_list ap;
4922 4938
4923 4939 va_start(ap, format);
4924 4940 yyvwarn(format, ap);
4925 4941 va_end(ap);
4926 4942
4927 4943 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
4928 4944 }
4929 4945
4930 4946 /*PRINTFLIKE1*/
4931 4947 void
4932 4948 yywarn(const char *format, ...)
4933 4949 {
4934 4950 va_list ap;
4935 4951
4936 4952 va_start(ap, format);
4937 4953 yyvwarn(format, ap);
4938 4954 va_end(ap);
4939 4955 }
4940 4956
4941 4957 void
4942 4958 yyvwarn(const char *format, va_list ap)
4943 4959 {
4944 4960 if (yypcb == NULL)
4945 4961 return; /* compiler is not currently active: act as a no-op */
4946 4962
4947 4963 dt_set_errmsg(yypcb->pcb_hdl, dt_errtag(D_SYNTAX), yypcb->pcb_region,
4948 4964 yypcb->pcb_filetag, yypcb->pcb_fileptr ? yylineno : 0, format, ap);
4949 4965
4950 4966 if (strchr(format, '\n') == NULL) {
4951 4967 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
4952 4968 size_t len = strlen(dtp->dt_errmsg);
4953 4969 char *p, *s = dtp->dt_errmsg + len;
4954 4970 size_t n = sizeof (dtp->dt_errmsg) - len;
4955 4971
4956 4972 if (yytext[0] == '\0')
4957 4973 (void) snprintf(s, n, " near end of input");
4958 4974 else if (yytext[0] == '\n')
4959 4975 (void) snprintf(s, n, " near end of line");
4960 4976 else {
4961 4977 if ((p = strchr(yytext, '\n')) != NULL)
4962 4978 *p = '\0'; /* crop at newline */
4963 4979 (void) snprintf(s, n, " near \"%s\"", yytext);
4964 4980 }
4965 4981 }
4966 4982 }
4967 4983
4968 4984 void
4969 4985 yylabel(const char *label)
4970 4986 {
4971 4987 dt_dprintf("set label to <%s>\n", label ? label : "NULL");
4972 4988 yypcb->pcb_region = label;
4973 4989 }
4974 4990
4975 4991 int
4976 4992 yywrap(void)
4977 4993 {
4978 4994 return (1); /* indicate that lex should return a zero token for EOF */
4979 4995 }
|
↓ open down ↓ |
673 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX