2N/A/*
2N/A * CDDL HEADER START
2N/A *
2N/A * The contents of this file are subject to the terms of the
2N/A * Common Development and Distribution License (the "License").
2N/A * You may not use this file except in compliance with the License.
2N/A *
2N/A * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
2N/A * or http://www.opensolaris.org/os/licensing.
2N/A * See the License for the specific language governing permissions
2N/A * and limitations under the License.
2N/A *
2N/A * When distributing Covered Code, include this CDDL HEADER in each
2N/A * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
2N/A * If applicable, add the following below this CDDL HEADER, with the
2N/A * fields enclosed by brackets "[]" replaced with your own identifying
2N/A * information: Portions Copyright [yyyy] [name of copyright owner]
2N/A *
2N/A * CDDL HEADER END
2N/A */
2N/A
2N/A/*
2N/A * Copyright 2008 Sun Microsystems, Inc. All rights reserved.
2N/A * Use is subject to license terms.
2N/A */
2N/A
2N/A#pragma ident "%Z%%M% %I% %E% SMI"
2N/A
2N/A#include <stdio.h>
2N/A#include <ctype.h>
2N/A#include <limits.h>
2N/A#include <errno.h>
2N/A#include <stdlib.h>
2N/A#include <unistd.h>
2N/A#include <strings.h>
2N/A#include <sys/wait.h>
2N/A#include <limits.h>
2N/A#include <signal.h>
2N/A#include <libproc.h>
2N/A#include <pthread.h>
2N/A#include <dtrace_jni.h>
2N/A
2N/A/*
2N/A * Implements the work done in the running consumer loop. The native Java
2N/A * methods (JNI layer) are implemented in dtrace_jni.c.
2N/A */
2N/A
2N/A/* Record handler passed to dtrace_work() */
2N/Astatic int dtj_chewrec(const dtrace_probedata_t *, const dtrace_recdesc_t *,
2N/A void *);
2N/A/* Probe data handler passed to dtrace_work() */
2N/Astatic int dtj_chew(const dtrace_probedata_t *, void *);
2N/A
2N/A/* Processes requests from LocalConsumer enqueued during dtrace_sleep() */
2N/Astatic dtj_status_t dtj_process_requests(dtj_java_consumer_t *);
2N/A
2N/A/*
2N/A * Callback handlers set in dtj_set_callback_handlers(), called from libdtrace
2N/A * in the consumer loop (from dtrace_work())
2N/A */
2N/Astatic int dtj_drophandler(const dtrace_dropdata_t *, void *);
2N/Astatic int dtj_errhandler(const dtrace_errdata_t *, void *);
2N/Astatic void dtj_prochandler(struct ps_prochandle *, const char *, void *);
2N/Astatic int dtj_setopthandler(const dtrace_setoptdata_t *, void *);
2N/A/*
2N/A * Buffered output handler called from libdtrace in both the consumer loop (from
2N/A * dtrace_work()) and the get_aggregate() function (from
2N/A * dtrace_aggregate_print()).
2N/A */
2N/Astatic int dtj_bufhandler(const dtrace_bufdata_t *, void *);
2N/A
2N/A/* Conversion of libdtrace data into Java Objects */
2N/Astatic jobject dtj_recdata(dtj_java_consumer_t *, uint32_t, caddr_t);
2N/Astatic jobject dtj_bytedata(JNIEnv *, uint32_t, caddr_t);
2N/Astatic jobject dtj_new_stack_record(const caddr_t, const dtrace_recdesc_t *,
2N/A dtj_java_consumer_t *);
2N/Astatic jobject dtj_new_probedata_stack_record(const dtrace_probedata_t *,
2N/A const dtrace_recdesc_t *, dtj_java_consumer_t *);
2N/Astatic jobject dtj_new_symbol_record(const caddr_t, const dtrace_recdesc_t *,
2N/A dtj_java_consumer_t *);
2N/Astatic jobject dtj_new_probedata_symbol_record(const dtrace_probedata_t *,
2N/A const dtrace_recdesc_t *, dtj_java_consumer_t *);
2N/A/* Aggregation data */
2N/Astatic jobject dtj_new_tuple_stack_record(const dtrace_aggdata_t *,
2N/A const dtrace_recdesc_t *, const char *, dtj_java_consumer_t *);
2N/Astatic jobject dtj_new_tuple_symbol_record(const dtrace_aggdata_t *,
2N/A const dtrace_recdesc_t *, const char *, dtj_java_consumer_t *);
2N/Astatic jobject dtj_new_distribution(const dtrace_aggdata_t *,
2N/A const dtrace_recdesc_t *, dtj_java_consumer_t *);
2N/Astatic jobject dtj_new_aggval(dtj_java_consumer_t *, const dtrace_aggdata_t *,
2N/A const dtrace_recdesc_t *);
2N/Astatic int64_t dtj_average(caddr_t, uint64_t);
2N/Astatic int64_t dtj_avg_total(caddr_t, uint64_t);
2N/Astatic int64_t dtj_avg_count(caddr_t);
2N/Astatic jobject dtj_stddev(JNIEnv *, caddr_t, uint64_t);
2N/A
2N/A/* Aggregation functions */
2N/Astatic void dtj_aggwalk_init(dtj_java_consumer_t *);
2N/Astatic int dtj_agghandler(const dtrace_bufdata_t *, dtj_java_consumer_t *);
2N/Astatic boolean_t dtj_is_included(const dtrace_aggdata_t *,
2N/A dtj_java_consumer_t *);
2N/Astatic void dtj_attach_frames(dtj_java_consumer_t *, jobject, jobjectArray);
2N/Astatic void dtj_attach_name(dtj_java_consumer_t *, jobject, jstring);
2N/Astatic boolean_t dtj_is_stack_action(dtrace_actkind_t);
2N/Astatic boolean_t dtj_is_symbol_action(dtrace_actkind_t);
2N/Astatic int dtj_clear(const dtrace_aggdata_t *, void *);
2N/A
2N/A/*
2N/A * The consumer loop needs to protect calls to libdtrace functions with a global
2N/A * lock. JNI native method calls in dtrace_jni.c are already protected and do
2N/A * not need this function.
2N/A */
2N/Adtj_status_t
2N/Adtj_get_dtrace_error(dtj_java_consumer_t *jc, dtj_error_t *e)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A dtrace_hdl_t *dtp = jc->dtjj_consumer->dtjc_dtp;
2N/A
2N/A /* Must not call MonitorEnter with a pending exception */
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTJ_ERR);
2N/A }
2N/A /* Grab global lock */
2N/A (*jenv)->MonitorEnter(jenv, g_caller_jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTJ_ERR);
2N/A }
2N/A e->dtje_number = dtrace_errno(dtp);
2N/A e->dtje_message = dtrace_errmsg(dtp, e->dtje_number);
2N/A (*jenv)->MonitorExit(jenv, g_caller_jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTJ_ERR);
2N/A }
2N/A return (DTJ_OK);
2N/A}
2N/A
2N/A/*
2N/A * Protected by global lock (LocalConsumer.class) that protects call to
2N/A * Java_org_opensolaris_os_dtrace_LocalConsumer__1go()
2N/A */
2N/Adtj_status_t
2N/Adtj_set_callback_handlers(dtj_java_consumer_t *jc)
2N/A{
2N/A dtrace_hdl_t *dtp = jc->dtjj_consumer->dtjc_dtp;
2N/A dtrace_optval_t optval;
2N/A
2N/A if (dtrace_handle_buffered(dtp, &dtj_bufhandler, NULL) == -1) {
2N/A dtj_throw_dtrace_exception(jc,
2N/A "failed to establish buffered handler: %s",
2N/A dtrace_errmsg(dtp, dtrace_errno(dtp)));
2N/A return (DTJ_ERR);
2N/A }
2N/A
2N/A if (dtrace_handle_drop(dtp, &dtj_drophandler, NULL) == -1) {
2N/A dtj_throw_dtrace_exception(jc,
2N/A "failed to establish drop handler: %s",
2N/A dtrace_errmsg(dtp, dtrace_errno(dtp)));
2N/A return (DTJ_ERR);
2N/A }
2N/A
2N/A if (dtrace_handle_err(dtp, &dtj_errhandler, NULL) == -1) {
2N/A dtj_throw_dtrace_exception(jc,
2N/A "failed to establish error handler: %s",
2N/A dtrace_errmsg(dtp, dtrace_errno(dtp)));
2N/A return (DTJ_ERR);
2N/A }
2N/A
2N/A if (dtrace_handle_proc(dtp, &dtj_prochandler, NULL) == -1) {
2N/A dtj_throw_dtrace_exception(jc,
2N/A "failed to establish proc handler: %s",
2N/A dtrace_errmsg(dtp, dtrace_errno(dtp)));
2N/A return (DTJ_ERR);
2N/A }
2N/A
2N/A if (dtrace_getopt(dtp, "flowindent", &optval) == -1) {
2N/A dtj_throw_dtrace_exception(jc,
2N/A "couldn't get option %s: %s", "flowindent",
2N/A dtrace_errmsg(dtp, dtrace_errno(dtp)));
2N/A return (DTJ_ERR);
2N/A }
2N/A
2N/A jc->dtjj_consumer->dtjc_flow = (optval != DTRACEOPT_UNSET);
2N/A
2N/A if (dtrace_handle_setopt(dtp, &dtj_setopthandler, NULL) == -1) {
2N/A dtj_throw_dtrace_exception(jc,
2N/A "failed to establish setopt handler: %s",
2N/A dtrace_errmsg(dtp, dtrace_errno(dtp)));
2N/A return (DTJ_ERR);
2N/A }
2N/A
2N/A return (DTJ_OK);
2N/A}
2N/A
2N/Astatic int
2N/A/* ARGSUSED */
2N/Adtj_drophandler(const dtrace_dropdata_t *data, void *arg)
2N/A{
2N/A dtj_java_consumer_t *jc;
2N/A JNIEnv *jenv;
2N/A
2N/A const char *dropkind;
2N/A
2N/A jstring msg = NULL;
2N/A jstring kind = NULL;
2N/A jobject drop = NULL;
2N/A
2N/A jc = pthread_getspecific(g_dtj_consumer_key);
2N/A jenv = jc->dtjj_jenv;
2N/A
2N/A msg = dtj_NewStringNative(jenv, data->dtdda_msg);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A switch (data->dtdda_kind) {
2N/A case DTRACEDROP_PRINCIPAL:
2N/A dropkind = "PRINCIPAL";
2N/A break;
2N/A case DTRACEDROP_AGGREGATION:
2N/A dropkind = "AGGREGATION";
2N/A break;
2N/A case DTRACEDROP_DYNAMIC:
2N/A dropkind = "DYNAMIC";
2N/A break;
2N/A case DTRACEDROP_DYNRINSE:
2N/A dropkind = "DYNRINSE";
2N/A break;
2N/A case DTRACEDROP_DYNDIRTY:
2N/A dropkind = "DYNDIRTY";
2N/A break;
2N/A case DTRACEDROP_SPEC:
2N/A dropkind = "SPEC";
2N/A break;
2N/A case DTRACEDROP_SPECBUSY:
2N/A dropkind = "SPECBUSY";
2N/A break;
2N/A case DTRACEDROP_SPECUNAVAIL:
2N/A dropkind = "SPECUNAVAIL";
2N/A break;
2N/A case DTRACEDROP_STKSTROVERFLOW:
2N/A dropkind = "STKSTROVERFLOW";
2N/A break;
2N/A case DTRACEDROP_DBLERROR:
2N/A dropkind = "DBLERROR";
2N/A break;
2N/A default:
2N/A dropkind = "UNKNOWN";
2N/A }
2N/A kind = (*jenv)->NewStringUTF(jenv, dropkind);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A (*jenv)->DeleteLocalRef(jenv, msg);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A drop = (*jenv)->NewObject(jenv, g_drop_jc, g_dropinit_jm,
2N/A data->dtdda_cpu, kind, data->dtdda_drops, data->dtdda_total, msg);
2N/A (*jenv)->DeleteLocalRef(jenv, kind);
2N/A (*jenv)->DeleteLocalRef(jenv, msg);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_caller, g_drop_jm, drop);
2N/A (*jenv)->DeleteLocalRef(jenv, drop);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A
2N/A return (DTRACE_HANDLE_OK);
2N/A}
2N/A
2N/Astatic int
2N/A/* ARGSUSED */
2N/Adtj_errhandler(const dtrace_errdata_t *data, void *arg)
2N/A{
2N/A dtj_java_consumer_t *jc;
2N/A JNIEnv *jenv;
2N/A
2N/A const char *f;
2N/A int64_t addr;
2N/A
2N/A jobject probe = NULL;
2N/A jstring fault = NULL;
2N/A jstring msg = NULL;
2N/A jobject error = NULL;
2N/A
2N/A jc = pthread_getspecific(g_dtj_consumer_key);
2N/A jenv = jc->dtjj_jenv;
2N/A
2N/A probe = dtj_new_probedesc(jc, data->dteda_pdesc);
2N/A if (!probe) {
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A f = dtj_get_fault_name(data->dteda_fault);
2N/A if (f) {
2N/A fault = (*jenv)->NewStringUTF(jenv, f);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A (*jenv)->DeleteLocalRef(jenv, probe);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A }
2N/A switch (data->dteda_fault) {
2N/A case DTRACEFLT_BADADDR:
2N/A case DTRACEFLT_BADALIGN:
2N/A case DTRACEFLT_BADSTACK:
2N/A addr = data->dteda_addr;
2N/A break;
2N/A default:
2N/A addr = -1;
2N/A }
2N/A msg = dtj_NewStringNative(jenv, data->dteda_msg);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A (*jenv)->DeleteLocalRef(jenv, probe);
2N/A (*jenv)->DeleteLocalRef(jenv, fault);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A error = (*jenv)->NewObject(jenv, g_error_jc, g_errinit_jm,
2N/A probe,
2N/A data->dteda_edesc->dtepd_epid,
2N/A data->dteda_cpu,
2N/A data->dteda_action,
2N/A data->dteda_offset,
2N/A fault, addr, msg);
2N/A (*jenv)->DeleteLocalRef(jenv, msg);
2N/A (*jenv)->DeleteLocalRef(jenv, fault);
2N/A (*jenv)->DeleteLocalRef(jenv, probe);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_caller, g_error_jm, error);
2N/A (*jenv)->DeleteLocalRef(jenv, error);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A
2N/A return (DTRACE_HANDLE_OK);
2N/A}
2N/A
2N/A/*
2N/A * Since the function signature does not allow us to return an abort signal, we
2N/A * need to temporarily clear any pending exception before returning, since
2N/A * without the abort we can't guarantee that the exception will be checked in
2N/A * time to prevent invalid JNI function calls.
2N/A */
2N/Astatic void
2N/A/* ARGSUSED */
2N/Adtj_prochandler(struct ps_prochandle *P, const char *msg, void *arg)
2N/A{
2N/A dtj_java_consumer_t *jc;
2N/A JNIEnv *jenv;
2N/A
2N/A const psinfo_t *prp = Ppsinfo(P);
2N/A int pid = Pstatus(P)->pr_pid;
2N/A int signal = -1;
2N/A char signame[SIG2STR_MAX];
2N/A const char *statusname;
2N/A int exit = INT_MAX; /* invalid initial status */
2N/A
2N/A jstring status = NULL;
2N/A jstring signalName = NULL;
2N/A jstring message = NULL;
2N/A jobject process = NULL;
2N/A
2N/A jc = pthread_getspecific(g_dtj_consumer_key);
2N/A jenv = jc->dtjj_jenv;
2N/A
2N/A switch (Pstate(P)) {
2N/A case PS_RUN:
2N/A statusname = "RUN";
2N/A break;
2N/A case PS_STOP:
2N/A statusname = "STOP";
2N/A break;
2N/A case PS_UNDEAD:
2N/A statusname = "UNDEAD";
2N/A if (prp != NULL) {
2N/A exit = WEXITSTATUS(prp->pr_wstat);
2N/A }
2N/A if (prp != NULL && WIFSIGNALED(prp->pr_wstat)) {
2N/A signal = WTERMSIG(prp->pr_wstat);
2N/A (void) proc_signame(signal, signame, sizeof (signame));
2N/A signalName = (*jenv)->NewStringUTF(jenv, signame);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A goto proc_end;
2N/A }
2N/A }
2N/A ++jc->dtjj_consumer->dtjc_procs_ended;
2N/A break;
2N/A case PS_LOST:
2N/A statusname = "LOST";
2N/A ++jc->dtjj_consumer->dtjc_procs_ended;
2N/A break;
2N/A case PS_DEAD:
2N/A /*
2N/A * PS_DEAD not handled by dtrace.c prochandler, still this is a
2N/A * case of process termination and it can't hurt to handle it.
2N/A */
2N/A statusname = "DEAD";
2N/A ++jc->dtjj_consumer->dtjc_procs_ended;
2N/A break;
2N/A default:
2N/A /*
2N/A * Unexpected, but erring on the side of tolerance by not
2N/A * crashing the consumer. Failure to notify listeners of
2N/A * process state not handled by the dtrace.c prochandler does
2N/A * not seem serious.
2N/A */
2N/A return;
2N/A }
2N/A
2N/A status = (*jenv)->NewStringUTF(jenv, statusname);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A (*jenv)->DeleteLocalRef(jenv, signalName);
2N/A goto proc_end;
2N/A }
2N/A if (msg) {
2N/A message = dtj_NewStringNative(jenv, msg);
2N/A if (!message) {
2N/A (*jenv)->DeleteLocalRef(jenv, status);
2N/A (*jenv)->DeleteLocalRef(jenv, signalName);
2N/A goto proc_end;
2N/A }
2N/A }
2N/A process = (*jenv)->NewObject(jenv, g_process_jc, g_procinit_jm,
2N/A pid, status, signal, signalName, NULL, message);
2N/A (*jenv)->DeleteLocalRef(jenv, status);
2N/A (*jenv)->DeleteLocalRef(jenv, signalName);
2N/A (*jenv)->DeleteLocalRef(jenv, message);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A goto proc_end;
2N/A }
2N/A if (exit != INT_MAX) {
2N/A /* valid exit status */
2N/A (*jenv)->CallVoidMethod(jenv, process, g_procexit_jm, exit);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A (*jenv)->DeleteLocalRef(jenv, process);
2N/A goto proc_end;
2N/A }
2N/A }
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_caller, g_proc_jm, process);
2N/A (*jenv)->DeleteLocalRef(jenv, process);
2N/A
2N/Aproc_end:
2N/A
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A /*
2N/A * Save the exception so we can rethrow it later when it's safe.
2N/A */
2N/A if (!jc->dtjj_exception) {
2N/A jthrowable e = (*jenv)->ExceptionOccurred(jenv);
2N/A jc->dtjj_exception = e;
2N/A }
2N/A (*jenv)->ExceptionClear(jenv);
2N/A }
2N/A}
2N/A
2N/Astatic int
2N/A/* ARGSUSED */
2N/Adtj_setopthandler(const dtrace_setoptdata_t *data, void *arg)
2N/A{
2N/A dtj_java_consumer_t *jc;
2N/A
2N/A jc = pthread_getspecific(g_dtj_consumer_key);
2N/A if (strcmp(data->dtsda_option, "flowindent") == 0) {
2N/A jc->dtjj_consumer->dtjc_flow =
2N/A (data->dtsda_newval != DTRACEOPT_UNSET);
2N/A }
2N/A return (DTRACE_HANDLE_OK);
2N/A}
2N/A
2N/A/*
2N/A * Most of this function lifted from libdtrace/common/dt_consume.c
2N/A * dt_print_bytes().
2N/A */
2N/Astatic jobject
2N/Adtj_bytedata(JNIEnv *jenv, uint32_t nbytes, caddr_t addr)
2N/A{
2N/A /*
2N/A * If the byte stream is a series of printable characters, followed by
2N/A * a terminating byte, we print it out as a string. Otherwise, we
2N/A * assume that it's something else and just print the bytes.
2N/A */
2N/A int i, j;
2N/A char *c = addr;
2N/A
2N/A jobject jobj = NULL; /* return value */
2N/A
2N/A if (nbytes == 0) {
2N/A return ((*jenv)->NewStringUTF(jenv, ""));
2N/A }
2N/A
2N/A for (i = 0; i < nbytes; i++) {
2N/A /*
2N/A * We define a "printable character" to be one for which
2N/A * isprint(3C) returns non-zero, isspace(3C) returns non-zero,
2N/A * or a character which is either backspace or the bell.
2N/A * Backspace and the bell are regrettably special because
2N/A * they fail the first two tests -- and yet they are entirely
2N/A * printable. These are the only two control characters that
2N/A * have meaning for the terminal and for which isprint(3C) and
2N/A * isspace(3C) return 0.
2N/A */
2N/A if (isprint(c[i]) || isspace(c[i]) ||
2N/A c[i] == '\b' || c[i] == '\a')
2N/A continue;
2N/A
2N/A if (c[i] == '\0' && i > 0) {
2N/A /*
2N/A * This looks like it might be a string. Before we
2N/A * assume that it is indeed a string, check the
2N/A * remainder of the byte range; if it contains
2N/A * additional non-nul characters, we'll assume that
2N/A * it's a binary stream that just happens to look like
2N/A * a string.
2N/A */
2N/A for (j = i + 1; j < nbytes; j++) {
2N/A if (c[j] != '\0')
2N/A break;
2N/A }
2N/A
2N/A if (j != nbytes)
2N/A break;
2N/A
2N/A /* It's a string */
2N/A return (dtj_NewStringNative(jenv, (char *)addr));
2N/A }
2N/A
2N/A break;
2N/A }
2N/A
2N/A if (i == nbytes) {
2N/A /*
2N/A * The byte range is all printable characters, but there is
2N/A * no trailing nul byte. We'll assume that it's a string.
2N/A */
2N/A char *s = malloc(nbytes + 1);
2N/A if (!s) {
2N/A dtj_throw_out_of_memory(jenv,
2N/A "failed to allocate string value");
2N/A return (NULL);
2N/A }
2N/A (void) strncpy(s, c, nbytes);
2N/A s[nbytes] = '\0';
2N/A jobj = dtj_NewStringNative(jenv, s);
2N/A free(s);
2N/A return (jobj);
2N/A }
2N/A
2N/A /* return byte array */
2N/A jobj = (*jenv)->NewByteArray(jenv, nbytes);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A return (NULL);
2N/A }
2N/A (*jenv)->SetByteArrayRegion(jenv, (jbyteArray)jobj, 0, nbytes,
2N/A (const jbyte *)c);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A (*jenv)->DeleteLocalRef(jenv, jobj);
2N/A return (NULL);
2N/A }
2N/A return (jobj);
2N/A}
2N/A
2N/A/*
2N/A * Return NULL if memory could not be allocated (OutOfMemoryError is thrown in
2N/A * that case).
2N/A */
2N/Astatic jobject
2N/Adtj_recdata(dtj_java_consumer_t *jc, uint32_t size, caddr_t addr)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A jobject jobj;
2N/A jobject jrec;
2N/A
2N/A switch (size) {
2N/A case 1:
2N/A jobj = (*jenv)->NewObject(jenv, g_int_jc,
2N/A g_intinit_jm, (int)(*((uint8_t *)addr)));
2N/A break;
2N/A case 2:
2N/A jobj = (*jenv)->NewObject(jenv, g_int_jc,
2N/A /* LINTED - alignment */
2N/A g_intinit_jm, (int)(*((uint16_t *)addr)));
2N/A break;
2N/A case 4:
2N/A jobj = (*jenv)->NewObject(jenv, g_int_jc,
2N/A /* LINTED - alignment */
2N/A g_intinit_jm, *((int32_t *)addr));
2N/A break;
2N/A case 8:
2N/A jobj = (*jenv)->NewObject(jenv, g_long_jc,
2N/A /* LINTED - alignment */
2N/A g_longinit_jm, *((int64_t *)addr));
2N/A break;
2N/A default:
2N/A jobj = dtj_bytedata(jenv, size, addr);
2N/A break;
2N/A }
2N/A
2N/A if (!jobj) {
2N/A return (NULL); /* OutOfMemoryError pending */
2N/A }
2N/A
2N/A jrec = (*jenv)->NewObject(jenv, g_scalar_jc,
2N/A g_scalarinit_jm, jobj, size);
2N/A (*jenv)->DeleteLocalRef(jenv, jobj);
2N/A
2N/A return (jrec);
2N/A}
2N/A
2N/A/*
2N/A * This is the record handling function passed to dtrace_work(). It differs
2N/A * from the bufhandler registered with dtrace_handle_buffered() as follows:
2N/A *
2N/A * 1. It does not have access to libdtrace formatted output.
2N/A * 2. It is called once for every D program statement, not for every
2N/A * output-producing D action or aggregation record. A statement may be a
2N/A * variable assignment, having no size and producing no output.
2N/A * 3. It is called for the D exit() action; the bufhandler is not.
2N/A * 4. In response to the printa() action, it is called with a record having an
2N/A * action of type DTRACEACT_PRINTA. The bufhandler never sees that action
2N/A * value. It only sees the output-producing aggregation records.
2N/A * 5. It is called with a NULL record at the end of each probedata.
2N/A */
2N/Astatic int
2N/Adtj_chewrec(const dtrace_probedata_t *data, const dtrace_recdesc_t *rec,
2N/A void *arg)
2N/A{
2N/A dtj_java_consumer_t *jc = arg;
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A const dtrace_eprobedesc_t *edesc = data->dtpda_edesc;
2N/A dtrace_actkind_t act;
2N/A int r;
2N/A
2N/A /*
2N/A * Update the record index to that of the current record, or to that of
2N/A * the last record if rec is NULL (signalling end of probe data).
2N/A */
2N/A if (rec == NULL) {
2N/A r = edesc->dtepd_nrecs; /* end of probe data */
2N/A } else {
2N/A /*
2N/A * This record handler is called once for the printf() action,
2N/A * but there may be multiple records in the probedata
2N/A * corresponding to the unformatted elements of that printf().
2N/A * We don't know ahead of time how many probedata records
2N/A * libdtrace will consume to produce output for one printf()
2N/A * action, so we look back at the previous call to dtj_chewrec()
2N/A * to see how many probedata records were consumed. All
2N/A * non-null elements in the range from the previous record index
2N/A * up to and not including the current record index are assumed
2N/A * to be unformatted printf() elements, and will be attached to
2N/A * the PrintfRecord from the previous call. A null element in
2N/A * that range is the result of a D program statement preceding
2N/A * the printf() that is not a D action. These generate
2N/A * probedata records accounted for by the null placeholder, but
2N/A * do not advance the probedata offset and are not part of the
2N/A * subsequent printf().
2N/A *
2N/A * If rec->dtrd_size == 0, the record represents a D program
2N/A * statement that is not a D action. It has no size and does
2N/A * not advance the offset in the probedata. Handle it normally
2N/A * without special-casing or premature return, since in all
2N/A * cases we look at the previous record later in this function.
2N/A */
2N/A for (r = jc->dtjj_consumer->dtjc_probedata_rec_i;
2N/A ((r < edesc->dtepd_nrecs) &&
2N/A (edesc->dtepd_rec[r].dtrd_offset < rec->dtrd_offset));
2N/A ++r) {
2N/A }
2N/A }
2N/A
2N/A /*
2N/A * Attach the Java representations of the libdtrace data elements
2N/A * pertaining to the previous call to this record handler to the
2N/A * previous Java Record. (All data elements belonging to the current
2N/A * probedata are added to a single list by the probedata consumer
2N/A * function dtj_chew() before this record consumer function is ever
2N/A * called.) For example, if the previous Record was generated by the
2N/A * printf() action, and dtj_chew() listed 3 records for its 3
2N/A * unformatted elements, those 3 libdtrace records comprise 1
2N/A * PrintfRecord. Note that we cannot know how many data elements apply
2N/A * to the current rec until we find out the data index where the next
2N/A * rec starts. (The knowledge of how many probedata records to consume
2N/A * is private to libdtrace.)
2N/A */
2N/A if (jc->dtjj_consumer->dtjc_probedata_act == DTRACEACT_PRINTF) {
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdataattach_jm,
2N/A jc->dtjj_consumer->dtjc_probedata_rec_i, r - 1);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A }
2N/A
2N/A if (rec == NULL) {
2N/A /*
2N/A * End of probe data. Notify listeners of the new ProbeData
2N/A * instance.
2N/A */
2N/A if (jc->dtjj_probedata) {
2N/A /* previous probedata */
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdataclear_jm);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_caller,
2N/A g_pdatanext_jm, jc->dtjj_probedata);
2N/A (*jenv)->DeleteLocalRef(jenv, jc->dtjj_probedata);
2N/A jc->dtjj_probedata = NULL;
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A /*
2N/A * Do not wrap exception thrown from
2N/A * ConsumerListener.
2N/A */
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A }
2N/A (*jenv)->DeleteLocalRef(jenv, jc->dtjj_printa_buffer);
2N/A jc->dtjj_printa_buffer = NULL;
2N/A return (DTRACE_CONSUME_NEXT);
2N/A }
2N/A
2N/A act = rec->dtrd_action;
2N/A
2N/A /* Set previous record action and data index to current */
2N/A jc->dtjj_consumer->dtjc_probedata_act = act;
2N/A jc->dtjj_consumer->dtjc_probedata_rec_i = r;
2N/A
2N/A switch (act) {
2N/A case DTRACEACT_DIFEXPR:
2N/A if (rec->dtrd_size == 0) {
2N/A /*
2N/A * The current record is not a D action, but a program
2N/A * statement such as a variable assignment, not to be
2N/A * confused with the trace() action.
2N/A */
2N/A break;
2N/A }
2N/A /*
2N/A * Add a Record for the trace() action that references the
2N/A * native probedata element listed at the current index.
2N/A */
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdataadd_trace_jm,
2N/A jc->dtjj_consumer->dtjc_probedata_rec_i);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A break;
2N/A case DTRACEACT_PRINTF:
2N/A /*
2N/A * Just add an empty PrintfRecord for now. We'll attach the
2N/A * unformatted elements in a subsequent call to this function.
2N/A * (We don't know how many there will be.)
2N/A */
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdataadd_printf_jm);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A /* defer formatted string to dtj_bufhandler() */
2N/A break;
2N/A case DTRACEACT_PRINTA: {
2N/A jobject jbuf = NULL;
2N/A
2N/A dtj_aggwalk_init(jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdataadd_printa_jm,
2N/A jc->dtjj_consumer->dtjc_printa_snaptime,
2N/A (rec->dtrd_format != 0));
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A if (jc->dtjj_printa_buffer == NULL) {
2N/A /*
2N/A * Create a StringBuilder to collect the pieces of
2N/A * formatted output into a single String.
2N/A */
2N/A jbuf = (*jenv)->NewObject(jenv, g_buf_jc,
2N/A g_bufinit_jm);
2N/A if (!jbuf) {
2N/A /* OutOfMemoryError pending */
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A jc->dtjj_printa_buffer = jbuf;
2N/A }
2N/A /* defer aggregation records to dtj_bufhandler() */
2N/A break;
2N/A }
2N/A case DTRACEACT_EXIT:
2N/A /*
2N/A * Add a Record for the exit() action that references the native
2N/A * probedata element listed at the current index.
2N/A */
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdataadd_exit_jm,
2N/A jc->dtjj_consumer->dtjc_probedata_rec_i);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A return (DTRACE_CONSUME_NEXT);
2N/A }
2N/A
2N/A return (DTRACE_CONSUME_THIS);
2N/A}
2N/A
2N/A/*
2N/A * This is the probe handling function passed to dtrace_work(). It is is called
2N/A * once every time a probe fires. It is the first of all the callbacks for the
2N/A * current probe. It is followed by multiple callbacks to dtj_chewrec(), one
2N/A * for each probedata record. Each call to dtj_chewrec() is followed by zero or
2N/A * more callbacks to the bufhandler, one for each output-producing action or
2N/A * aggregation record.
2N/A */
2N/Astatic int
2N/Adtj_chew(const dtrace_probedata_t *data, void *arg)
2N/A{
2N/A dtj_java_consumer_t *jc = arg;
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A dtrace_eprobedesc_t *edesc;
2N/A dtrace_probedesc_t *pdesc;
2N/A dtrace_recdesc_t *rec;
2N/A int epid;
2N/A int cpu;
2N/A int nrecs;
2N/A int i;
2N/A
2N/A jobject jpdata = NULL;
2N/A jobject jprobe = NULL;
2N/A jobject jflow = NULL;
2N/A jstring jflowkind = NULL;
2N/A jobject jobj = NULL;
2N/A
2N/A edesc = data->dtpda_edesc;
2N/A epid = (int)edesc->dtepd_epid;
2N/A pdesc = data->dtpda_pdesc;
2N/A cpu = (int)data->dtpda_cpu;
2N/A if ((jprobe = dtj_new_probedesc(jc, pdesc)) == NULL) {
2N/A /* java exception pending */
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A nrecs = edesc->dtepd_nrecs;
2N/A
2N/A if (jc->dtjj_consumer->dtjc_flow) {
2N/A const char *kind;
2N/A switch (data->dtpda_flow) {
2N/A case DTRACEFLOW_ENTRY:
2N/A kind = "ENTRY";
2N/A break;
2N/A case DTRACEFLOW_RETURN:
2N/A kind = "RETURN";
2N/A break;
2N/A case DTRACEFLOW_NONE:
2N/A kind = "NONE";
2N/A break;
2N/A default:
2N/A kind = NULL;
2N/A }
2N/A if (kind != NULL) {
2N/A int depth;
2N/A jflowkind = (*jenv)->NewStringUTF(jenv, kind);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A (*jenv)->DeleteLocalRef(jenv, jprobe);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A /*
2N/A * Use the knowledge that libdtrace indents 2 spaces per
2N/A * level in the call stack to calculate the depth.
2N/A */
2N/A depth = (data->dtpda_indent / 2);
2N/A jflow = (*jenv)->NewObject(jenv, g_flow_jc,
2N/A g_flowinit_jm, jflowkind, depth);
2N/A (*jenv)->DeleteLocalRef(jenv, jflowkind);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A (*jenv)->DeleteLocalRef(jenv, jprobe);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A }
2N/A }
2N/A
2N/A /* Create ProbeData instance */
2N/A jpdata = (*jenv)->NewObject(jenv, g_pdata_jc, g_pdatainit_jm,
2N/A epid, cpu, jprobe, jflow, nrecs);
2N/A (*jenv)->DeleteLocalRef(jenv, jprobe);
2N/A (*jenv)->DeleteLocalRef(jenv, jflow);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A
2N/A /*
2N/A * Populate the ProbeData list of Java data elements in advance so we
2N/A * don't need to peek back in the record handler at libdtrace records
2N/A * that have already been consumed. In the Java API, each ProbeData
2N/A * Record is generated by one D action, while in the native libdtrace
2N/A * there may be more than one probedata record (each a single data
2N/A * element) per D action. For example PrintfRecord has multiple
2N/A * unformatted elements, each represented by a native probedata record,
2N/A * but combined by the API into a single PrintfRecord.
2N/A */
2N/A for (i = 0; i < nrecs; ++i) {
2N/A rec = &edesc->dtepd_rec[i];
2N/A /*
2N/A * A statement that is not a D action, such as assignment to a
2N/A * variable, has no size. Add a NULL placeholder to the scratch
2N/A * list of Java probedata elements in that case.
2N/A */
2N/A jobj = NULL; /* initialize object reference to null */
2N/A if (rec->dtrd_size > 0) {
2N/A if (dtj_is_stack_action(rec->dtrd_action)) {
2N/A jobj = dtj_new_probedata_stack_record(data,
2N/A rec, jc);
2N/A } else if (dtj_is_symbol_action(rec->dtrd_action)) {
2N/A jobj = dtj_new_probedata_symbol_record(data,
2N/A rec, jc);
2N/A } else {
2N/A jobj = dtj_recdata(jc, rec->dtrd_size,
2N/A (data->dtpda_data + rec->dtrd_offset));
2N/A }
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A (*jenv)->DeleteLocalRef(jenv, jpdata);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A }
2N/A
2N/A (*jenv)->CallVoidMethod(jenv, jpdata, g_pdataadd_jm, jobj);
2N/A (*jenv)->DeleteLocalRef(jenv, jobj);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A (*jenv)->DeleteLocalRef(jenv, jpdata);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A }
2N/A
2N/A if (jc->dtjj_probedata != NULL) {
2N/A dtj_throw_illegal_state(jenv, "unfinished probedata");
2N/A WRAP_EXCEPTION(jenv);
2N/A (*jenv)->DeleteLocalRef(jenv, jpdata);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A jc->dtjj_probedata = jpdata;
2N/A
2N/A /* Initialize per-consumer probedata fields */
2N/A jc->dtjj_consumer->dtjc_probedata_rec_i = 0;
2N/A jc->dtjj_consumer->dtjc_probedata_act = DTRACEACT_NONE;
2N/A dtj_aggwalk_init(jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_CONSUME_ABORT);
2N/A }
2N/A
2N/A return (DTRACE_CONSUME_THIS);
2N/A}
2N/A
2N/A/*
2N/A * This is the buffered output handler registered with dtrace_handle_buffered().
2N/A * It's purpose is to make the output of the libdtrace print routines available
2N/A * to this API, without writing any of it to a file (such as stdout). This is
2N/A * needed for the stack(), ustack(), and jstack() actions to get human-readable
2N/A * stack values, since there is no public function in libdtrace to convert stack
2N/A * values to strings. It is also used to get the formatted output of the D
2N/A * printf() and printa() actions.
2N/A *
2N/A * The bufhandler is called once for each output-producing, non-aggregating D
2N/A * action, such as trace() or printf(), and once for each libdtrace aggregation
2N/A * record (whether in response to the D printa() action, or the Consumer
2N/A * getAggregate() method). In the simple printa() case that takes one
2N/A * aggregation and does not specify a format string, there is one libdtrace
2N/A * record per tuple element plus one for the corresponding value. The complete
2N/A * tuple/value pair becomes a single AggregationRecord exported by the API.
2N/A * When multiple aggregations are passed to printa(), each tuple is associated
2N/A * with a list of values, one from each aggregation. If a printa() format
2N/A * string does not specify placeholders for every aggregation value and tuple
2N/A * member, callbacks for those values and tuple members are omitted (and the
2N/A * data is omitted from the resulting PrintaRecord).
2N/A *
2N/A * Notes to characterize some non-obvious bufhandler behavior:
2N/A *
2N/A * 1. dtj_bufhandler() is never called with bufdata->dtbda_recdesc->dtrd_action
2N/A * DTRACEACT_PRINTA. That action only appears in the probedata consumer
2N/A * functions dtj_chew() and dtj_chewrec() before the bufhandler is called with
2N/A * subsequent aggregation records.
2N/A *
2N/A * 2. If printa() specifies a format string argument, then the bufhandler is
2N/A * called only for those elements of the tuple/value pair that are included in
2N/A * the format string. If a stack() tuple member is omitted from the format
2N/A * string, its human-readable representation will not be available to this API,
2N/A * so the stack frame array is also omitted from the resulting
2N/A * AggregationRecord. The bufhandler is also called once for each string of
2N/A * characters surrounding printa() format string placeholders. For example,
2N/A * " %@d %d stack%k\n" results in the following callbacks:
2N/A * - two spaces
2N/A * - the aggregation value
2N/A * - a single space
2N/A * - the first tuple member (an integer)
2N/A * - " stack"
2N/A * - the second tuple member (a stack)
2N/A * - a newline
2N/A * A NULL record (NULL dtbda_recdesc) distinguishes a callback with interstitial
2N/A * format string characters from a callback with a tuple member or aggregation
2N/A * value (which has a non-NULL recdesc). The contents are also distinguished by
2N/A * the following flags:
2N/A * DTRACE_BUFDATA_AGGKEY
2N/A * DTRACE_BUFDATA_AGGVAL
2N/A * DTRACE_BUFDATA_AGGFORMAT
2N/A * DTRACE_BUFDATA_AGGLAST
2N/A *
2N/A * There is no final callback with the complete formatted string, so that must
2N/A * be concatenated across multiple callbacks to the bufhandler.
2N/A *
2N/A * 3. bufdata->dtbda_probe->dtpda_data may be overwritten by libdtrace print
2N/A * routines. The address is cached in the dtj_chew() function in case it is
2N/A * needed in the bufhandler.
2N/A */
2N/Astatic int
2N/A/* ARGSUSED */
2N/Adtj_bufhandler(const dtrace_bufdata_t *bufdata, void *arg)
2N/A{
2N/A dtj_java_consumer_t *jc;
2N/A JNIEnv *jenv;
2N/A const dtrace_recdesc_t *rec;
2N/A dtrace_actkind_t act = DTRACEACT_NONE;
2N/A const char *s;
2N/A
2N/A jobject jstr = NULL;
2N/A
2N/A /*
2N/A * Get the thread-specific java consumer. The bufhandler needs access
2N/A * to the correct JNI state specific to either the consumer loop or the
2N/A * getAggregate() call (aggregation snapshots can be requested
2N/A * asynchronously while the consumer loop generates PrintaRecords in
2N/A * dtrace_work() for ConsumerListeners).
2N/A */
2N/A jc = pthread_getspecific(g_dtj_consumer_key);
2N/A jenv = jc->dtjj_jenv;
2N/A
2N/A /*
2N/A * In at least one corner case (printa with multiple aggregations and a
2N/A * format string that does not completely specify the tuple), returning
2N/A * DTRACE_HANDLE_ABORT does not prevent a subsequent callback to this
2N/A * bufhandler. This check ensures that the invalid call is ignored.
2N/A */
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A
2N/A if (bufdata->dtbda_aggdata) {
2N/A return (dtj_agghandler(bufdata, jc));
2N/A }
2N/A
2N/A s = bufdata->dtbda_buffered;
2N/A if (s == NULL) {
2N/A return (DTRACE_HANDLE_OK);
2N/A }
2N/A
2N/A rec = bufdata->dtbda_recdesc;
2N/A if (rec) {
2N/A act = rec->dtrd_action;
2N/A }
2N/A
2N/A switch (act) {
2N/A case DTRACEACT_DIFEXPR:
2N/A /* trace() action */
2N/A break;
2N/A case DTRACEACT_PRINTF:
2N/A /*
2N/A * Only the formatted string was not available to dtj_chewrec(),
2N/A * so we attach that now.
2N/A */
2N/A jstr = dtj_NewStringNative(jenv, s);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdataset_formatted_jm, jstr);
2N/A (*jenv)->DeleteLocalRef(jenv, jstr);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A break;
2N/A case DTRACEACT_STACK:
2N/A case DTRACEACT_USTACK:
2N/A case DTRACEACT_JSTACK:
2N/A /* stand-alone stack(), ustack(), or jstack() action */
2N/A jstr = (*jenv)->NewStringUTF(jenv, s);
2N/A if (!jstr) {
2N/A /* OutOfMemoryError pending */
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdataadd_stack_jm,
2N/A jc->dtjj_consumer->dtjc_probedata_rec_i, jstr);
2N/A (*jenv)->DeleteLocalRef(jenv, jstr);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A break;
2N/A case DTRACEACT_USYM:
2N/A case DTRACEACT_UADDR:
2N/A case DTRACEACT_UMOD:
2N/A case DTRACEACT_SYM:
2N/A case DTRACEACT_MOD:
2N/A /* stand-alone symbol lookup action */
2N/A jstr = (*jenv)->NewStringUTF(jenv, s);
2N/A if (!jstr) {
2N/A /* OutOfMemoryError pending */
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdataadd_symbol_jm,
2N/A jc->dtjj_consumer->dtjc_probedata_rec_i, jstr);
2N/A (*jenv)->DeleteLocalRef(jenv, jstr);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A break;
2N/A default:
2N/A /*
2N/A * The record handler dtj_chewrec() defers nothing else to this
2N/A * bufhandler.
2N/A */
2N/A break;
2N/A }
2N/A
2N/A return (DTRACE_HANDLE_OK);
2N/A}
2N/A
2N/Astatic boolean_t
2N/Adtj_is_stack_action(dtrace_actkind_t act)
2N/A{
2N/A boolean_t stack_action;
2N/A switch (act) {
2N/A case DTRACEACT_STACK:
2N/A case DTRACEACT_USTACK:
2N/A case DTRACEACT_JSTACK:
2N/A stack_action = B_TRUE;
2N/A break;
2N/A default:
2N/A stack_action = B_FALSE;
2N/A }
2N/A return (stack_action);
2N/A}
2N/A
2N/Astatic boolean_t
2N/Adtj_is_symbol_action(dtrace_actkind_t act)
2N/A{
2N/A boolean_t symbol_action;
2N/A switch (act) {
2N/A case DTRACEACT_USYM:
2N/A case DTRACEACT_UADDR:
2N/A case DTRACEACT_UMOD:
2N/A case DTRACEACT_SYM:
2N/A case DTRACEACT_MOD:
2N/A symbol_action = B_TRUE;
2N/A break;
2N/A default:
2N/A symbol_action = B_FALSE;
2N/A }
2N/A return (symbol_action);
2N/A}
2N/A
2N/A/*
2N/A * Called by get_aggregate() to clear only those aggregations specified by the
2N/A * caller.
2N/A */
2N/Astatic int
2N/Adtj_clear(const dtrace_aggdata_t *data, void *arg)
2N/A{
2N/A dtj_java_consumer_t *jc = arg;
2N/A jboolean cleared = JNI_FALSE;
2N/A
2N/A jstring jname = NULL;
2N/A
2N/A if (jc->dtjj_aggregate_spec) {
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A dtrace_aggdesc_t *aggdesc = data->dtada_desc;
2N/A
2N/A jname = (*jenv)->NewStringUTF(jenv, aggdesc->dtagd_name);
2N/A if (!jname) {
2N/A /* java exception pending */
2N/A return (DTRACE_AGGWALK_ABORT);
2N/A }
2N/A
2N/A cleared = (*jenv)->CallBooleanMethod(jenv,
2N/A jc->dtjj_aggregate_spec, g_aggspec_cleared_jm, jname);
2N/A (*jenv)->DeleteLocalRef(jenv, jname);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_AGGWALK_ABORT);
2N/A }
2N/A }
2N/A
2N/A return (cleared ? DTRACE_AGGWALK_CLEAR : DTRACE_AGGWALK_NEXT);
2N/A}
2N/A
2N/Astatic int64_t
2N/Adtj_average(caddr_t addr, uint64_t normal)
2N/A{
2N/A /* LINTED - alignment */
2N/A int64_t *data = (int64_t *)addr;
2N/A
2N/A return (data[0] ?
2N/A (data[1] / (int64_t)normal / data[0]) : 0);
2N/A}
2N/A
2N/Astatic int64_t
2N/Adtj_avg_total(caddr_t addr, uint64_t normal)
2N/A{
2N/A /* LINTED - alignment */
2N/A int64_t *data = (int64_t *)addr;
2N/A
2N/A return (data[1] / (int64_t)normal);
2N/A}
2N/A
2N/Astatic int64_t
2N/Adtj_avg_count(caddr_t addr)
2N/A{
2N/A /* LINTED - alignment */
2N/A int64_t *data = (int64_t *)addr;
2N/A
2N/A return (data[0]);
2N/A}
2N/A
2N/Astatic jobject
2N/Adtj_stddev_total_squares(JNIEnv *jenv, caddr_t addr, uint64_t normal)
2N/A{
2N/A jobject val128;
2N/A
2N/A /* LINTED - alignment */
2N/A uint64_t *data = (uint64_t *)addr;
2N/A
2N/A if (data[0] == 0) {
2N/A val128 = (*jenv)->CallStaticObjectMethod(jenv, g_bigint_jc,
2N/A g_bigint_val_jsm, (uint64_t)0);
2N/A } else {
2N/A val128 = dtj_int128(jenv, data[3], data[2]);
2N/A
2N/A if (normal != 1) {
2N/A jobject divisor;
2N/A jobject tmp;
2N/A
2N/A divisor = (*jenv)->CallStaticObjectMethod(jenv,
2N/A g_bigint_jc, g_bigint_val_jsm, normal);
2N/A tmp = val128;
2N/A val128 = (*jenv)->CallObjectMethod(jenv, tmp,
2N/A g_bigint_div_jm, divisor);
2N/A (*jenv)->DeleteLocalRef(jenv, tmp);
2N/A (*jenv)->DeleteLocalRef(jenv, divisor);
2N/A }
2N/A }
2N/A
2N/A return (val128);
2N/A}
2N/A
2N/A/*
2N/A * Return NULL if a java exception is pending, otherwise return a new
2N/A * StddevValue instance.
2N/A */
2N/Astatic jobject
2N/Adtj_stddev(JNIEnv *jenv, caddr_t addr, uint64_t normal)
2N/A{
2N/A jobject total_squares;
2N/A jobject stddev;
2N/A
2N/A total_squares = dtj_stddev_total_squares(jenv, addr, normal);
2N/A stddev = (*jenv)->NewObject(jenv, g_aggstddev_jc, g_aggstddevinit_jm,
2N/A dtj_avg_count(addr), dtj_avg_total(addr, normal), total_squares);
2N/A (*jenv)->DeleteLocalRef(jenv, total_squares);
2N/A
2N/A return (stddev);
2N/A}
2N/A
2N/Astatic jobject
2N/Adtj_new_probedata_stack_record(const dtrace_probedata_t *data,
2N/A const dtrace_recdesc_t *rec, dtj_java_consumer_t *jc)
2N/A{
2N/A caddr_t addr;
2N/A
2N/A /* Get raw stack data */
2N/A addr = data->dtpda_data + rec->dtrd_offset;
2N/A return (dtj_new_stack_record(addr, rec, jc));
2N/A}
2N/A
2N/Astatic jobject
2N/Adtj_new_tuple_stack_record(const dtrace_aggdata_t *data,
2N/A const dtrace_recdesc_t *rec, const char *s, dtj_java_consumer_t *jc)
2N/A{
2N/A caddr_t addr;
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A jobjectArray frames = NULL;
2N/A jobject jobj = NULL; /* tuple element */
2N/A jstring jstr = NULL;
2N/A
2N/A /* Get raw stack data */
2N/A addr = data->dtada_data + rec->dtrd_offset;
2N/A jobj = dtj_new_stack_record(addr, rec, jc);
2N/A if (!jobj) {
2N/A return (NULL); /* java exception pending */
2N/A }
2N/A
2N/A jstr = dtj_NewStringNative(jenv, s);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A (*jenv)->DeleteLocalRef(jenv, jobj);
2N/A return (NULL);
2N/A }
2N/A frames = (*jenv)->CallStaticObjectMethod(jenv, g_stack_jc,
2N/A g_parsestack_jsm, jstr);
2N/A (*jenv)->DeleteLocalRef(jenv, jstr);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A (*jenv)->DeleteLocalRef(jenv, jobj);
2N/A return (NULL);
2N/A }
2N/A dtj_attach_frames(jc, jobj, frames);
2N/A (*jenv)->DeleteLocalRef(jenv, frames);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (NULL);
2N/A }
2N/A
2N/A return (jobj);
2N/A}
2N/A
2N/Astatic jobject
2N/Adtj_new_probedata_symbol_record(const dtrace_probedata_t *data,
2N/A const dtrace_recdesc_t *rec, dtj_java_consumer_t *jc)
2N/A{
2N/A caddr_t addr;
2N/A
2N/A addr = data->dtpda_data + rec->dtrd_offset;
2N/A return (dtj_new_symbol_record(addr, rec, jc));
2N/A}
2N/A
2N/Astatic jobject
2N/Adtj_new_tuple_symbol_record(const dtrace_aggdata_t *data,
2N/A const dtrace_recdesc_t *rec, const char *s, dtj_java_consumer_t *jc)
2N/A{
2N/A caddr_t addr;
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A jobject jobj = NULL; /* tuple element */
2N/A jstring jstr = NULL; /* lookup value */
2N/A jstring tstr = NULL; /* trimmed lookup value */
2N/A
2N/A addr = data->dtada_data + rec->dtrd_offset;
2N/A jobj = dtj_new_symbol_record(addr, rec, jc);
2N/A if (!jobj) {
2N/A return (NULL); /* java exception pending */
2N/A }
2N/A
2N/A /* Get symbol lookup */
2N/A jstr = (*jenv)->NewStringUTF(jenv, s);
2N/A if (!jstr) {
2N/A /* OutOfMemoryError pending */
2N/A (*jenv)->DeleteLocalRef(jenv, jobj);
2N/A return (NULL);
2N/A }
2N/A /* Trim leading and trailing whitespace */
2N/A tstr = (*jenv)->CallObjectMethod(jenv, jstr, g_trim_jm);
2N/A /* trim() returns a new string; don't leak the old one */
2N/A (*jenv)->DeleteLocalRef(jenv, jstr);
2N/A jstr = tstr;
2N/A tstr = NULL;
2N/A
2N/A dtj_attach_name(jc, jobj, jstr);
2N/A (*jenv)->DeleteLocalRef(jenv, jstr);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (NULL);
2N/A }
2N/A
2N/A return (jobj);
2N/A}
2N/A
2N/A/* Caller must be holding per-consumer lock */
2N/Astatic void
2N/Adtj_aggwalk_init(dtj_java_consumer_t *jc)
2N/A{
2N/A jc->dtjj_consumer->dtjc_aggid = -1;
2N/A jc->dtjj_consumer->dtjc_expected = -1;
2N/A if (jc->dtjj_tuple != NULL) {
2N/A /* assert without crashing */
2N/A dtj_throw_illegal_state(jc->dtjj_jenv,
2N/A "stale aggregation tuple");
2N/A }
2N/A}
2N/A
2N/Astatic jobject
2N/Adtj_new_stack_record(const caddr_t addr, const dtrace_recdesc_t *rec,
2N/A dtj_java_consumer_t *jc)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A dtrace_actkind_t act;
2N/A uint64_t *pc;
2N/A pid_t pid = -1;
2N/A int size; /* size of raw bytes not including trailing zeros */
2N/A int i; /* index of last non-zero byte */
2N/A
2N/A jbyteArray raw = NULL;
2N/A jobject stack = NULL; /* return value */
2N/A
2N/A /* trim trailing zeros */
2N/A for (i = rec->dtrd_size - 1; (i >= 0) && !addr[i]; --i) {
2N/A }
2N/A size = (i + 1);
2N/A raw = (*jenv)->NewByteArray(jenv, size);
2N/A if (!raw) {
2N/A return (NULL); /* OutOfMemoryError pending */
2N/A }
2N/A (*jenv)->SetByteArrayRegion(jenv, raw, 0, size,
2N/A (const jbyte *)addr);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A (*jenv)->DeleteLocalRef(jenv, raw);
2N/A return (NULL);
2N/A }
2N/A
2N/A /* Create StackValueRecord instance from raw stack data */
2N/A act = rec->dtrd_action;
2N/A switch (act) {
2N/A case DTRACEACT_STACK:
2N/A stack = (*jenv)->NewObject(jenv, g_stack_jc,
2N/A g_stackinit_jm, raw);
2N/A break;
2N/A case DTRACEACT_USTACK:
2N/A case DTRACEACT_JSTACK:
2N/A /* Get pid of user process */
2N/A pc = (uint64_t *)(uintptr_t)addr;
2N/A pid = (pid_t)*pc;
2N/A stack = (*jenv)->NewObject(jenv, g_ustack_jc,
2N/A g_ustackinit_jm, pid, raw);
2N/A break;
2N/A default:
2N/A dtj_throw_illegal_argument(jenv,
2N/A "Expected stack action, got %d\n", act);
2N/A }
2N/A (*jenv)->DeleteLocalRef(jenv, raw);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (NULL);
2N/A }
2N/A return (stack);
2N/A}
2N/A
2N/Astatic jobject
2N/Adtj_new_symbol_record(const caddr_t addr, const dtrace_recdesc_t *rec,
2N/A dtj_java_consumer_t *jc)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A dtrace_actkind_t act;
2N/A uint64_t *pc;
2N/A pid_t pid = -1;
2N/A
2N/A jobject symbol = NULL; /* return value */
2N/A
2N/A act = rec->dtrd_action;
2N/A switch (act) {
2N/A case DTRACEACT_SYM:
2N/A case DTRACEACT_MOD:
2N/A /* LINTED - alignment */
2N/A pc = (uint64_t *)addr;
2N/A symbol = (*jenv)->NewObject(jenv, g_symbol_jc,
2N/A g_symbolinit_jm, *pc);
2N/A break;
2N/A case DTRACEACT_USYM:
2N/A case DTRACEACT_UADDR:
2N/A case DTRACEACT_UMOD:
2N/A /* Get pid of user process */
2N/A pc = (uint64_t *)(uintptr_t)addr;
2N/A pid = (pid_t)*pc;
2N/A ++pc;
2N/A symbol = (*jenv)->NewObject(jenv, g_usymbol_jc,
2N/A g_usymbolinit_jm, pid, *pc);
2N/A break;
2N/A default:
2N/A dtj_throw_illegal_argument(jenv,
2N/A "Expected stack action, got %d\n", act);
2N/A }
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (NULL);
2N/A }
2N/A return (symbol);
2N/A}
2N/A
2N/A/*
2N/A * Return NULL if java exception pending, otherwise return Distribution value.
2N/A */
2N/Astatic jobject
2N/Adtj_new_distribution(const dtrace_aggdata_t *data, const dtrace_recdesc_t *rec,
2N/A dtj_java_consumer_t *jc)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A jlongArray jbuckets = NULL;
2N/A jobject jdist = NULL; /* return value */
2N/A
2N/A dtrace_actkind_t act = rec->dtrd_action;
2N/A /* LINTED - alignment */
2N/A int64_t *aggbuckets = (int64_t *)
2N/A (data->dtada_data + rec->dtrd_offset);
2N/A size_t size = rec->dtrd_size;
2N/A int64_t value;
2N/A uint64_t normal = data->dtada_normal;
2N/A int64_t base, step;
2N/A int levels;
2N/A int n; /* number of buckets */
2N/A
2N/A /* distribution */
2N/A if (act == DTRACEAGG_LQUANTIZE) {
2N/A /* first "bucket" used for range and step */
2N/A value = *aggbuckets++;
2N/A base = DTRACE_LQUANTIZE_BASE(value);
2N/A step = DTRACE_LQUANTIZE_STEP(value);
2N/A levels = DTRACE_LQUANTIZE_LEVELS(value);
2N/A size -= sizeof (int64_t); /* exclude non-bucket */
2N/A /*
2N/A * Add one for the base bucket and one for the bucket of values
2N/A * less than the base.
2N/A */
2N/A n = levels + 2;
2N/A } else {
2N/A n = DTRACE_QUANTIZE_NBUCKETS;
2N/A levels = n - 1; /* levels excludes base */
2N/A }
2N/A if (size != (n * sizeof (uint64_t)) || n < 1) {
2N/A dtj_throw_illegal_state(jenv,
2N/A "size mismatch: record %d, buckets %d", size,
2N/A (n * sizeof (uint64_t)));
2N/A WRAP_EXCEPTION(jenv);
2N/A return (NULL);
2N/A }
2N/A
2N/A jbuckets = (*jenv)->NewLongArray(jenv, n);
2N/A if (!jbuckets) {
2N/A return (NULL); /* exception pending */
2N/A }
2N/A if (n > 0) {
2N/A (*jenv)->SetLongArrayRegion(jenv, jbuckets, 0, n, aggbuckets);
2N/A /* check for ArrayIndexOutOfBounds */
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A (*jenv)->DeleteLocalRef(jenv, jbuckets);
2N/A return (NULL);
2N/A }
2N/A }
2N/A
2N/A if (act == DTRACEAGG_LQUANTIZE) {
2N/A /* Must pass 64-bit base and step or constructor gets junk. */
2N/A jdist = (*jenv)->NewObject(jenv, g_ldist_jc, g_ldistinit_jm,
2N/A base, step, jbuckets);
2N/A } else {
2N/A jdist = (*jenv)->NewObject(jenv, g_dist_jc, g_distinit_jm,
2N/A jbuckets);
2N/A }
2N/A
2N/A (*jenv)->DeleteLocalRef(jenv, jbuckets);
2N/A if (!jdist) {
2N/A return (NULL); /* exception pending */
2N/A }
2N/A
2N/A if (normal != 1) {
2N/A (*jenv)->CallVoidMethod(jenv, jdist, g_dist_normal_jm, normal);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A (*jenv)->DeleteLocalRef(jenv, jdist);
2N/A return (NULL);
2N/A }
2N/A }
2N/A return (jdist);
2N/A}
2N/A
2N/Astatic void
2N/Adtj_attach_frames(dtj_java_consumer_t *jc, jobject stack,
2N/A jobjectArray frames)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A if ((*jenv)->IsInstanceOf(jenv, stack, g_stack_jc)) {
2N/A (*jenv)->CallVoidMethod(jenv, stack, g_stackset_frames_jm,
2N/A frames);
2N/A } else if ((*jenv)->IsInstanceOf(jenv, stack, g_ustack_jc)) {
2N/A (*jenv)->CallVoidMethod(jenv, stack, g_ustackset_frames_jm,
2N/A frames);
2N/A }
2N/A}
2N/A
2N/Astatic void
2N/Adtj_attach_name(dtj_java_consumer_t *jc, jobject symbol, jstring s)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A if ((*jenv)->IsInstanceOf(jenv, symbol, g_symbol_jc)) {
2N/A (*jenv)->CallVoidMethod(jenv, symbol, g_symbolset_name_jm, s);
2N/A } else if ((*jenv)->IsInstanceOf(jenv, symbol, g_usymbol_jc)) {
2N/A (*jenv)->CallVoidMethod(jenv, symbol, g_usymbolset_name_jm, s);
2N/A }
2N/A}
2N/A
2N/A/*
2N/A * Note: It is not valid to look outside the current libdtrace record in the
2N/A * given aggdata (except to get the aggregation ID from the first record).
2N/A *
2N/A * Return DTRACE_HANDLE_ABORT if java exception pending, otherwise
2N/A * DTRACE_HANDLE_OK.
2N/A */
2N/Astatic int
2N/Adtj_agghandler(const dtrace_bufdata_t *bufdata, dtj_java_consumer_t *jc)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A const dtrace_aggdata_t *aggdata = bufdata->dtbda_aggdata;
2N/A const dtrace_aggdesc_t *aggdesc;
2N/A const dtrace_recdesc_t *rec = bufdata->dtbda_recdesc;
2N/A const char *s = bufdata->dtbda_buffered;
2N/A dtrace_actkind_t act = DTRACEACT_NONE;
2N/A int64_t aggid;
2N/A
2N/A jobject jobj = NULL;
2N/A
2N/A if (aggdata == NULL) {
2N/A /* Assert without crashing */
2N/A dtj_throw_illegal_state(jenv, "null aggdata");
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A aggdesc = aggdata->dtada_desc;
2N/A
2N/A /*
2N/A * Get the aggregation ID from the first record.
2N/A */
2N/A /* LINTED - alignment */
2N/A aggid = *((int64_t *)(aggdata->dtada_data +
2N/A aggdesc->dtagd_rec[0].dtrd_offset));
2N/A if (aggid < 0) {
2N/A /* Assert without crashing */
2N/A dtj_throw_illegal_argument(jenv, "negative aggregation ID");
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A
2N/A if (jc->dtjj_consumer->dtjc_printa_snaptime) {
2N/A /* Append buffered output if this is a printa() callback. */
2N/A jstring jstr = dtj_NewStringNative(jenv, s);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A /*
2N/A * StringBuilder append() returns a reference to the
2N/A * StringBuilder; must not leak the returned reference.
2N/A */
2N/A jobj = (*jenv)->CallObjectMethod(jenv,
2N/A jc->dtjj_printa_buffer, g_buf_append_str_jm, jstr);
2N/A (*jenv)->DeleteLocalRef(jenv, jstr);
2N/A (*jenv)->DeleteLocalRef(jenv, jobj);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A } else {
2N/A /*
2N/A * Test whether to include the aggregation if this is a
2N/A * getAggregate() call. Optimization: perform the inclusion
2N/A * test only when the aggregation has changed.
2N/A */
2N/A if (aggid != jc->dtjj_consumer->dtjc_aggid) {
2N/A jc->dtjj_consumer->dtjc_included =
2N/A dtj_is_included(aggdata, jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A }
2N/A if (!jc->dtjj_consumer->dtjc_included) {
2N/A return (DTRACE_HANDLE_OK);
2N/A }
2N/A }
2N/A jc->dtjj_consumer->dtjc_aggid = aggid;
2N/A
2N/A /*
2N/A * Determine the expected number of tuple members. While it is not
2N/A * technically valid to look outside the current record in the current
2N/A * aggdata, this implementation does so without a known failure case.
2N/A * Any method relying only on the current callback record makes riskier
2N/A * assumptions and still does not cover every corner case (for example,
2N/A * counting the records from index 1 up to and not including the index
2N/A * of the current DTRACE_BUFDATA_AGGVAL record, which fails when a
2N/A * format string specifies the value ahead of one or more tuple
2N/A * elements). Knowing that the calculation of the expected tuple size
2N/A * is technically invalid (because it looks outside the current record),
2N/A * we make the calculation at the earliest opportunity, before anything
2N/A * might happen to invalidate any part of the aggdata. It ought to be
2N/A * safe in any case: dtrd_action and dtrd_size do not appear ever to be
2N/A * overwritten, and dtrd_offset is not used outside the current record.
2N/A *
2N/A * It is possible (if the assumptions here ever prove untrue) that the
2N/A * libdtrace buffered output handler may need to be enhanced to provide
2N/A * the expected number of tuple members.
2N/A */
2N/A if (jc->dtjj_consumer->dtjc_expected < 0) {
2N/A int r;
2N/A for (r = 1; r < aggdesc->dtagd_nrecs; ++r) {
2N/A act = aggdesc->dtagd_rec[r].dtrd_action;
2N/A if (DTRACEACT_ISAGG(act) ||
2N/A aggdesc->dtagd_rec[r].dtrd_size == 0) {
2N/A break;
2N/A }
2N/A }
2N/A jc->dtjj_consumer->dtjc_expected = r - 1;
2N/A }
2N/A
2N/A if (bufdata->dtbda_flags & DTRACE_BUFDATA_AGGKEY) {
2N/A /* record value is a tuple member */
2N/A
2N/A if (jc->dtjj_tuple == NULL) {
2N/A jc->dtjj_tuple = (*jenv)->NewObject(jenv,
2N/A g_tuple_jc, g_tupleinit_jm);
2N/A if (!jc->dtjj_tuple) {
2N/A /* java exception pending */
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A }
2N/A
2N/A act = rec->dtrd_action;
2N/A
2N/A switch (act) {
2N/A case DTRACEACT_STACK:
2N/A case DTRACEACT_USTACK:
2N/A case DTRACEACT_JSTACK:
2N/A jobj = dtj_new_tuple_stack_record(aggdata, rec, s, jc);
2N/A break;
2N/A case DTRACEACT_USYM:
2N/A case DTRACEACT_UADDR:
2N/A case DTRACEACT_UMOD:
2N/A case DTRACEACT_SYM:
2N/A case DTRACEACT_MOD:
2N/A jobj = dtj_new_tuple_symbol_record(aggdata, rec, s, jc);
2N/A break;
2N/A default:
2N/A jobj = dtj_recdata(jc, rec->dtrd_size,
2N/A (aggdata->dtada_data + rec->dtrd_offset));
2N/A }
2N/A
2N/A if (!jobj) {
2N/A /* java exception pending */
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_tuple,
2N/A g_tupleadd_jm, jobj);
2N/A (*jenv)->DeleteLocalRef(jenv, jobj);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A } else if (bufdata->dtbda_flags & DTRACE_BUFDATA_AGGVAL) {
2N/A /*
2N/A * Record value is that of an aggregating action. The printa()
2N/A * format string may place the tuple ahead of the aggregation
2N/A * value(s), so we can't be sure we have the tuple until we get
2N/A * the AGGLAST flag indicating the last callback associated with
2N/A * the current tuple. Save the aggregation value or values
2N/A * (multiple values if more than one aggregation is passed to
2N/A * printa()) until then.
2N/A */
2N/A dtj_aggval_t *aggval;
2N/A
2N/A jstring jvalue = NULL;
2N/A
2N/A jvalue = dtj_new_aggval(jc, aggdata, rec);
2N/A if (!jvalue) {
2N/A /* java exception pending */
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A aggval = dtj_aggval_create(jenv, jvalue, aggdesc->dtagd_name,
2N/A aggid);
2N/A if (!aggval) {
2N/A /* OutOfMemoryError pending */
2N/A (*jenv)->DeleteLocalRef(jenv, jvalue);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A if (!dtj_list_add(jc->dtjj_aggval_list, aggval)) {
2N/A /* deletes jvalue reference */
2N/A dtj_aggval_destroy(aggval, jenv);
2N/A dtj_throw_out_of_memory(jenv, "Failed to add aggval");
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A }
2N/A
2N/A if (bufdata->dtbda_flags & DTRACE_BUFDATA_AGGLAST) {
2N/A /* No more values associated with the current tuple. */
2N/A
2N/A dtj_aggval_t *aggval;
2N/A uu_list_walk_t *itr;
2N/A int tuple_member_count;
2N/A
2N/A jobject jrec = NULL;
2N/A jstring jname = NULL;
2N/A
2N/A if (jc->dtjj_consumer->dtjc_expected == 0) {
2N/A /*
2N/A * singleton aggregation declared in D with no square
2N/A * brackets
2N/A */
2N/A jc->dtjj_tuple = (*jenv)->GetStaticObjectField(jenv,
2N/A g_tuple_jc, g_tuple_EMPTY_jsf);
2N/A if (jc->dtjj_tuple == NULL) {
2N/A dtj_throw_out_of_memory(jenv,
2N/A "Failed to reference Tuple.EMPTY");
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A }
2N/A
2N/A if (jc->dtjj_tuple == NULL) {
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdatainvalidate_printa_jm);
2N/A goto printa_output;
2N/A }
2N/A
2N/A tuple_member_count = (*jenv)->CallIntMethod(jenv,
2N/A jc->dtjj_tuple, g_tuplesize_jm);
2N/A if (tuple_member_count <
2N/A jc->dtjj_consumer->dtjc_expected) {
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdatainvalidate_printa_jm);
2N/A (*jenv)->DeleteLocalRef(jenv, jc->dtjj_tuple);
2N/A jc->dtjj_tuple = NULL;
2N/A goto printa_output;
2N/A }
2N/A
2N/A itr = uu_list_walk_start(jc->dtjj_aggval_list, 0);
2N/A while ((aggval = uu_list_walk_next(itr)) != NULL) {
2N/A /*
2N/A * new AggregationRecord: Combine the aggregation value
2N/A * with the saved tuple and add it to the current
2N/A * Aggregate or PrintaRecord.
2N/A */
2N/A jrec = (*jenv)->NewObject(jenv, g_aggrec_jc,
2N/A g_aggrecinit_jm, jc->dtjj_tuple,
2N/A aggval->dtja_value);
2N/A (*jenv)->DeleteLocalRef(jenv, aggval->dtja_value);
2N/A aggval->dtja_value = NULL;
2N/A if (!jrec) {
2N/A /* java exception pending */
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A
2N/A /* aggregation name */
2N/A jname = (*jenv)->NewStringUTF(jenv,
2N/A aggval->dtja_aggname);
2N/A if (!jname) {
2N/A /* OutOfMemoryError pending */
2N/A (*jenv)->DeleteLocalRef(jenv, jrec);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A
2N/A /*
2N/A * If the printa() format string specifies the value of
2N/A * the aggregating action multiple times, PrintaRecord
2N/A * ignores the attempt to add the duplicate record.
2N/A */
2N/A if (jc->dtjj_consumer->dtjc_printa_snaptime) {
2N/A /* add to PrintaRecord */
2N/A (*jenv)->CallVoidMethod(jenv,
2N/A jc->dtjj_probedata,
2N/A g_pdataadd_aggrec_jm,
2N/A jname, aggval->dtja_aggid, jrec);
2N/A } else {
2N/A /* add to Aggregate */
2N/A (*jenv)->CallVoidMethod(jenv,
2N/A jc->dtjj_aggregate, g_aggaddrec_jm,
2N/A jname, aggval->dtja_aggid, jrec);
2N/A }
2N/A
2N/A (*jenv)->DeleteLocalRef(jenv, jrec);
2N/A (*jenv)->DeleteLocalRef(jenv, jname);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A }
2N/A uu_list_walk_end(itr);
2N/A dtj_list_clear(jc->dtjj_aggval_list, dtj_aggval_destroy,
2N/A jenv);
2N/A
2N/Aprinta_output:
2N/A if (jc->dtjj_consumer->dtjc_printa_snaptime) {
2N/A /*
2N/A * Get the formatted string associated with the current
2N/A * tuple if this is a printa() callback.
2N/A */
2N/A jstring jstr = (*jenv)->CallObjectMethod(jenv,
2N/A jc->dtjj_printa_buffer, g_tostring_jm);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A /*
2N/A * Clear the StringBuilder: this does not throw
2N/A * exceptions. Reuse the StringBuilder until the end of
2N/A * the current probedata then dispose of it.
2N/A */
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_printa_buffer,
2N/A g_bufsetlen_jm, 0);
2N/A /* Add formatted string to PrintaRecord */
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_probedata,
2N/A g_pdataadd_printa_str_jm, jc->dtjj_tuple, jstr);
2N/A (*jenv)->DeleteLocalRef(jenv, jstr);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTRACE_HANDLE_ABORT);
2N/A }
2N/A }
2N/A
2N/A (*jenv)->DeleteLocalRef(jenv, jc->dtjj_tuple);
2N/A jc->dtjj_tuple = NULL;
2N/A jc->dtjj_consumer->dtjc_expected = -1;
2N/A }
2N/A
2N/A return (DTRACE_HANDLE_OK);
2N/A}
2N/A
2N/A/*
2N/A * Return B_TRUE if the aggregation is included, B_FALSE otherwise. Only in the
2N/A * latter case might there be an exception pending.
2N/A */
2N/Astatic boolean_t
2N/Adtj_is_included(const dtrace_aggdata_t *data, dtj_java_consumer_t *jc)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A if (jc->dtjj_aggregate_spec) {
2N/A jboolean included;
2N/A jstring aggname = NULL;
2N/A
2N/A const dtrace_aggdesc_t *aggdesc = data->dtada_desc;
2N/A aggname = (*jenv)->NewStringUTF(jenv, aggdesc->dtagd_name);
2N/A if (!aggname) {
2N/A /* java exception pending */
2N/A return (B_FALSE);
2N/A }
2N/A
2N/A included = (*jenv)->CallBooleanMethod(jenv,
2N/A jc->dtjj_aggregate_spec, g_aggspec_included_jm,
2N/A aggname);
2N/A (*jenv)->DeleteLocalRef(jenv, aggname);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (B_FALSE);
2N/A }
2N/A
2N/A return (included);
2N/A }
2N/A
2N/A return (B_TRUE);
2N/A}
2N/A
2N/A/*
2N/A * Return NULL if a java exception is pending, otherwise return a new
2N/A * AggregationValue instance.
2N/A */
2N/Astatic jobject
2N/Adtj_new_aggval(dtj_java_consumer_t *jc, const dtrace_aggdata_t *data,
2N/A const dtrace_recdesc_t *rec)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A
2N/A jobject jvalue = NULL; /* return value */
2N/A
2N/A dtrace_actkind_t act;
2N/A uint64_t normal;
2N/A caddr_t addr;
2N/A int64_t value;
2N/A
2N/A act = rec->dtrd_action;
2N/A normal = data->dtada_normal;
2N/A addr = data->dtada_data + rec->dtrd_offset;
2N/A if (act == DTRACEAGG_AVG) {
2N/A value = dtj_average(addr, normal);
2N/A } else {
2N/A /* LINTED - alignment */
2N/A value = (*((int64_t *)addr)) / normal;
2N/A }
2N/A
2N/A if (act == DTRACEAGG_QUANTIZE || act == DTRACEAGG_LQUANTIZE) {
2N/A jvalue = dtj_new_distribution(data, rec, jc);
2N/A } else {
2N/A switch (act) {
2N/A case DTRACEAGG_COUNT:
2N/A jvalue = (*jenv)->NewObject(jenv, g_aggcount_jc,
2N/A g_aggcountinit_jm, value);
2N/A break;
2N/A case DTRACEAGG_SUM:
2N/A jvalue = (*jenv)->NewObject(jenv, g_aggsum_jc,
2N/A g_aggsuminit_jm, value);
2N/A break;
2N/A case DTRACEAGG_AVG:
2N/A jvalue = (*jenv)->NewObject(jenv, g_aggavg_jc,
2N/A g_aggavginit_jm, value, dtj_avg_total(addr,
2N/A normal), dtj_avg_count(addr));
2N/A break;
2N/A case DTRACEAGG_MIN:
2N/A jvalue = (*jenv)->NewObject(jenv, g_aggmin_jc,
2N/A g_aggmininit_jm, value);
2N/A break;
2N/A case DTRACEAGG_MAX:
2N/A jvalue = (*jenv)->NewObject(jenv, g_aggmax_jc,
2N/A g_aggmaxinit_jm, value);
2N/A break;
2N/A case DTRACEAGG_STDDEV:
2N/A jvalue = dtj_stddev(jenv, addr, normal);
2N/A break;
2N/A default:
2N/A jvalue = NULL;
2N/A dtj_throw_illegal_argument(jenv,
2N/A "unexpected aggregation action: %d", act);
2N/A }
2N/A }
2N/A
2N/A return (jvalue);
2N/A}
2N/A
2N/A/*
2N/A * Stops the given consumer if it is running. Throws DTraceException if
2N/A * dtrace_stop() fails and no other exception is already pending. Clears and
2N/A * rethrows any pending exception in order to grab the global lock safely.
2N/A */
2N/Avoid
2N/Adtj_stop(dtj_java_consumer_t *jc)
2N/A{
2N/A JNIEnv *jenv;
2N/A int rc;
2N/A jthrowable e;
2N/A
2N/A switch (jc->dtjj_consumer->dtjc_state) {
2N/A case DTJ_CONSUMER_GO:
2N/A case DTJ_CONSUMER_START:
2N/A break;
2N/A default:
2N/A return;
2N/A }
2N/A
2N/A jenv = jc->dtjj_jenv;
2N/A e = (*jenv)->ExceptionOccurred(jenv);
2N/A if (e) {
2N/A (*jenv)->ExceptionClear(jenv);
2N/A }
2N/A
2N/A (*jenv)->MonitorEnter(jenv, g_caller_jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A goto rethrow;
2N/A }
2N/A
2N/A rc = dtrace_status(jc->dtjj_consumer->dtjc_dtp);
2N/A if (rc != DTRACE_STATUS_STOPPED) {
2N/A rc = dtrace_stop(jc->dtjj_consumer->dtjc_dtp);
2N/A }
2N/A
2N/A (*jenv)->MonitorExit(jenv, g_caller_jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A goto rethrow;
2N/A }
2N/A
2N/A if (rc == -1) {
2N/A (*jenv)->MonitorEnter(jenv, g_caller_jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A goto rethrow;
2N/A }
2N/A /* Do not wrap DTraceException */
2N/A dtj_throw_dtrace_exception(jc,
2N/A "couldn't stop tracing: %s",
2N/A dtrace_errmsg(jc->dtjj_consumer->dtjc_dtp,
2N/A dtrace_errno(jc->dtjj_consumer->dtjc_dtp)));
2N/A /* safe to call with pending exception */
2N/A (*jenv)->MonitorExit(jenv, g_caller_jc);
2N/A } else {
2N/A jc->dtjj_consumer->dtjc_state = DTJ_CONSUMER_STOP;
2N/A }
2N/A
2N/Arethrow:
2N/A if (e) {
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A /*
2N/A * Favor earlier pending exception over
2N/A * exception thrown in this function.
2N/A */
2N/A (*jenv)->ExceptionClear(jenv);
2N/A }
2N/A (*jenv)->Throw(jenv, e);
2N/A (*jenv)->DeleteLocalRef(jenv, e);
2N/A }
2N/A}
2N/A
2N/A/*
2N/A * Return Aggregate instance, or null if java exception pending.
2N/A */
2N/Ajobject
2N/Adtj_get_aggregate(dtj_java_consumer_t *jc)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A hrtime_t snaptime;
2N/A int rc;
2N/A
2N/A jobject aggregate = NULL;
2N/A
2N/A /* Must not call MonitorEnter with a pending exception */
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (NULL);
2N/A }
2N/A
2N/A /*
2N/A * Aggregations must be snapped, walked, and cleared atomically,
2N/A * otherwise clearing loses data accumulated since the most recent snap.
2N/A * This per-consumer lock prevents dtrace_work() from snapping or
2N/A * clearing aggregations while we're in the middle of this atomic
2N/A * operation, so we continue to hold it until done clearing.
2N/A */
2N/A (*jenv)->MonitorEnter(jenv, jc->dtjj_consumer_lock);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (NULL);
2N/A }
2N/A
2N/A dtj_aggwalk_init(jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A
2N/A /*
2N/A * Snap aggregations
2N/A *
2N/A * We need to record the snaptime here for the caller. Leaving it to
2N/A * the caller to record the snaptime before calling getAggregate() may
2N/A * be inaccurate because of the indeterminate delay waiting on the
2N/A * consumer lock before calling dtrace_aggregate_snap().
2N/A */
2N/A snaptime = gethrtime();
2N/A if (dtrace_aggregate_snap(jc->dtjj_consumer->dtjc_dtp) != 0) {
2N/A dtj_error_t e;
2N/A
2N/A /*
2N/A * The dataDropped() ConsumerListener method can throw an
2N/A * exception in the getAggregate() thread if the drop handler is
2N/A * invoked during dtrace_aggregate_snap().
2N/A */
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A /* Do not wrap exception thrown from ConsumerListener */
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A
2N/A if (dtj_get_dtrace_error(jc, &e) == DTJ_OK) {
2N/A /* Do not wrap DTraceException */
2N/A dtj_throw_dtrace_exception(jc, e.dtje_message);
2N/A }
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A /*
2N/A * Wrap the exception thrown from ConsumerListener in this case,
2N/A * so we can see that it unexpectedly reached this spot in
2N/A * native code (dtrace_aggregate_snap should have returned
2N/A * non-zero).
2N/A */
2N/A WRAP_EXCEPTION(jenv);
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A
2N/A /* Create the Java representation of the aggregate snapshot. */
2N/A aggregate = (*jenv)->NewObject(jenv, g_agg_jc, g_agginit_jm,
2N/A snaptime);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A jc->dtjj_aggregate = aggregate;
2N/A
2N/A /*
2N/A * Walk the aggregate, converting the data into Java Objects. Traverse
2N/A * in the order determined by libdtrace, respecting the various
2N/A * "aggsort" options, just as dtrace_work does when generating
2N/A * aggregations for the printa() action. libdtrace ordering is preserved
2N/A * in the "ordinal" property of AggregationRecord, since it would
2N/A * otherwise be lost when the records are hashed into the Aggregation's
2N/A * map. Neither the consumer loop nor the competing getAggregate()
2N/A * thread should depend on any particular record ordering (such as
2N/A * ordering by tuple key) to process records correctly.
2N/A *
2N/A * It is impractical to hold the global lock around
2N/A * dtrace_aggregate_print(), since it may take a long time (e.g. an
2N/A * entire second) if it performs expensive conversions such as that
2N/A * needed for user stack traces. Most libdtrace functions are not
2N/A * guaranteed to be MT-safe, even when each thread has its own dtrace
2N/A * handle; or even if they are safe, there is no guarantee that future
2N/A * changes may not make them unsafe. Fortunately in this case, however,
2N/A * only a per-consumer lock is necessary to avoid conflict with
2N/A * dtrace_work() running in another thread (the consumer loop).
2N/A */
2N/A rc = dtrace_aggregate_print(jc->dtjj_consumer->dtjc_dtp, NULL, NULL);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A if (rc != 0) {
2N/A dtj_error_t e;
2N/A if (dtj_get_dtrace_error(jc, &e) != DTJ_OK) {
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A
2N/A if (e.dtje_number != EINTR) {
2N/A /* Do not wrap DTraceException */
2N/A dtj_throw_dtrace_exception(jc, e.dtje_message);
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A }
2N/A
2N/A dtj_aggwalk_init(jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A
2N/A /*
2N/A * dtrace_aggregate_clear() clears all aggregations, and we need to
2N/A * clear aggregations selectively. It also fails to preserve the
2N/A * lquantize() range and step size; using aggregate_walk() to clear
2N/A * aggregations does not have this problem.
2N/A */
2N/A rc = dtrace_aggregate_walk(jc->dtjj_consumer->dtjc_dtp, dtj_clear, jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A if (rc != 0) {
2N/A dtj_error_t e;
2N/A if (dtj_get_dtrace_error(jc, &e) == DTJ_OK) {
2N/A /* Do not wrap DTraceException */
2N/A dtj_throw_dtrace_exception(jc, e.dtje_message);
2N/A }
2N/A /* release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (NULL);
2N/A }
2N/A
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (NULL);
2N/A }
2N/A
2N/A aggregate = jc->dtjj_aggregate;
2N/A jc->dtjj_aggregate = NULL;
2N/A
2N/A return (aggregate);
2N/A}
2N/A
2N/A/*
2N/A * Process any requests, such as the setting of runtime options, enqueued during
2N/A * dtrace_sleep(). A Java exception is pending if this function returns
2N/A * DTJ_ERR.
2N/A */
2N/Astatic dtj_status_t
2N/Adtj_process_requests(dtj_java_consumer_t *jc)
2N/A{
2N/A dtj_request_t *r;
2N/A uu_list_t *list = jc->dtjj_consumer->dtjc_request_list;
2N/A pthread_mutex_t *list_lock = &jc->dtjj_consumer->
2N/A dtjc_request_list_lock;
2N/A const char *opt;
2N/A const char *val;
2N/A
2N/A (void) pthread_mutex_lock(list_lock);
2N/A while (!dtj_list_empty(list)) {
2N/A r = uu_list_first(list);
2N/A uu_list_remove(list, r);
2N/A
2N/A switch (r->dtjr_type) {
2N/A case DTJ_REQUEST_OPTION:
2N/A opt = dtj_string_list_first(r->dtjr_args);
2N/A val = dtj_string_list_last(r->dtjr_args);
2N/A if (dtrace_setopt(jc->dtjj_consumer->dtjc_dtp, opt,
2N/A val) == -1) {
2N/A /* Do not wrap DTraceException */
2N/A dtj_throw_dtrace_exception(jc,
2N/A "failed to set %s: %s", opt,
2N/A dtrace_errmsg(jc->dtjj_consumer->dtjc_dtp,
2N/A dtrace_errno(jc->dtjj_consumer->dtjc_dtp)));
2N/A dtj_request_destroy(r, NULL);
2N/A (void) pthread_mutex_unlock(list_lock);
2N/A return (DTJ_ERR);
2N/A }
2N/A break;
2N/A }
2N/A dtj_request_destroy(r, NULL);
2N/A }
2N/A (void) pthread_mutex_unlock(list_lock);
2N/A return (DTJ_OK);
2N/A}
2N/A
2N/A/*
2N/A * Return DTJ_OK if the consumer loop is stopped normally by either the exit()
2N/A * action or the Consumer stop() method. Otherwise return DTJ_ERR if the
2N/A * consumer loop terminates abnormally with an exception pending.
2N/A */
2N/Adtj_status_t
2N/Adtj_consume(dtj_java_consumer_t *jc)
2N/A{
2N/A JNIEnv *jenv = jc->dtjj_jenv;
2N/A dtrace_hdl_t *dtp = jc->dtjj_consumer->dtjc_dtp;
2N/A boolean_t done = B_FALSE;
2N/A dtj_error_t e;
2N/A
2N/A do {
2N/A if (!jc->dtjj_consumer->dtjc_interrupt) {
2N/A dtrace_sleep(dtp);
2N/A }
2N/A
2N/A if (jc->dtjj_consumer->dtjc_interrupt) {
2N/A done = B_TRUE;
2N/A dtj_stop(jc);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A /*
2N/A * Exception left pending by Consumer
2N/A * getAggregate() method.
2N/A */
2N/A return (DTJ_ERR);
2N/A }
2N/A } else if (jc->dtjj_consumer->dtjc_process_list != NULL) {
2N/A int nprocs = uu_list_numnodes(jc->dtjj_consumer->
2N/A dtjc_process_list);
2N/A if (jc->dtjj_consumer->dtjc_procs_ended == nprocs) {
2N/A done = B_TRUE;
2N/A dtj_stop(jc);
2N/A }
2N/A }
2N/A
2N/A /*
2N/A * Functions like dtrace_setopt() are not safe to call during
2N/A * dtrace_sleep(). Check the request list every time we wake up
2N/A * from dtrace_sleep().
2N/A */
2N/A if (!done) {
2N/A if (dtj_process_requests(jc) != DTJ_OK) {
2N/A /* Do not wrap DTraceException */
2N/A return (DTJ_ERR);
2N/A }
2N/A }
2N/A
2N/A /* Must not call MonitorEnter with a pending exception */
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTJ_ERR);
2N/A }
2N/A
2N/A /*
2N/A * Use the per-consumer lock to avoid conflict with
2N/A * get_aggregate() called from another thread.
2N/A */
2N/A (*jenv)->MonitorEnter(jenv, jc->dtjj_consumer_lock);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A WRAP_EXCEPTION(jenv);
2N/A return (DTJ_ERR);
2N/A }
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_caller,
2N/A g_interval_began_jm);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A /* Don't wrap exception thrown from ConsumerListener */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (DTJ_ERR);
2N/A }
2N/A jc->dtjj_consumer->dtjc_printa_snaptime = gethrtime();
2N/A switch (dtrace_work(dtp, NULL, dtj_chew, dtj_chewrec, jc)) {
2N/A case DTRACE_WORKSTATUS_DONE:
2N/A done = B_TRUE;
2N/A break;
2N/A case DTRACE_WORKSTATUS_OKAY:
2N/A break;
2N/A default:
2N/A /*
2N/A * Check for a pending exception that got us to this
2N/A * error workstatus case.
2N/A */
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A /*
2N/A * Ensure valid initial state before releasing
2N/A * the consumer lock
2N/A */
2N/A jc->dtjj_consumer->dtjc_printa_snaptime = 0;
2N/A /* Do not wrap DTraceException */
2N/A /* Release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv,
2N/A jc->dtjj_consumer_lock);
2N/A return (DTJ_ERR);
2N/A }
2N/A
2N/A if (dtj_get_dtrace_error(jc, &e) != DTJ_OK) {
2N/A /* java exception pending */
2N/A jc->dtjj_consumer->dtjc_printa_snaptime = 0;
2N/A /* Release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv,
2N/A jc->dtjj_consumer_lock);
2N/A return (DTJ_ERR);
2N/A }
2N/A
2N/A if (e.dtje_number != EINTR) {
2N/A /* Do not wrap DTraceException */
2N/A dtj_throw_dtrace_exception(jc, e.dtje_message);
2N/A jc->dtjj_consumer->dtjc_printa_snaptime = 0;
2N/A /* Release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv,
2N/A jc->dtjj_consumer_lock);
2N/A return (DTJ_ERR);
2N/A }
2N/A }
2N/A /*
2N/A * Check for ConsumerException before doing anything else with
2N/A * the JNIEnv.
2N/A */
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A /*
2N/A * Do not wrap exception thrown from ConsumerListener.
2N/A */
2N/A jc->dtjj_consumer->dtjc_printa_snaptime = 0;
2N/A /* Release per-consumer lock */
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A return (DTJ_ERR);
2N/A }
2N/A jc->dtjj_consumer->dtjc_printa_snaptime = 0;
2N/A /*
2N/A * Notify ConsumerListeners the the dtrace_work() interval ended
2N/A * before releasing the lock.
2N/A */
2N/A (*jenv)->CallVoidMethod(jenv, jc->dtjj_caller,
2N/A g_interval_ended_jm);
2N/A (*jenv)->MonitorExit(jenv, jc->dtjj_consumer_lock);
2N/A if ((*jenv)->ExceptionCheck(jenv)) {
2N/A /* Don't wrap exception thrown from ConsumerListener */
2N/A return (DTJ_ERR);
2N/A }
2N/A
2N/A /*
2N/A * Check for a temporarily cleared exception set by a handler
2N/A * that could not safely leave the exception pending because it
2N/A * could not return an abort signal. Rethrow it now that it's
2N/A * safe to do so (when it's possible to ensure that no JNI calls
2N/A * will be made that are unsafe while an exception is pending).
2N/A */
2N/A if (jc->dtjj_exception) {
2N/A (*jenv)->Throw(jenv, jc->dtjj_exception);
2N/A (*jenv)->DeleteLocalRef(jenv, jc->dtjj_exception);
2N/A jc->dtjj_exception = NULL;
2N/A return (DTJ_ERR);
2N/A }
2N/A } while (!done);
2N/A
2N/A return (DTJ_OK);
2N/A}