4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
23 * Copyright 2007 Sun Microsystems, Inc. All rights reserved.
24 * Use is subject to license terms.
27 #pragma ident "%Z%%M% %I% %E% SMI"
30 * DTrace D Language Compiler
32 * The code in this source file implements the main engine for the D language
33 * compiler. The driver routine for the compiler is dt_compile(), below. The
34 * compiler operates on either stdio FILEs or in-memory strings as its input
35 * and can produce either dtrace_prog_t structures from a D program or a single
36 * dtrace_difo_t structure from a D expression. Multiple entry points are
37 * provided as wrappers around dt_compile() for the various input/output pairs.
38 * The compiler itself is implemented across the following source files:
40 * dt_lex.l - lex scanner
41 * dt_grammar.y - yacc grammar
42 * dt_parser.c - parse tree creation and semantic checking
43 * dt_decl.c - declaration stack processing
44 * dt_xlator.c - D translator lookup and creation
45 * dt_ident.c - identifier and symbol table routines
46 * dt_pragma.c - #pragma processing and D pragmas
47 * dt_printf.c - D printf() and printa() argument checking and processing
48 * dt_cc.c - compiler driver and dtrace_prog_t construction
49 * dt_cg.c - DIF code generator
50 * dt_as.c - DIF assembler
51 * dt_dof.c - dtrace_prog_t -> DOF conversion
53 * Several other source files provide collections of utility routines used by
54 * these major files. The compiler itself is implemented in multiple passes:
56 * (1) The input program is scanned and parsed by dt_lex.l and dt_grammar.y
57 * and parse tree nodes are constructed using the routines in dt_parser.c.
58 * This node construction pass is described further in dt_parser.c.
60 * (2) The parse tree is "cooked" by assigning each clause a context (see the
61 * routine dt_setcontext(), below) based on its probe description and then
62 * recursively descending the tree performing semantic checking. The cook
63 * routines are also implemented in dt_parser.c and described there.
65 * (3) For actions that are DIF expression statements, the DIF code generator
66 * and assembler are invoked to create a finished DIFO for the statement.
68 * (4) The dtrace_prog_t data structures for the program clauses and actions
69 * are built, containing pointers to any DIFOs created in step (3).
71 * (5) The caller invokes a routine in dt_dof.c to convert the finished program
72 * into DOF format for use in anonymous tracing or enabling in the kernel.
74 * In the implementation, steps 2-4 are intertwined in that they are performed
75 * in order for each clause as part of a loop that executes over the clauses.
77 * The D compiler currently implements nearly no optimization. The compiler
78 * implements integer constant folding as part of pass (1), and a set of very
79 * simple peephole optimizations as part of pass (3). As with any C compiler,
80 * a large number of optimizations are possible on both the intermediate data
81 * structures and the generated DIF code. These possibilities should be
82 * investigated in the context of whether they will have any substantive effect
83 * on the overall DTrace probe effect before they are undertaken.
86 #include <sys/types.h>
100 #include <dt_module.h>
101 #include <dt_program.h>
102 #include <dt_provider.h>
103 #include <dt_printf.h>
105 #include <dt_grammar.h>
106 #include <dt_ident.h>
107 #include <dt_string.h>
110 static const dtrace_diftype_t dt_void_rtype = {
111 DIF_TYPE_CTF, CTF_K_INTEGER, 0, 0, 0
114 static const dtrace_diftype_t dt_int_rtype = {
115 DIF_TYPE_CTF, CTF_K_INTEGER, 0, 0, sizeof (uint64_t)
118 static void *dt_compile(dtrace_hdl_t *, int, dtrace_probespec_t, void *,
119 uint_t, int, char *const[], FILE *, const char *);
124 dt_idreset(dt_idhash_t *dhp, dt_ident_t *idp, void *ignored)
126 idp->di_flags &= ~(DT_IDFLG_REF | DT_IDFLG_MOD |
127 DT_IDFLG_DIFR | DT_IDFLG_DIFW);
133 dt_idpragma(dt_idhash_t *dhp, dt_ident_t *idp, void *ignored)
135 yylineno = idp->di_lineno;
136 xyerror(D_PRAGMA_UNUSED, "unused #pragma %s\n", (char *)idp->di_iarg);
140 static dtrace_stmtdesc_t *
141 dt_stmt_create(dtrace_hdl_t *dtp, dtrace_ecbdesc_t *edp,
142 dtrace_attribute_t descattr, dtrace_attribute_t stmtattr)
144 dtrace_stmtdesc_t *sdp = dtrace_stmt_create(dtp, edp);
147 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
149 assert(yypcb->pcb_stmt == NULL);
150 yypcb->pcb_stmt = sdp;
152 sdp->dtsd_descattr = descattr;
153 sdp->dtsd_stmtattr = stmtattr;
158 static dtrace_actdesc_t *
159 dt_stmt_action(dtrace_hdl_t *dtp, dtrace_stmtdesc_t *sdp)
161 dtrace_actdesc_t *new;
163 if ((new = dtrace_stmt_action(dtp, sdp)) == NULL)
164 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
170 * Utility function to determine if a given action description is destructive.
171 * The dtdo_destructive bit is set for us by the DIF assembler (see dt_as.c).
174 dt_action_destructive(const dtrace_actdesc_t *ap)
176 return (DTRACEACT_ISDESTRUCTIVE(ap->dtad_kind) || (ap->dtad_kind ==
177 DTRACEACT_DIFEXPR && ap->dtad_difo->dtdo_destructive));
181 dt_stmt_append(dtrace_stmtdesc_t *sdp, const dt_node_t *dnp)
183 dtrace_ecbdesc_t *edp = sdp->dtsd_ecbdesc;
184 dtrace_actdesc_t *ap, *tap;
190 * Make sure that the new statement jibes with the rest of the ECB.
192 for (ap = edp->dted_action; ap != NULL; ap = ap->dtad_next) {
193 if (ap->dtad_kind == DTRACEACT_COMMIT) {
195 dnerror(dnp, D_COMM_COMM, "commit( ) may "
196 "not follow commit( )\n");
200 dnerror(dnp, D_COMM_DREC, "commit( ) may "
201 "not follow data-recording action(s)\n");
204 for (tap = ap; tap != NULL; tap = tap->dtad_next) {
205 if (!DTRACEACT_ISAGG(tap->dtad_kind))
208 dnerror(dnp, D_AGG_COMM, "aggregating actions "
209 "may not follow commit( )\n");
216 if (ap->dtad_kind == DTRACEACT_SPECULATE) {
218 dnerror(dnp, D_SPEC_SPEC, "speculate( ) may "
219 "not follow speculate( )\n");
223 dnerror(dnp, D_SPEC_COMM, "speculate( ) may "
224 "not follow commit( )\n");
228 dnerror(dnp, D_SPEC_DREC, "speculate( ) may "
229 "not follow data-recording action(s)\n");
236 if (DTRACEACT_ISAGG(ap->dtad_kind)) {
238 dnerror(dnp, D_AGG_SPEC, "aggregating actions "
239 "may not follow speculate( )\n");
247 if (dt_action_destructive(ap)) {
248 dnerror(dnp, D_ACT_SPEC, "destructive actions "
249 "may not follow speculate( )\n");
252 if (ap->dtad_kind == DTRACEACT_EXIT) {
253 dnerror(dnp, D_EXIT_SPEC, "exit( ) may not "
254 "follow speculate( )\n");
259 * Exclude all non data-recording actions.
261 if (dt_action_destructive(ap) ||
262 ap->dtad_kind == DTRACEACT_DISCARD)
265 if (ap->dtad_kind == DTRACEACT_DIFEXPR &&
266 ap->dtad_difo->dtdo_rtype.dtdt_kind == DIF_TYPE_CTF &&
267 ap->dtad_difo->dtdo_rtype.dtdt_size == 0)
271 dnerror(dnp, D_DREC_COMM, "data-recording actions "
272 "may not follow commit( )\n");
279 if (dtrace_stmt_add(yypcb->pcb_hdl, yypcb->pcb_prog, sdp) != 0)
280 longjmp(yypcb->pcb_jmpbuf, dtrace_errno(yypcb->pcb_hdl));
282 if (yypcb->pcb_stmt == sdp)
283 yypcb->pcb_stmt = NULL;
287 * For the first element of an aggregation tuple or for printa(), we create a
288 * simple DIF program that simply returns the immediate value that is the ID
289 * of the aggregation itself. This could be optimized in the future by
290 * creating a new in-kernel dtad_kind that just returns an integer.
293 dt_action_difconst(dtrace_actdesc_t *ap, uint_t id, dtrace_actkind_t kind)
295 dtrace_hdl_t *dtp = yypcb->pcb_hdl;
296 dtrace_difo_t *dp = dt_zalloc(dtp, sizeof (dtrace_difo_t));
299 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
301 dp->dtdo_buf = dt_alloc(dtp, sizeof (dif_instr_t) * 2);
302 dp->dtdo_inttab = dt_alloc(dtp, sizeof (uint64_t));
304 if (dp->dtdo_buf == NULL || dp->dtdo_inttab == NULL) {
305 dt_difo_free(dtp, dp);
306 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
309 dp->dtdo_buf[0] = DIF_INSTR_SETX(0, 1); /* setx DIF_INTEGER[0], %r1 */
310 dp->dtdo_buf[1] = DIF_INSTR_RET(1); /* ret %r1 */
312 dp->dtdo_inttab[0] = id;
314 dp->dtdo_rtype = dt_int_rtype;
317 ap->dtad_kind = kind;
321 dt_action_clear(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
324 dtrace_actdesc_t *ap;
327 char n[DT_TYPE_NAMELEN];
330 for (anp = dnp->dn_args; anp != NULL; anp = anp->dn_list)
331 argc++; /* count up arguments for error messages below */
334 dnerror(dnp, D_CLEAR_PROTO,
335 "%s( ) prototype mismatch: %d args passed, 1 expected\n",
336 dnp->dn_ident->di_name, argc);
342 if (anp->dn_kind != DT_NODE_AGG) {
343 dnerror(dnp, D_CLEAR_AGGARG,
344 "%s( ) argument #1 is incompatible with prototype:\n"
345 "\tprototype: aggregation\n\t argument: %s\n",
346 dnp->dn_ident->di_name,
347 dt_node_type_name(anp, n, sizeof (n)));
352 if (aid->di_gen == dtp->dt_gen && !(aid->di_flags & DT_IDFLG_MOD)) {
353 dnerror(dnp, D_CLEAR_AGGBAD,
354 "undefined aggregation: @%s\n", aid->di_name);
357 ap = dt_stmt_action(dtp, sdp);
358 dt_action_difconst(ap, anp->dn_ident->di_id, DTRACEACT_LIBACT);
359 ap->dtad_arg = DT_ACT_CLEAR;
363 dt_action_normalize(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
366 dtrace_actdesc_t *ap;
367 dt_node_t *anp, *normal;
368 int denormal = (strcmp(dnp->dn_ident->di_name, "denormalize") == 0);
370 char n[DT_TYPE_NAMELEN];
373 for (anp = dnp->dn_args; anp != NULL; anp = anp->dn_list)
374 argc++; /* count up arguments for error messages below */
376 if ((denormal && argc != 1) || (!denormal && argc != 2)) {
377 dnerror(dnp, D_NORMALIZE_PROTO,
378 "%s( ) prototype mismatch: %d args passed, %d expected\n",
379 dnp->dn_ident->di_name, argc, denormal ? 1 : 2);
385 if (anp->dn_kind != DT_NODE_AGG) {
386 dnerror(dnp, D_NORMALIZE_AGGARG,
387 "%s( ) argument #1 is incompatible with prototype:\n"
388 "\tprototype: aggregation\n\t argument: %s\n",
389 dnp->dn_ident->di_name,
390 dt_node_type_name(anp, n, sizeof (n)));
393 if ((normal = anp->dn_list) != NULL && !dt_node_is_scalar(normal)) {
394 dnerror(dnp, D_NORMALIZE_SCALAR,
395 "%s( ) argument #2 must be of scalar type\n",
396 dnp->dn_ident->di_name);
401 if (aid->di_gen == dtp->dt_gen && !(aid->di_flags & DT_IDFLG_MOD)) {
402 dnerror(dnp, D_NORMALIZE_AGGBAD,
403 "undefined aggregation: @%s\n", aid->di_name);
406 ap = dt_stmt_action(dtp, sdp);
407 dt_action_difconst(ap, anp->dn_ident->di_id, DTRACEACT_LIBACT);
410 ap->dtad_arg = DT_ACT_DENORMALIZE;
414 ap->dtad_arg = DT_ACT_NORMALIZE;
416 assert(normal != NULL);
417 ap = dt_stmt_action(dtp, sdp);
418 dt_cg(yypcb, normal);
420 ap->dtad_difo = dt_as(yypcb);
421 ap->dtad_kind = DTRACEACT_LIBACT;
422 ap->dtad_arg = DT_ACT_NORMALIZE;
426 dt_action_trunc(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
429 dtrace_actdesc_t *ap;
430 dt_node_t *anp, *trunc;
432 char n[DT_TYPE_NAMELEN];
435 for (anp = dnp->dn_args; anp != NULL; anp = anp->dn_list)
436 argc++; /* count up arguments for error messages below */
438 if (argc > 2 || argc < 1) {
439 dnerror(dnp, D_TRUNC_PROTO,
440 "%s( ) prototype mismatch: %d args passed, %s expected\n",
441 dnp->dn_ident->di_name, argc,
442 argc < 1 ? "at least 1" : "no more than 2");
447 trunc = anp->dn_list;
449 if (anp->dn_kind != DT_NODE_AGG) {
450 dnerror(dnp, D_TRUNC_AGGARG,
451 "%s( ) argument #1 is incompatible with prototype:\n"
452 "\tprototype: aggregation\n\t argument: %s\n",
453 dnp->dn_ident->di_name,
454 dt_node_type_name(anp, n, sizeof (n)));
458 assert(trunc != NULL);
459 if (!dt_node_is_scalar(trunc)) {
460 dnerror(dnp, D_TRUNC_SCALAR,
461 "%s( ) argument #2 must be of scalar type\n",
462 dnp->dn_ident->di_name);
468 if (aid->di_gen == dtp->dt_gen && !(aid->di_flags & DT_IDFLG_MOD)) {
469 dnerror(dnp, D_TRUNC_AGGBAD,
470 "undefined aggregation: @%s\n", aid->di_name);
473 ap = dt_stmt_action(dtp, sdp);
474 dt_action_difconst(ap, anp->dn_ident->di_id, DTRACEACT_LIBACT);
475 ap->dtad_arg = DT_ACT_TRUNC;
477 ap = dt_stmt_action(dtp, sdp);
480 dt_action_difconst(ap, 0, DTRACEACT_LIBACT);
482 assert(trunc != NULL);
484 ap->dtad_difo = dt_as(yypcb);
485 ap->dtad_kind = DTRACEACT_LIBACT;
488 ap->dtad_arg = DT_ACT_TRUNC;
492 dt_action_printa(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
494 dt_ident_t *aid, *fid;
495 dtrace_actdesc_t *ap;
497 dt_node_t *anp, *proto = NULL;
499 char n[DT_TYPE_NAMELEN];
500 int argc = 0, argr = 0;
502 for (anp = dnp->dn_args; anp != NULL; anp = anp->dn_list)
503 argc++; /* count up arguments for error messages below */
505 switch (dnp->dn_args->dn_kind) {
507 format = dnp->dn_args->dn_string;
508 anp = dnp->dn_args->dn_list;
523 dnerror(dnp, D_PRINTA_PROTO,
524 "%s( ) prototype mismatch: %d args passed, %d expected\n",
525 dnp->dn_ident->di_name, argc, argr);
530 while (anp != NULL) {
531 if (anp->dn_kind != DT_NODE_AGG) {
532 dnerror(dnp, D_PRINTA_AGGARG,
533 "%s( ) argument #%d is incompatible with "
534 "prototype:\n\tprototype: aggregation\n"
535 "\t argument: %s\n", dnp->dn_ident->di_name, argr,
536 dt_node_type_name(anp, n, sizeof (n)));
542 if (aid->di_gen == dtp->dt_gen &&
543 !(aid->di_flags & DT_IDFLG_MOD)) {
544 dnerror(dnp, D_PRINTA_AGGBAD,
545 "undefined aggregation: @%s\n", aid->di_name);
549 * If we have multiple aggregations, we must be sure that
550 * their key signatures match.
553 dt_printa_validate(proto, anp);
558 if (format != NULL) {
559 yylineno = dnp->dn_line;
562 dt_printf_create(yypcb->pcb_hdl, format);
563 dt_printf_validate(sdp->dtsd_fmtdata,
564 DT_PRINTF_AGGREGATION, dnp->dn_ident, 1,
565 fid->di_id, ((dt_idsig_t *)aid->di_data)->dis_args);
569 ap = dt_stmt_action(dtp, sdp);
570 dt_action_difconst(ap, anp->dn_ident->di_id, DTRACEACT_PRINTA);
578 dt_action_printflike(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp,
579 dtrace_actkind_t kind)
581 dt_node_t *anp, *arg1;
582 dtrace_actdesc_t *ap = NULL;
583 char n[DT_TYPE_NAMELEN], *str;
585 assert(DTRACEACT_ISPRINTFLIKE(kind));
587 if (dnp->dn_args->dn_kind != DT_NODE_STRING) {
588 dnerror(dnp, D_PRINTF_ARG_FMT,
589 "%s( ) argument #1 is incompatible with prototype:\n"
590 "\tprototype: string constant\n\t argument: %s\n",
591 dnp->dn_ident->di_name,
592 dt_node_type_name(dnp->dn_args, n, sizeof (n)));
595 arg1 = dnp->dn_args->dn_list;
596 yylineno = dnp->dn_line;
597 str = dnp->dn_args->dn_string;
601 * If this is an freopen(), we use an empty string to denote that
602 * stdout should be restored. For other printf()-like actions, an
603 * empty format string is illegal: an empty format string would
604 * result in malformed DOF, and the compiler thus flags an empty
605 * format string as a compile-time error. To avoid propagating the
606 * freopen() special case throughout the system, we simply transpose
607 * an empty string into a sentinel string (DT_FREOPEN_RESTORE) that
608 * denotes that stdout should be restored.
610 if (kind == DTRACEACT_FREOPEN) {
611 if (strcmp(str, DT_FREOPEN_RESTORE) == 0) {
613 * Our sentinel is always an invalid argument to
614 * freopen(), but if it's been manually specified, we
615 * must fail now instead of when the freopen() is
616 * actually evaluated.
618 dnerror(dnp, D_FREOPEN_INVALID,
619 "%s( ) argument #1 cannot be \"%s\"\n",
620 dnp->dn_ident->di_name, DT_FREOPEN_RESTORE);
624 str = DT_FREOPEN_RESTORE;
627 sdp->dtsd_fmtdata = dt_printf_create(dtp, str);
629 dt_printf_validate(sdp->dtsd_fmtdata, DT_PRINTF_EXACTLEN,
630 dnp->dn_ident, 1, DTRACEACT_AGGREGATION, arg1);
636 if ((dbuf = dt_alloc(dtp, sizeof (dif_instr_t))) == NULL ||
637 (dp = dt_zalloc(dtp, sizeof (dtrace_difo_t))) == NULL) {
639 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
642 dbuf[0] = DIF_INSTR_RET(DIF_REG_R0); /* ret %r0 */
646 dp->dtdo_rtype = dt_int_rtype;
648 ap = dt_stmt_action(dtp, sdp);
650 ap->dtad_kind = kind;
654 for (anp = arg1; anp != NULL; anp = anp->dn_list) {
655 ap = dt_stmt_action(dtp, sdp);
657 ap->dtad_difo = dt_as(yypcb);
658 ap->dtad_kind = kind;
663 dt_action_trace(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
665 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
667 if (dt_node_is_void(dnp->dn_args)) {
668 dnerror(dnp->dn_args, D_TRACE_VOID,
669 "trace( ) may not be applied to a void expression\n");
672 if (dt_node_is_dynamic(dnp->dn_args)) {
673 dnerror(dnp->dn_args, D_TRACE_DYN,
674 "trace( ) may not be applied to a dynamic expression\n");
677 dt_cg(yypcb, dnp->dn_args);
678 ap->dtad_difo = dt_as(yypcb);
679 ap->dtad_kind = DTRACEACT_DIFEXPR;
683 dt_action_tracemem(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
685 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
687 dt_node_t *addr = dnp->dn_args;
688 dt_node_t *size = dnp->dn_args->dn_list;
690 char n[DT_TYPE_NAMELEN];
692 if (dt_node_is_integer(addr) == 0 && dt_node_is_pointer(addr) == 0) {
693 dnerror(addr, D_TRACEMEM_ADDR,
694 "tracemem( ) argument #1 is incompatible with "
695 "prototype:\n\tprototype: pointer or integer\n"
697 dt_node_type_name(addr, n, sizeof (n)));
700 if (dt_node_is_posconst(size) == 0) {
701 dnerror(size, D_TRACEMEM_SIZE, "tracemem( ) argument #2 must "
702 "be a non-zero positive integral constant expression\n");
706 ap->dtad_difo = dt_as(yypcb);
707 ap->dtad_kind = DTRACEACT_DIFEXPR;
709 ap->dtad_difo->dtdo_rtype.dtdt_flags |= DIF_TF_BYREF;
710 ap->dtad_difo->dtdo_rtype.dtdt_size = size->dn_value;
714 dt_action_stack_args(dtrace_hdl_t *dtp, dtrace_actdesc_t *ap, dt_node_t *arg0)
716 ap->dtad_kind = DTRACEACT_STACK;
718 if (dtp->dt_options[DTRACEOPT_STACKFRAMES] != DTRACEOPT_UNSET) {
719 ap->dtad_arg = dtp->dt_options[DTRACEOPT_STACKFRAMES];
725 if (arg0->dn_list != NULL) {
726 dnerror(arg0, D_STACK_PROTO, "stack( ) prototype "
727 "mismatch: too many arguments\n");
730 if (dt_node_is_posconst(arg0) == 0) {
731 dnerror(arg0, D_STACK_SIZE, "stack( ) size must be a "
732 "non-zero positive integral constant expression\n");
735 ap->dtad_arg = arg0->dn_value;
740 dt_action_stack(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
742 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
743 dt_action_stack_args(dtp, ap, dnp->dn_args);
747 dt_action_ustack_args(dtrace_hdl_t *dtp, dtrace_actdesc_t *ap, dt_node_t *dnp)
749 uint32_t nframes = 0;
750 uint32_t strsize = 0; /* default string table size */
751 dt_node_t *arg0 = dnp->dn_args;
752 dt_node_t *arg1 = arg0 != NULL ? arg0->dn_list : NULL;
754 assert(dnp->dn_ident->di_id == DT_ACT_JSTACK ||
755 dnp->dn_ident->di_id == DT_ACT_USTACK);
757 if (dnp->dn_ident->di_id == DT_ACT_JSTACK) {
758 if (dtp->dt_options[DTRACEOPT_JSTACKFRAMES] != DTRACEOPT_UNSET)
759 nframes = dtp->dt_options[DTRACEOPT_JSTACKFRAMES];
761 if (dtp->dt_options[DTRACEOPT_JSTACKSTRSIZE] != DTRACEOPT_UNSET)
762 strsize = dtp->dt_options[DTRACEOPT_JSTACKSTRSIZE];
764 ap->dtad_kind = DTRACEACT_JSTACK;
766 assert(dnp->dn_ident->di_id == DT_ACT_USTACK);
768 if (dtp->dt_options[DTRACEOPT_USTACKFRAMES] != DTRACEOPT_UNSET)
769 nframes = dtp->dt_options[DTRACEOPT_USTACKFRAMES];
771 ap->dtad_kind = DTRACEACT_USTACK;
775 if (!dt_node_is_posconst(arg0)) {
776 dnerror(arg0, D_USTACK_FRAMES, "ustack( ) argument #1 "
777 "must be a non-zero positive integer constant\n");
779 nframes = (uint32_t)arg0->dn_value;
783 if (arg1->dn_kind != DT_NODE_INT ||
784 ((arg1->dn_flags & DT_NF_SIGNED) &&
785 (int64_t)arg1->dn_value < 0)) {
786 dnerror(arg1, D_USTACK_STRSIZE, "ustack( ) argument #2 "
787 "must be a positive integer constant\n");
790 if (arg1->dn_list != NULL) {
791 dnerror(arg1, D_USTACK_PROTO, "ustack( ) prototype "
792 "mismatch: too many arguments\n");
795 strsize = (uint32_t)arg1->dn_value;
798 ap->dtad_arg = DTRACE_USTACK_ARG(nframes, strsize);
802 dt_action_ustack(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
804 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
805 dt_action_ustack_args(dtp, ap, dnp);
809 dt_action_setopt(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
811 dtrace_actdesc_t *ap;
812 dt_node_t *arg0, *arg1;
815 * The prototype guarantees that we are called with either one or
816 * two arguments, and that any arguments that are present are strings.
819 arg1 = arg0->dn_list;
821 ap = dt_stmt_action(dtp, sdp);
823 ap->dtad_difo = dt_as(yypcb);
824 ap->dtad_kind = DTRACEACT_LIBACT;
825 ap->dtad_arg = DT_ACT_SETOPT;
827 ap = dt_stmt_action(dtp, sdp);
830 dt_action_difconst(ap, 0, DTRACEACT_LIBACT);
833 ap->dtad_difo = dt_as(yypcb);
834 ap->dtad_kind = DTRACEACT_LIBACT;
837 ap->dtad_arg = DT_ACT_SETOPT;
842 dt_action_symmod_args(dtrace_hdl_t *dtp, dtrace_actdesc_t *ap,
843 dt_node_t *dnp, dtrace_actkind_t kind)
845 assert(kind == DTRACEACT_SYM || kind == DTRACEACT_MOD ||
846 kind == DTRACEACT_USYM || kind == DTRACEACT_UMOD ||
847 kind == DTRACEACT_UADDR);
850 ap->dtad_difo = dt_as(yypcb);
851 ap->dtad_kind = kind;
852 ap->dtad_difo->dtdo_rtype.dtdt_size = sizeof (uint64_t);
856 dt_action_symmod(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp,
857 dtrace_actkind_t kind)
859 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
860 dt_action_symmod_args(dtp, ap, dnp->dn_args, kind);
865 dt_action_ftruncate(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
867 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
870 * Library actions need a DIFO that serves as an argument. As
871 * ftruncate() doesn't take an argument, we generate the constant 0
872 * in a DIFO; this constant will be ignored when the ftruncate() is
875 dt_action_difconst(ap, 0, DTRACEACT_LIBACT);
876 ap->dtad_arg = DT_ACT_FTRUNCATE;
881 dt_action_stop(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
883 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
885 ap->dtad_kind = DTRACEACT_STOP;
891 dt_action_breakpoint(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
893 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
895 ap->dtad_kind = DTRACEACT_BREAKPOINT;
901 dt_action_panic(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
903 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
905 ap->dtad_kind = DTRACEACT_PANIC;
910 dt_action_chill(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
912 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
914 dt_cg(yypcb, dnp->dn_args);
915 ap->dtad_difo = dt_as(yypcb);
916 ap->dtad_kind = DTRACEACT_CHILL;
920 dt_action_raise(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
922 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
924 dt_cg(yypcb, dnp->dn_args);
925 ap->dtad_difo = dt_as(yypcb);
926 ap->dtad_kind = DTRACEACT_RAISE;
930 dt_action_exit(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
932 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
934 dt_cg(yypcb, dnp->dn_args);
935 ap->dtad_difo = dt_as(yypcb);
936 ap->dtad_kind = DTRACEACT_EXIT;
937 ap->dtad_difo->dtdo_rtype.dtdt_size = sizeof (int);
941 dt_action_speculate(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
943 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
945 dt_cg(yypcb, dnp->dn_args);
946 ap->dtad_difo = dt_as(yypcb);
947 ap->dtad_kind = DTRACEACT_SPECULATE;
951 dt_action_commit(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
953 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
955 dt_cg(yypcb, dnp->dn_args);
956 ap->dtad_difo = dt_as(yypcb);
957 ap->dtad_kind = DTRACEACT_COMMIT;
961 dt_action_discard(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
963 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
965 dt_cg(yypcb, dnp->dn_args);
966 ap->dtad_difo = dt_as(yypcb);
967 ap->dtad_kind = DTRACEACT_DISCARD;
971 dt_compile_fun(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
973 switch (dnp->dn_expr->dn_ident->di_id) {
974 case DT_ACT_BREAKPOINT:
975 dt_action_breakpoint(dtp, dnp->dn_expr, sdp);
978 dt_action_chill(dtp, dnp->dn_expr, sdp);
981 dt_action_clear(dtp, dnp->dn_expr, sdp);
984 dt_action_commit(dtp, dnp->dn_expr, sdp);
986 case DT_ACT_DENORMALIZE:
987 dt_action_normalize(dtp, dnp->dn_expr, sdp);
990 dt_action_discard(dtp, dnp->dn_expr, sdp);
993 dt_action_exit(dtp, dnp->dn_expr, sdp);
996 dt_action_printflike(dtp, dnp->dn_expr, sdp, DTRACEACT_FREOPEN);
998 case DT_ACT_FTRUNCATE:
999 dt_action_ftruncate(dtp, dnp->dn_expr, sdp);
1002 dt_action_symmod(dtp, dnp->dn_expr, sdp, DTRACEACT_MOD);
1004 case DT_ACT_NORMALIZE:
1005 dt_action_normalize(dtp, dnp->dn_expr, sdp);
1008 dt_action_panic(dtp, dnp->dn_expr, sdp);
1011 dt_action_printa(dtp, dnp->dn_expr, sdp);
1014 dt_action_printflike(dtp, dnp->dn_expr, sdp, DTRACEACT_PRINTF);
1017 dt_action_raise(dtp, dnp->dn_expr, sdp);
1020 dt_action_setopt(dtp, dnp->dn_expr, sdp);
1022 case DT_ACT_SPECULATE:
1023 dt_action_speculate(dtp, dnp->dn_expr, sdp);
1026 dt_action_stack(dtp, dnp->dn_expr, sdp);
1029 dt_action_stop(dtp, dnp->dn_expr, sdp);
1032 dt_action_symmod(dtp, dnp->dn_expr, sdp, DTRACEACT_SYM);
1035 dt_action_printflike(dtp, dnp->dn_expr, sdp, DTRACEACT_SYSTEM);
1038 dt_action_trace(dtp, dnp->dn_expr, sdp);
1040 case DT_ACT_TRACEMEM:
1041 dt_action_tracemem(dtp, dnp->dn_expr, sdp);
1044 dt_action_trunc(dtp, dnp->dn_expr, sdp);
1047 dt_action_symmod(dtp, dnp->dn_expr, sdp, DTRACEACT_UADDR);
1050 dt_action_symmod(dtp, dnp->dn_expr, sdp, DTRACEACT_UMOD);
1053 dt_action_symmod(dtp, dnp->dn_expr, sdp, DTRACEACT_USYM);
1057 dt_action_ustack(dtp, dnp->dn_expr, sdp);
1060 dnerror(dnp->dn_expr, D_UNKNOWN, "tracing function %s( ) is "
1061 "not yet supported\n", dnp->dn_expr->dn_ident->di_name);
1066 dt_compile_exp(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
1068 dtrace_actdesc_t *ap = dt_stmt_action(dtp, sdp);
1070 dt_cg(yypcb, dnp->dn_expr);
1071 ap->dtad_difo = dt_as(yypcb);
1072 ap->dtad_difo->dtdo_rtype = dt_void_rtype;
1073 ap->dtad_kind = DTRACEACT_DIFEXPR;
1077 dt_compile_agg(dtrace_hdl_t *dtp, dt_node_t *dnp, dtrace_stmtdesc_t *sdp)
1079 dt_ident_t *aid, *fid;
1080 dt_node_t *anp, *incr = NULL;
1081 dtrace_actdesc_t *ap;
1082 uint_t n = 1, argmax;
1086 * If the aggregation has no aggregating function applied to it, then
1087 * this statement has no effect. Flag this as a programming error.
1089 if (dnp->dn_aggfun == NULL) {
1090 dnerror(dnp, D_AGG_NULL, "expression has null effect: @%s\n",
1091 dnp->dn_ident->di_name);
1094 aid = dnp->dn_ident;
1095 fid = dnp->dn_aggfun->dn_ident;
1097 if (dnp->dn_aggfun->dn_args != NULL &&
1098 dt_node_is_scalar(dnp->dn_aggfun->dn_args) == 0) {
1099 dnerror(dnp->dn_aggfun, D_AGG_SCALAR, "%s( ) argument #1 must "
1100 "be of scalar type\n", fid->di_name);
1104 * The ID of the aggregation itself is implicitly recorded as the first
1105 * member of each aggregation tuple so we can distinguish them later.
1107 ap = dt_stmt_action(dtp, sdp);
1108 dt_action_difconst(ap, aid->di_id, DTRACEACT_DIFEXPR);
1110 for (anp = dnp->dn_aggtup; anp != NULL; anp = anp->dn_list) {
1111 ap = dt_stmt_action(dtp, sdp);
1114 if (anp->dn_kind == DT_NODE_FUNC) {
1115 if (anp->dn_ident->di_id == DT_ACT_STACK) {
1116 dt_action_stack_args(dtp, ap, anp->dn_args);
1120 if (anp->dn_ident->di_id == DT_ACT_USTACK ||
1121 anp->dn_ident->di_id == DT_ACT_JSTACK) {
1122 dt_action_ustack_args(dtp, ap, anp);
1126 switch (anp->dn_ident->di_id) {
1128 dt_action_symmod_args(dtp, ap,
1129 anp->dn_args, DTRACEACT_UADDR);
1133 dt_action_symmod_args(dtp, ap,
1134 anp->dn_args, DTRACEACT_USYM);
1138 dt_action_symmod_args(dtp, ap,
1139 anp->dn_args, DTRACEACT_UMOD);
1143 dt_action_symmod_args(dtp, ap,
1144 anp->dn_args, DTRACEACT_SYM);
1148 dt_action_symmod_args(dtp, ap,
1149 anp->dn_args, DTRACEACT_MOD);
1158 ap->dtad_difo = dt_as(yypcb);
1159 ap->dtad_kind = DTRACEACT_DIFEXPR;
1162 if (fid->di_id == DTRACEAGG_LQUANTIZE) {
1164 * For linear quantization, we have between two and four
1165 * arguments in addition to the expression:
1167 * arg1 => Base value
1168 * arg2 => Limit value
1169 * arg3 => Quantization level step size (defaults to 1)
1170 * arg4 => Quantization increment value (defaults to 1)
1172 dt_node_t *arg1 = dnp->dn_aggfun->dn_args->dn_list;
1173 dt_node_t *arg2 = arg1->dn_list;
1174 dt_node_t *arg3 = arg2->dn_list;
1176 uint64_t nlevels, step = 1, oarg;
1177 int64_t baseval, limitval;
1179 if (arg1->dn_kind != DT_NODE_INT) {
1180 dnerror(arg1, D_LQUANT_BASETYPE, "lquantize( ) "
1181 "argument #1 must be an integer constant\n");
1184 baseval = (int64_t)arg1->dn_value;
1186 if (baseval < INT32_MIN || baseval > INT32_MAX) {
1187 dnerror(arg1, D_LQUANT_BASEVAL, "lquantize( ) "
1188 "argument #1 must be a 32-bit quantity\n");
1191 if (arg2->dn_kind != DT_NODE_INT) {
1192 dnerror(arg2, D_LQUANT_LIMTYPE, "lquantize( ) "
1193 "argument #2 must be an integer constant\n");
1196 limitval = (int64_t)arg2->dn_value;
1198 if (limitval < INT32_MIN || limitval > INT32_MAX) {
1199 dnerror(arg2, D_LQUANT_LIMVAL, "lquantize( ) "
1200 "argument #2 must be a 32-bit quantity\n");
1203 if (limitval < baseval) {
1204 dnerror(dnp, D_LQUANT_MISMATCH,
1205 "lquantize( ) base (argument #1) must be less "
1206 "than limit (argument #2)\n");
1210 if (!dt_node_is_posconst(arg3)) {
1211 dnerror(arg3, D_LQUANT_STEPTYPE, "lquantize( ) "
1212 "argument #3 must be a non-zero positive "
1213 "integer constant\n");
1216 if ((step = arg3->dn_value) > UINT16_MAX) {
1217 dnerror(arg3, D_LQUANT_STEPVAL, "lquantize( ) "
1218 "argument #3 must be a 16-bit quantity\n");
1222 nlevels = (limitval - baseval) / step;
1225 dnerror(dnp, D_LQUANT_STEPLARGE,
1226 "lquantize( ) step (argument #3) too large: must "
1227 "have at least one quantization level\n");
1230 if (nlevels > UINT16_MAX) {
1231 dnerror(dnp, D_LQUANT_STEPSMALL, "lquantize( ) step "
1232 "(argument #3) too small: number of quantization "
1233 "levels must be a 16-bit quantity\n");
1236 arg = (step << DTRACE_LQUANTIZE_STEPSHIFT) |
1237 (nlevels << DTRACE_LQUANTIZE_LEVELSHIFT) |
1238 ((baseval << DTRACE_LQUANTIZE_BASESHIFT) &
1239 DTRACE_LQUANTIZE_BASEMASK);
1243 isp = (dt_idsig_t *)aid->di_data;
1245 if (isp->dis_auxinfo == 0) {
1247 * This is the first time we've seen an lquantize()
1248 * for this aggregation; we'll store our argument
1249 * as the auxiliary signature information.
1251 isp->dis_auxinfo = arg;
1252 } else if ((oarg = isp->dis_auxinfo) != arg) {
1254 * If we have seen this lquantize() before and the
1255 * argument doesn't match the original argument, pick
1256 * the original argument apart to concisely report the
1259 int obaseval = DTRACE_LQUANTIZE_BASE(oarg);
1260 int onlevels = DTRACE_LQUANTIZE_LEVELS(oarg);
1261 int ostep = DTRACE_LQUANTIZE_STEP(oarg);
1263 if (obaseval != baseval) {
1264 dnerror(dnp, D_LQUANT_MATCHBASE, "lquantize( ) "
1265 "base (argument #1) doesn't match previous "
1266 "declaration: expected %d, found %d\n",
1267 obaseval, (int)baseval);
1270 if (onlevels * ostep != nlevels * step) {
1271 dnerror(dnp, D_LQUANT_MATCHLIM, "lquantize( ) "
1272 "limit (argument #2) doesn't match previous"
1273 " declaration: expected %d, found %d\n",
1274 obaseval + onlevels * ostep,
1275 (int)baseval + (int)nlevels * (int)step);
1278 if (ostep != step) {
1279 dnerror(dnp, D_LQUANT_MATCHSTEP, "lquantize( ) "
1280 "step (argument #3) doesn't match previous "
1281 "declaration: expected %d, found %d\n",
1286 * We shouldn't be able to get here -- one of the
1287 * parameters must be mismatched if the arguments
1293 incr = arg3 != NULL ? arg3->dn_list : NULL;
1297 if (fid->di_id == DTRACEAGG_QUANTIZE) {
1298 incr = dnp->dn_aggfun->dn_args->dn_list;
1303 if (!dt_node_is_scalar(incr)) {
1304 dnerror(dnp, D_PROTO_ARG, "%s( ) increment value "
1305 "(argument #%d) must be of scalar type\n",
1306 fid->di_name, argmax);
1309 if ((anp = incr->dn_list) != NULL) {
1312 for (; anp != NULL; anp = anp->dn_list)
1315 dnerror(incr, D_PROTO_LEN, "%s( ) prototype "
1316 "mismatch: %d args passed, at most %d expected",
1317 fid->di_name, argc, argmax);
1320 ap = dt_stmt_action(dtp, sdp);
1324 ap->dtad_difo = dt_as(yypcb);
1325 ap->dtad_difo->dtdo_rtype = dt_void_rtype;
1326 ap->dtad_kind = DTRACEACT_DIFEXPR;
1329 assert(sdp->dtsd_aggdata == NULL);
1330 sdp->dtsd_aggdata = aid;
1332 ap = dt_stmt_action(dtp, sdp);
1333 assert(fid->di_kind == DT_IDENT_AGGFUNC);
1334 assert(DTRACEACT_ISAGG(fid->di_id));
1335 ap->dtad_kind = fid->di_id;
1336 ap->dtad_ntuple = n;
1339 if (dnp->dn_aggfun->dn_args != NULL) {
1340 dt_cg(yypcb, dnp->dn_aggfun->dn_args);
1341 ap->dtad_difo = dt_as(yypcb);
1346 dt_compile_one_clause(dtrace_hdl_t *dtp, dt_node_t *cnp, dt_node_t *pnp)
1348 dtrace_ecbdesc_t *edp;
1349 dtrace_stmtdesc_t *sdp;
1352 yylineno = pnp->dn_line;
1353 dt_setcontext(dtp, pnp->dn_desc);
1354 (void) dt_node_cook(cnp, DT_IDFLG_REF);
1356 if (DT_TREEDUMP_PASS(dtp, 2))
1357 dt_node_printr(cnp, stderr, 0);
1359 if ((edp = dt_ecbdesc_create(dtp, pnp->dn_desc)) == NULL)
1360 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
1362 assert(yypcb->pcb_ecbdesc == NULL);
1363 yypcb->pcb_ecbdesc = edp;
1365 if (cnp->dn_pred != NULL) {
1366 dt_cg(yypcb, cnp->dn_pred);
1367 edp->dted_pred.dtpdd_difo = dt_as(yypcb);
1370 if (cnp->dn_acts == NULL) {
1371 dt_stmt_append(dt_stmt_create(dtp, edp,
1372 cnp->dn_ctxattr, _dtrace_defattr), cnp);
1375 for (dnp = cnp->dn_acts; dnp != NULL; dnp = dnp->dn_list) {
1376 assert(yypcb->pcb_stmt == NULL);
1377 sdp = dt_stmt_create(dtp, edp, cnp->dn_ctxattr, cnp->dn_attr);
1379 switch (dnp->dn_kind) {
1381 if (dnp->dn_expr->dn_kind == DT_NODE_AGG)
1382 dt_compile_agg(dtp, dnp->dn_expr, sdp);
1384 dt_compile_exp(dtp, dnp, sdp);
1387 dt_compile_fun(dtp, dnp, sdp);
1390 dt_compile_agg(dtp, dnp, sdp);
1393 dnerror(dnp, D_UNKNOWN, "internal error -- node kind "
1394 "%u is not a valid statement\n", dnp->dn_kind);
1397 assert(yypcb->pcb_stmt == sdp);
1398 dt_stmt_append(sdp, dnp);
1401 assert(yypcb->pcb_ecbdesc == edp);
1402 dt_ecbdesc_release(dtp, edp);
1404 yypcb->pcb_ecbdesc = NULL;
1408 dt_compile_clause(dtrace_hdl_t *dtp, dt_node_t *cnp)
1412 for (pnp = cnp->dn_pdescs; pnp != NULL; pnp = pnp->dn_list)
1413 dt_compile_one_clause(dtp, cnp, pnp);
1417 dt_compile_xlator(dt_node_t *dnp)
1419 dt_xlator_t *dxp = dnp->dn_xlator;
1422 for (mnp = dnp->dn_members; mnp != NULL; mnp = mnp->dn_list) {
1423 assert(dxp->dx_membdif[mnp->dn_membid] == NULL);
1425 dxp->dx_membdif[mnp->dn_membid] = dt_as(yypcb);
1430 dt_setcontext(dtrace_hdl_t *dtp, dtrace_probedesc_t *pdp)
1432 const dtrace_pattr_t *pap;
1440 * Both kernel and pid based providers are allowed to have names
1441 * ending with what could be interpreted as a number. We assume it's
1442 * a pid and that we may need to dynamically create probes for
1445 * (1) The provider doesn't exist, or,
1446 * (2) The provider exists and has DTRACE_PRIV_PROC privilege.
1448 * On an error, dt_pid_create_probes() will set the error message
1449 * and tag -- we just have to longjmp() out of here.
1451 if (isdigit(pdp->dtpd_provider[strlen(pdp->dtpd_provider) - 1]) &&
1452 ((pvp = dt_provider_lookup(dtp, pdp->dtpd_provider)) == NULL ||
1453 pvp->pv_desc.dtvd_priv.dtpp_flags & DTRACE_PRIV_PROC) &&
1454 dt_pid_create_probes(pdp, dtp, yypcb) != 0) {
1455 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
1459 * Call dt_probe_info() to get the probe arguments and attributes. If
1460 * a representative probe is found, set 'pap' to the probe provider's
1461 * attributes. Otherwise set 'pap' to default Unstable attributes.
1463 if ((prp = dt_probe_info(dtp, pdp, &yypcb->pcb_pinfo)) == NULL) {
1464 pap = &_dtrace_prvdesc;
1465 err = dtrace_errno(dtp);
1466 bzero(&yypcb->pcb_pinfo, sizeof (dtrace_probeinfo_t));
1467 yypcb->pcb_pinfo.dtp_attr = pap->dtpa_provider;
1468 yypcb->pcb_pinfo.dtp_arga = pap->dtpa_args;
1470 pap = &prp->pr_pvp->pv_desc.dtvd_attr;
1474 if (err == EDT_NOPROBE && !(yypcb->pcb_cflags & DTRACE_C_ZDEFS)) {
1475 xyerror(D_PDESC_ZERO, "probe description %s:%s:%s:%s does not "
1476 "match any probes\n", pdp->dtpd_provider, pdp->dtpd_mod,
1477 pdp->dtpd_func, pdp->dtpd_name);
1480 if (err != EDT_NOPROBE && err != EDT_UNSTABLE && err != 0)
1481 xyerror(D_PDESC_INVAL, "%s\n", dtrace_errmsg(dtp, err));
1483 dt_dprintf("set context to %s:%s:%s:%s [%u] prp=%p attr=%s argc=%d\n",
1484 pdp->dtpd_provider, pdp->dtpd_mod, pdp->dtpd_func, pdp->dtpd_name,
1485 pdp->dtpd_id, (void *)prp, dt_attr_str(yypcb->pcb_pinfo.dtp_attr,
1486 attrstr, sizeof (attrstr)), yypcb->pcb_pinfo.dtp_argc);
1489 * Reset the stability attributes of D global variables that vary
1490 * based on the attributes of the provider and context itself.
1492 if ((idp = dt_idhash_lookup(dtp->dt_globals, "probeprov")) != NULL)
1493 idp->di_attr = pap->dtpa_provider;
1494 if ((idp = dt_idhash_lookup(dtp->dt_globals, "probemod")) != NULL)
1495 idp->di_attr = pap->dtpa_mod;
1496 if ((idp = dt_idhash_lookup(dtp->dt_globals, "probefunc")) != NULL)
1497 idp->di_attr = pap->dtpa_func;
1498 if ((idp = dt_idhash_lookup(dtp->dt_globals, "probename")) != NULL)
1499 idp->di_attr = pap->dtpa_name;
1500 if ((idp = dt_idhash_lookup(dtp->dt_globals, "args")) != NULL)
1501 idp->di_attr = pap->dtpa_args;
1503 yypcb->pcb_pdesc = pdp;
1504 yypcb->pcb_probe = prp;
1508 * Reset context-dependent variables and state at the end of cooking a D probe
1509 * definition clause. This ensures that external declarations between clauses
1510 * do not reference any stale context-dependent data from the previous clause.
1513 dt_endcontext(dtrace_hdl_t *dtp)
1515 static const char *const cvars[] = {
1516 "probeprov", "probemod", "probefunc", "probename", "args", NULL
1522 for (i = 0; cvars[i] != NULL; i++) {
1523 if ((idp = dt_idhash_lookup(dtp->dt_globals, cvars[i])) != NULL)
1524 idp->di_attr = _dtrace_defattr;
1527 yypcb->pcb_pdesc = NULL;
1528 yypcb->pcb_probe = NULL;
1532 dt_reduceid(dt_idhash_t *dhp, dt_ident_t *idp, dtrace_hdl_t *dtp)
1534 if (idp->di_vers != 0 && idp->di_vers > dtp->dt_vmax)
1535 dt_idhash_delete(dhp, idp);
1541 * When dtrace_setopt() is called for "version", it calls dt_reduce() to remove
1542 * any identifiers or translators that have been previously defined as bound to
1543 * a version greater than the specified version. Therefore, in our current
1544 * version implementation, establishing a binding is a one-way transformation.
1545 * In addition, no versioning is currently provided for types as our .d library
1546 * files do not define any types and we reserve prefixes DTRACE_ and dtrace_
1547 * for our exclusive use. If required, type versioning will require more work.
1550 dt_reduce(dtrace_hdl_t *dtp, dt_version_t v)
1552 char s[DT_VERSION_STRMAX];
1553 dt_xlator_t *dxp, *nxp;
1555 if (v > dtp->dt_vmax)
1556 return (dt_set_errno(dtp, EDT_VERSREDUCED));
1557 else if (v == dtp->dt_vmax)
1558 return (0); /* no reduction necessary */
1560 dt_dprintf("reducing api version to %s\n",
1561 dt_version_num2str(v, s, sizeof (s)));
1565 for (dxp = dt_list_next(&dtp->dt_xlators); dxp != NULL; dxp = nxp) {
1566 nxp = dt_list_next(dxp);
1567 if ((dxp->dx_souid.di_vers != 0 && dxp->dx_souid.di_vers > v) ||
1568 (dxp->dx_ptrid.di_vers != 0 && dxp->dx_ptrid.di_vers > v))
1569 dt_list_delete(&dtp->dt_xlators, dxp);
1572 (void) dt_idhash_iter(dtp->dt_macros, (dt_idhash_f *)dt_reduceid, dtp);
1573 (void) dt_idhash_iter(dtp->dt_aggs, (dt_idhash_f *)dt_reduceid, dtp);
1574 (void) dt_idhash_iter(dtp->dt_globals, (dt_idhash_f *)dt_reduceid, dtp);
1575 (void) dt_idhash_iter(dtp->dt_tls, (dt_idhash_f *)dt_reduceid, dtp);
1581 * Fork and exec the cpp(1) preprocessor to run over the specified input file,
1582 * and return a FILE handle for the cpp output. We use the /dev/fd filesystem
1583 * here to simplify the code by leveraging file descriptor inheritance.
1586 dt_preproc(dtrace_hdl_t *dtp, FILE *ifp)
1588 int argc = dtp->dt_cpp_argc;
1589 char **argv = malloc(sizeof (char *) * (argc + 5));
1590 FILE *ofp = tmpfile();
1592 char ipath[20], opath[20]; /* big enough for /dev/fd/ + INT_MAX + \0 */
1593 char verdef[32]; /* big enough for -D__SUNW_D_VERSION=0x%08x + \0 */
1595 struct sigaction act, oact;
1596 sigset_t mask, omask;
1603 if (argv == NULL || ofp == NULL) {
1604 (void) dt_set_errno(dtp, errno);
1609 * If the input is a seekable file, see if it is an interpreter file.
1610 * If we see #!, seek past the first line because cpp will choke on it.
1611 * We start cpp just prior to the \n at the end of this line so that
1612 * it still sees the newline, ensuring that #line values are correct.
1614 if (isatty(fileno(ifp)) == 0 && (off = ftello64(ifp)) != -1) {
1615 if ((c = fgetc(ifp)) == '#' && (c = fgetc(ifp)) == '!') {
1616 for (off += 2; c != '\n'; off++) {
1617 if ((c = fgetc(ifp)) == EOF)
1621 off--; /* start cpp just prior to \n */
1624 (void) fseeko64(ifp, off, SEEK_SET);
1627 (void) snprintf(ipath, sizeof (ipath), "/dev/fd/%d", fileno(ifp));
1628 (void) snprintf(opath, sizeof (opath), "/dev/fd/%d", fileno(ofp));
1630 bcopy(dtp->dt_cpp_argv, argv, sizeof (char *) * argc);
1632 (void) snprintf(verdef, sizeof (verdef),
1633 "-D__SUNW_D_VERSION=0x%08x", dtp->dt_vmax);
1634 argv[argc++] = verdef;
1636 switch (dtp->dt_stdcmode) {
1639 argv[argc++] = "-D__STDC__=0";
1642 argv[argc++] = "-D__STDC__=1";
1646 argv[argc++] = ipath;
1647 argv[argc++] = opath;
1651 * libdtrace must be able to be embedded in other programs that may
1652 * include application-specific signal handlers. Therefore, if we
1653 * need to fork to run cpp(1), we must avoid generating a SIGCHLD
1654 * that could confuse the containing application. To do this,
1655 * we block SIGCHLD and reset its disposition to SIG_DFL.
1656 * We restore our signal state once we are done.
1658 (void) sigemptyset(&mask);
1659 (void) sigaddset(&mask, SIGCHLD);
1660 (void) sigprocmask(SIG_BLOCK, &mask, &omask);
1662 bzero(&act, sizeof (act));
1663 act.sa_handler = SIG_DFL;
1664 (void) sigaction(SIGCHLD, &act, &oact);
1666 if ((pid = fork1()) == -1) {
1667 (void) sigaction(SIGCHLD, &oact, NULL);
1668 (void) sigprocmask(SIG_SETMASK, &omask, NULL);
1669 (void) dt_set_errno(dtp, EDT_CPPFORK);
1674 (void) execvp(dtp->dt_cpp_path, argv);
1675 _exit(errno == ENOENT ? 127 : 126);
1679 dt_dprintf("waiting for %s (PID %d)\n", dtp->dt_cpp_path,
1681 } while (waitpid(pid, &wstat, 0) == -1 && errno == EINTR);
1683 (void) sigaction(SIGCHLD, &oact, NULL);
1684 (void) sigprocmask(SIG_SETMASK, &omask, NULL);
1686 dt_dprintf("%s returned exit status 0x%x\n", dtp->dt_cpp_path, wstat);
1687 estat = WIFEXITED(wstat) ? WEXITSTATUS(wstat) : -1;
1692 (void) dt_set_errno(dtp, EDT_CPPEXEC);
1695 (void) dt_set_errno(dtp, EDT_CPPENT);
1698 (void) dt_set_errno(dtp, EDT_CPPERR);
1705 (void) fseek(ofp, 0, SEEK_SET);
1715 dt_lib_depend_error(dtrace_hdl_t *dtp, const char *format, ...)
1719 va_start(ap, format);
1720 dt_set_errmsg(dtp, NULL, NULL, NULL, 0, format, ap);
1725 dt_lib_depend_add(dtrace_hdl_t *dtp, dt_list_t *dlp, const char *arg)
1727 dt_lib_depend_t *dld;
1730 assert(arg != NULL);
1732 if ((end = strrchr(arg, '/')) == NULL)
1733 return (dt_set_errno(dtp, EINVAL));
1735 if ((dld = dt_zalloc(dtp, sizeof (dt_lib_depend_t))) == NULL)
1738 if ((dld->dtld_libpath = dt_alloc(dtp, MAXPATHLEN)) == NULL) {
1743 (void) strlcpy(dld->dtld_libpath, arg, end - arg + 2);
1744 if ((dld->dtld_library = strdup(arg)) == NULL) {
1745 dt_free(dtp, dld->dtld_libpath);
1747 return (dt_set_errno(dtp, EDT_NOMEM));
1750 dt_list_append(dlp, dld);
1755 dt_lib_depend_lookup(dt_list_t *dld, const char *arg)
1757 dt_lib_depend_t *dldn;
1759 for (dldn = dt_list_next(dld); dldn != NULL;
1760 dldn = dt_list_next(dldn)) {
1761 if (strcmp(dldn->dtld_library, arg) == 0)
1769 * Go through all the library files, and, if any library dependencies exist for
1770 * that file, add it to that node's list of dependents. The result of this
1771 * will be a graph which can then be topologically sorted to produce a
1772 * compilation order.
1775 dt_lib_build_graph(dtrace_hdl_t *dtp)
1777 dt_lib_depend_t *dld, *dpld;
1779 for (dld = dt_list_next(&dtp->dt_lib_dep); dld != NULL;
1780 dld = dt_list_next(dld)) {
1781 char *library = dld->dtld_library;
1783 for (dpld = dt_list_next(&dld->dtld_dependencies); dpld != NULL;
1784 dpld = dt_list_next(dpld)) {
1785 dt_lib_depend_t *dlda;
1787 if ((dlda = dt_lib_depend_lookup(&dtp->dt_lib_dep,
1788 dpld->dtld_library)) == NULL) {
1789 dt_lib_depend_error(dtp,
1790 "Invalid library dependency in %s: %s\n",
1791 dld->dtld_library, dpld->dtld_library);
1793 return (dt_set_errno(dtp, EDT_COMPILER));
1796 if ((dt_lib_depend_add(dtp, &dlda->dtld_dependents,
1798 return (-1); /* preserve dt_errno */
1806 dt_topo_sort(dtrace_hdl_t *dtp, dt_lib_depend_t *dld, int *count)
1808 dt_lib_depend_t *dpld, *dlda, *new;
1810 dld->dtld_start = ++(*count);
1812 for (dpld = dt_list_next(&dld->dtld_dependents); dpld != NULL;
1813 dpld = dt_list_next(dpld)) {
1814 dlda = dt_lib_depend_lookup(&dtp->dt_lib_dep,
1815 dpld->dtld_library);
1816 assert(dlda != NULL);
1818 if (dlda->dtld_start == 0 &&
1819 dt_topo_sort(dtp, dlda, count) == -1)
1823 if ((new = dt_zalloc(dtp, sizeof (dt_lib_depend_t))) == NULL)
1826 if ((new->dtld_library = strdup(dld->dtld_library)) == NULL) {
1828 return (dt_set_errno(dtp, EDT_NOMEM));
1831 new->dtld_start = dld->dtld_start;
1832 new->dtld_finish = dld->dtld_finish = ++(*count);
1833 dt_list_prepend(&dtp->dt_lib_dep_sorted, new);
1835 dt_dprintf("library %s sorted (%d/%d)\n", new->dtld_library,
1836 new->dtld_start, new->dtld_finish);
1842 dt_lib_depend_sort(dtrace_hdl_t *dtp)
1844 dt_lib_depend_t *dld, *dpld, *dlda;
1847 if (dt_lib_build_graph(dtp) == -1)
1848 return (-1); /* preserve dt_errno */
1851 * Perform a topological sort of the graph that hangs off
1852 * dtp->dt_lib_dep. The result of this process will be a
1853 * dependency ordered list located at dtp->dt_lib_dep_sorted.
1855 for (dld = dt_list_next(&dtp->dt_lib_dep); dld != NULL;
1856 dld = dt_list_next(dld)) {
1857 if (dld->dtld_start == 0 &&
1858 dt_topo_sort(dtp, dld, &count) == -1)
1859 return (-1); /* preserve dt_errno */;
1863 * Check the graph for cycles. If an ancestor's finishing time is
1864 * less than any of its dependent's finishing times then a back edge
1865 * exists in the graph and this is a cycle.
1867 for (dld = dt_list_next(&dtp->dt_lib_dep); dld != NULL;
1868 dld = dt_list_next(dld)) {
1869 for (dpld = dt_list_next(&dld->dtld_dependents); dpld != NULL;
1870 dpld = dt_list_next(dpld)) {
1871 dlda = dt_lib_depend_lookup(&dtp->dt_lib_dep_sorted,
1872 dpld->dtld_library);
1873 assert(dlda != NULL);
1875 if (dlda->dtld_finish > dld->dtld_finish) {
1876 dt_lib_depend_error(dtp,
1877 "Cyclic dependency detected: %s => %s\n",
1878 dld->dtld_library, dpld->dtld_library);
1880 return (dt_set_errno(dtp, EDT_COMPILER));
1889 dt_lib_depend_free(dtrace_hdl_t *dtp)
1891 dt_lib_depend_t *dld, *dlda;
1893 while ((dld = dt_list_next(&dtp->dt_lib_dep)) != NULL) {
1894 while ((dlda = dt_list_next(&dld->dtld_dependencies)) != NULL) {
1895 dt_list_delete(&dld->dtld_dependencies, dlda);
1896 dt_free(dtp, dlda->dtld_library);
1897 dt_free(dtp, dlda->dtld_libpath);
1900 while ((dlda = dt_list_next(&dld->dtld_dependents)) != NULL) {
1901 dt_list_delete(&dld->dtld_dependents, dlda);
1902 dt_free(dtp, dlda->dtld_library);
1903 dt_free(dtp, dlda->dtld_libpath);
1906 dt_list_delete(&dtp->dt_lib_dep, dld);
1907 dt_free(dtp, dld->dtld_library);
1908 dt_free(dtp, dld->dtld_libpath);
1912 while ((dld = dt_list_next(&dtp->dt_lib_dep_sorted)) != NULL) {
1913 dt_list_delete(&dtp->dt_lib_dep_sorted, dld);
1914 dt_free(dtp, dld->dtld_library);
1921 * Open all of the .d library files found in the specified directory and
1922 * compile each one in topological order to cache its inlines and translators,
1923 * etc. We silently ignore any missing directories and other files found
1924 * therein. We only fail (and thereby fail dt_load_libs()) if we fail to
1925 * compile a library and the error is something other than #pragma D depends_on.
1926 * Dependency errors are silently ignored to permit a library directory to
1927 * contain libraries which may not be accessible depending on our privileges.
1930 dt_load_libs_dir(dtrace_hdl_t *dtp, const char *path)
1936 char fname[PATH_MAX];
1940 dt_lib_depend_t *dld;
1942 if ((dirp = opendir(path)) == NULL) {
1943 dt_dprintf("skipping lib dir %s: %s\n", path, strerror(errno));
1947 /* First, parse each file for library dependencies. */
1948 while ((dp = readdir(dirp)) != NULL) {
1949 if ((p = strrchr(dp->d_name, '.')) == NULL || strcmp(p, ".d"))
1950 continue; /* skip any filename not ending in .d */
1952 (void) snprintf(fname, sizeof (fname),
1953 "%s/%s", path, dp->d_name);
1955 if ((fp = fopen(fname, "r")) == NULL) {
1956 dt_dprintf("skipping library %s: %s\n",
1957 fname, strerror(errno));
1961 dtp->dt_filetag = fname;
1962 if (dt_lib_depend_add(dtp, &dtp->dt_lib_dep, fname) != 0)
1965 rv = dt_compile(dtp, DT_CTX_DPROG,
1966 DTRACE_PROBESPEC_NAME, NULL,
1967 DTRACE_C_EMPTY | DTRACE_C_CTL, 0, NULL, fp, NULL);
1969 if (rv != NULL && dtp->dt_errno &&
1970 (dtp->dt_errno != EDT_COMPILER ||
1971 dtp->dt_errtag != dt_errtag(D_PRAGMA_DEPEND)))
1975 dt_dprintf("error parsing library %s: %s\n",
1976 fname, dtrace_errmsg(dtp, dtrace_errno(dtp)));
1979 dtp->dt_filetag = NULL;
1982 (void) closedir(dirp);
1984 * Finish building the graph containing the library dependencies
1985 * and perform a topological sort to generate an ordered list
1988 if (dt_lib_depend_sort(dtp) == -1)
1991 for (dld = dt_list_next(&dtp->dt_lib_dep_sorted); dld != NULL;
1992 dld = dt_list_next(dld)) {
1994 if ((fp = fopen(dld->dtld_library, "r")) == NULL) {
1995 dt_dprintf("skipping library %s: %s\n",
1996 dld->dtld_library, strerror(errno));
2000 dtp->dt_filetag = dld->dtld_library;
2001 pgp = dtrace_program_fcompile(dtp, fp, DTRACE_C_EMPTY, 0, NULL);
2003 dtp->dt_filetag = NULL;
2005 if (pgp == NULL && (dtp->dt_errno != EDT_COMPILER ||
2006 dtp->dt_errtag != dt_errtag(D_PRAGMA_DEPEND)))
2010 dt_dprintf("skipping library %s: %s\n",
2012 dtrace_errmsg(dtp, dtrace_errno(dtp)));
2014 dt_program_destroy(dtp, pgp);
2017 dt_lib_depend_free(dtp);
2021 dt_lib_depend_free(dtp);
2022 return (-1); /* preserve dt_errno */
2026 * Load the contents of any appropriate DTrace .d library files. These files
2027 * contain inlines and translators that will be cached by the compiler. We
2028 * defer this activity until the first compile to permit libdtrace clients to
2029 * add their own library directories and so that we can properly report errors.
2032 dt_load_libs(dtrace_hdl_t *dtp)
2036 if (dtp->dt_cflags & DTRACE_C_NOLIBS)
2037 return (0); /* libraries already processed */
2039 dtp->dt_cflags |= DTRACE_C_NOLIBS;
2041 for (dirp = dt_list_next(&dtp->dt_lib_path);
2042 dirp != NULL; dirp = dt_list_next(dirp)) {
2043 if (dt_load_libs_dir(dtp, dirp->dir_path) != 0) {
2044 dtp->dt_cflags &= ~DTRACE_C_NOLIBS;
2045 return (-1); /* errno is set for us */
2053 dt_compile(dtrace_hdl_t *dtp, int context, dtrace_probespec_t pspec, void *arg,
2054 uint_t cflags, int argc, char *const argv[], FILE *fp, const char *s)
2062 if ((fp == NULL && s == NULL) || (cflags & ~DTRACE_C_MASK) != 0) {
2063 (void) dt_set_errno(dtp, EINVAL);
2067 if (dt_list_next(&dtp->dt_lib_path) != NULL && dt_load_libs(dtp) != 0)
2068 return (NULL); /* errno is set for us */
2070 (void) ctf_discard(dtp->dt_cdefs->dm_ctfp);
2071 (void) ctf_discard(dtp->dt_ddefs->dm_ctfp);
2073 (void) dt_idhash_iter(dtp->dt_globals, dt_idreset, NULL);
2074 (void) dt_idhash_iter(dtp->dt_tls, dt_idreset, NULL);
2076 if (fp && (cflags & DTRACE_C_CPP) && (fp = dt_preproc(dtp, fp)) == NULL)
2077 return (NULL); /* errno is set for us */
2079 dt_pcb_push(dtp, &pcb);
2081 pcb.pcb_fileptr = fp;
2084 pcb.pcb_strlen = s ? strlen(s) : 0;
2085 pcb.pcb_sargc = argc;
2086 pcb.pcb_sargv = argv;
2087 pcb.pcb_sflagv = argc ? calloc(argc, sizeof (ushort_t)) : NULL;
2088 pcb.pcb_pspec = pspec;
2089 pcb.pcb_cflags = dtp->dt_cflags | cflags;
2090 pcb.pcb_amin = dtp->dt_amin;
2091 pcb.pcb_yystate = -1;
2092 pcb.pcb_context = context;
2093 pcb.pcb_token = context;
2095 if (context != DT_CTX_DPROG)
2097 else if (cflags & DTRACE_C_CTL)
2098 yybegin(YYS_CONTROL);
2100 yybegin(YYS_CLAUSE);
2102 if ((err = setjmp(yypcb->pcb_jmpbuf)) != 0)
2105 if (yypcb->pcb_sargc != 0 && yypcb->pcb_sflagv == NULL)
2106 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2108 yypcb->pcb_idents = dt_idhash_create("ambiguous", NULL, 0, 0);
2109 yypcb->pcb_locals = dt_idhash_create("clause local", NULL,
2110 DIF_VAR_OTHER_UBASE, DIF_VAR_OTHER_MAX);
2112 if (yypcb->pcb_idents == NULL || yypcb->pcb_locals == NULL)
2113 longjmp(yypcb->pcb_jmpbuf, EDT_NOMEM);
2116 * Invoke the parser to evaluate the D source code. If any errors
2117 * occur during parsing, an error function will be called and we
2118 * will longjmp back to pcb_jmpbuf to abort. If parsing succeeds,
2119 * we optionally display the parse tree if debugging is enabled.
2121 if (yyparse() != 0 || yypcb->pcb_root == NULL)
2122 xyerror(D_EMPTY, "empty D program translation unit\n");
2126 if (cflags & DTRACE_C_CTL)
2129 if (context != DT_CTX_DTYPE && DT_TREEDUMP_PASS(dtp, 1))
2130 dt_node_printr(yypcb->pcb_root, stderr, 0);
2132 if (yypcb->pcb_pragmas != NULL)
2133 (void) dt_idhash_iter(yypcb->pcb_pragmas, dt_idpragma, NULL);
2135 if (argc > 1 && !(yypcb->pcb_cflags & DTRACE_C_ARGREF) &&
2136 !(yypcb->pcb_sflagv[argc - 1] & DT_IDFLG_REF)) {
2137 xyerror(D_MACRO_UNUSED, "extraneous argument '%s' ($%d is "
2138 "not referenced)\n", yypcb->pcb_sargv[argc - 1], argc - 1);
2142 * If we have successfully created a parse tree for a D program, loop
2143 * over the clauses and actions and instantiate the corresponding
2144 * libdtrace program. If we are parsing a D expression, then we
2145 * simply run the code generator and assembler on the resulting tree.
2149 assert(yypcb->pcb_root->dn_kind == DT_NODE_PROG);
2151 if ((dnp = yypcb->pcb_root->dn_list) == NULL &&
2152 !(yypcb->pcb_cflags & DTRACE_C_EMPTY))
2153 xyerror(D_EMPTY, "empty D program translation unit\n");
2155 if ((yypcb->pcb_prog = dt_program_create(dtp)) == NULL)
2156 longjmp(yypcb->pcb_jmpbuf, dtrace_errno(dtp));
2158 for (; dnp != NULL; dnp = dnp->dn_list) {
2159 switch (dnp->dn_kind) {
2160 case DT_NODE_CLAUSE:
2161 dt_compile_clause(dtp, dnp);
2163 case DT_NODE_XLATOR:
2164 if (dtp->dt_xlatemode == DT_XL_DYNAMIC)
2165 dt_compile_xlator(dnp);
2167 case DT_NODE_PROVIDER:
2168 (void) dt_node_cook(dnp, DT_IDFLG_REF);
2173 yypcb->pcb_prog->dp_xrefs = yypcb->pcb_asxrefs;
2174 yypcb->pcb_prog->dp_xrefslen = yypcb->pcb_asxreflen;
2175 yypcb->pcb_asxrefs = NULL;
2176 yypcb->pcb_asxreflen = 0;
2178 rv = yypcb->pcb_prog;
2182 (void) dt_node_cook(yypcb->pcb_root, DT_IDFLG_REF);
2183 dt_cg(yypcb, yypcb->pcb_root);
2188 ddp = (dt_decl_t *)yypcb->pcb_root; /* root is really a decl */
2189 err = dt_decl_type(ddp, arg);
2193 longjmp(yypcb->pcb_jmpbuf, EDT_COMPILER);
2200 if (context != DT_CTX_DTYPE && DT_TREEDUMP_PASS(dtp, 3))
2201 dt_node_printr(yypcb->pcb_root, stderr, 0);
2203 if (dtp->dt_cdefs_fd != -1 && (ftruncate64(dtp->dt_cdefs_fd, 0) == -1 ||
2204 lseek64(dtp->dt_cdefs_fd, 0, SEEK_SET) == -1 ||
2205 ctf_write(dtp->dt_cdefs->dm_ctfp, dtp->dt_cdefs_fd) == CTF_ERR))
2206 dt_dprintf("failed to update CTF cache: %s\n", strerror(errno));
2208 if (dtp->dt_ddefs_fd != -1 && (ftruncate64(dtp->dt_ddefs_fd, 0) == -1 ||
2209 lseek64(dtp->dt_ddefs_fd, 0, SEEK_SET) == -1 ||
2210 ctf_write(dtp->dt_ddefs->dm_ctfp, dtp->dt_ddefs_fd) == CTF_ERR))
2211 dt_dprintf("failed to update CTF cache: %s\n", strerror(errno));
2213 if (yypcb->pcb_fileptr && (cflags & DTRACE_C_CPP))
2214 (void) fclose(yypcb->pcb_fileptr); /* close dt_preproc() file */
2216 dt_pcb_pop(dtp, err);
2217 (void) dt_set_errno(dtp, err);
2218 return (err ? NULL : rv);
2222 dtrace_program_strcompile(dtrace_hdl_t *dtp, const char *s,
2223 dtrace_probespec_t spec, uint_t cflags, int argc, char *const argv[])
2225 return (dt_compile(dtp, DT_CTX_DPROG,
2226 spec, NULL, cflags, argc, argv, NULL, s));
2230 dtrace_program_fcompile(dtrace_hdl_t *dtp, FILE *fp,
2231 uint_t cflags, int argc, char *const argv[])
2233 return (dt_compile(dtp, DT_CTX_DPROG,
2234 DTRACE_PROBESPEC_NAME, NULL, cflags, argc, argv, fp, NULL));
2238 dtrace_type_strcompile(dtrace_hdl_t *dtp, const char *s, dtrace_typeinfo_t *dtt)
2240 (void) dt_compile(dtp, DT_CTX_DTYPE,
2241 DTRACE_PROBESPEC_NONE, dtt, 0, 0, NULL, NULL, s);
2242 return (dtp->dt_errno ? -1 : 0);
2246 dtrace_type_fcompile(dtrace_hdl_t *dtp, FILE *fp, dtrace_typeinfo_t *dtt)
2248 (void) dt_compile(dtp, DT_CTX_DTYPE,
2249 DTRACE_PROBESPEC_NONE, dtt, 0, 0, NULL, fp, NULL);
2250 return (dtp->dt_errno ? -1 : 0);