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