17c478bd9Sstevel@tonic-gate /* 27c478bd9Sstevel@tonic-gate * CDDL HEADER START 37c478bd9Sstevel@tonic-gate * 47c478bd9Sstevel@tonic-gate * The contents of this file are subject to the terms of the 5127bbe13Stomee * Common Development and Distribution License (the "License"). 6127bbe13Stomee * You may not use this file except in compliance with the License. 77c478bd9Sstevel@tonic-gate * 87c478bd9Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 97c478bd9Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing. 107c478bd9Sstevel@tonic-gate * See the License for the specific language governing permissions 117c478bd9Sstevel@tonic-gate * and limitations under the License. 127c478bd9Sstevel@tonic-gate * 137c478bd9Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each 147c478bd9Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 157c478bd9Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the 167c478bd9Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying 177c478bd9Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner] 187c478bd9Sstevel@tonic-gate * 197c478bd9Sstevel@tonic-gate * CDDL HEADER END 207c478bd9Sstevel@tonic-gate */ 21127bbe13Stomee 227c478bd9Sstevel@tonic-gate /* 23*6e0bee74Sjhaslam * Copyright 2008 Sun Microsystems, Inc. All rights reserved. 247c478bd9Sstevel@tonic-gate * Use is subject to license terms. 257c478bd9Sstevel@tonic-gate */ 267c478bd9Sstevel@tonic-gate 277c478bd9Sstevel@tonic-gate #pragma ident "%Z%%M% %I% %E% SMI" 287c478bd9Sstevel@tonic-gate 297c478bd9Sstevel@tonic-gate #include <stdlib.h> 307c478bd9Sstevel@tonic-gate #include <strings.h> 317c478bd9Sstevel@tonic-gate #include <errno.h> 327c478bd9Sstevel@tonic-gate #include <unistd.h> 337c478bd9Sstevel@tonic-gate #include <dt_impl.h> 347c478bd9Sstevel@tonic-gate #include <assert.h> 3530ef842dSbmc #include <alloca.h> 3630ef842dSbmc #include <limits.h> 377c478bd9Sstevel@tonic-gate 387c478bd9Sstevel@tonic-gate #define DTRACE_AHASHSIZE 32779 /* big 'ol prime */ 397c478bd9Sstevel@tonic-gate 4030ef842dSbmc /* 4130ef842dSbmc * Because qsort(3C) does not allow an argument to be passed to a comparison 4230ef842dSbmc * function, the variables that affect comparison must regrettably be global; 4330ef842dSbmc * they are protected by a global static lock, dt_qsort_lock. 4430ef842dSbmc */ 4530ef842dSbmc static pthread_mutex_t dt_qsort_lock = PTHREAD_MUTEX_INITIALIZER; 4630ef842dSbmc 4730ef842dSbmc static int dt_revsort; 4830ef842dSbmc static int dt_keysort; 4930ef842dSbmc static int dt_keypos; 5030ef842dSbmc 5130ef842dSbmc #define DT_LESSTHAN (dt_revsort == 0 ? -1 : 1) 5230ef842dSbmc #define DT_GREATERTHAN (dt_revsort == 0 ? 1 : -1) 5330ef842dSbmc 547c478bd9Sstevel@tonic-gate static void 55187eccf8Sbmc dt_aggregate_count(int64_t *existing, int64_t *new, size_t size) 567c478bd9Sstevel@tonic-gate { 577c478bd9Sstevel@tonic-gate int i; 587c478bd9Sstevel@tonic-gate 59187eccf8Sbmc for (i = 0; i < size / sizeof (int64_t); i++) 607c478bd9Sstevel@tonic-gate existing[i] = existing[i] + new[i]; 617c478bd9Sstevel@tonic-gate } 627c478bd9Sstevel@tonic-gate 637c478bd9Sstevel@tonic-gate static int 64187eccf8Sbmc dt_aggregate_countcmp(int64_t *lhs, int64_t *rhs) 657c478bd9Sstevel@tonic-gate { 66187eccf8Sbmc int64_t lvar = *lhs; 67187eccf8Sbmc int64_t rvar = *rhs; 687c478bd9Sstevel@tonic-gate 697c478bd9Sstevel@tonic-gate if (lvar < rvar) 7030ef842dSbmc return (DT_LESSTHAN); 7130ef842dSbmc 7230ef842dSbmc if (lvar > rvar) 7330ef842dSbmc return (DT_GREATERTHAN); 747c478bd9Sstevel@tonic-gate 757c478bd9Sstevel@tonic-gate return (0); 767c478bd9Sstevel@tonic-gate } 777c478bd9Sstevel@tonic-gate 787c478bd9Sstevel@tonic-gate /*ARGSUSED*/ 797c478bd9Sstevel@tonic-gate static void 80187eccf8Sbmc dt_aggregate_min(int64_t *existing, int64_t *new, size_t size) 817c478bd9Sstevel@tonic-gate { 827c478bd9Sstevel@tonic-gate if (*new < *existing) 837c478bd9Sstevel@tonic-gate *existing = *new; 847c478bd9Sstevel@tonic-gate } 857c478bd9Sstevel@tonic-gate 867c478bd9Sstevel@tonic-gate /*ARGSUSED*/ 877c478bd9Sstevel@tonic-gate static void 88187eccf8Sbmc dt_aggregate_max(int64_t *existing, int64_t *new, size_t size) 897c478bd9Sstevel@tonic-gate { 907c478bd9Sstevel@tonic-gate if (*new > *existing) 917c478bd9Sstevel@tonic-gate *existing = *new; 927c478bd9Sstevel@tonic-gate } 937c478bd9Sstevel@tonic-gate 947c478bd9Sstevel@tonic-gate static int 95187eccf8Sbmc dt_aggregate_averagecmp(int64_t *lhs, int64_t *rhs) 967c478bd9Sstevel@tonic-gate { 97187eccf8Sbmc int64_t lavg = lhs[0] ? (lhs[1] / lhs[0]) : 0; 98187eccf8Sbmc int64_t ravg = rhs[0] ? (rhs[1] / rhs[0]) : 0; 997c478bd9Sstevel@tonic-gate 1007c478bd9Sstevel@tonic-gate if (lavg < ravg) 10130ef842dSbmc return (DT_LESSTHAN); 10230ef842dSbmc 10330ef842dSbmc if (lavg > ravg) 10430ef842dSbmc return (DT_GREATERTHAN); 1057c478bd9Sstevel@tonic-gate 1067c478bd9Sstevel@tonic-gate return (0); 1077c478bd9Sstevel@tonic-gate } 1087c478bd9Sstevel@tonic-gate 109*6e0bee74Sjhaslam static int 110*6e0bee74Sjhaslam dt_aggregate_stddevcmp(int64_t *lhs, int64_t *rhs) 111*6e0bee74Sjhaslam { 112*6e0bee74Sjhaslam uint64_t lsd = dt_stddev((uint64_t *)lhs, 1); 113*6e0bee74Sjhaslam uint64_t rsd = dt_stddev((uint64_t *)rhs, 1); 114*6e0bee74Sjhaslam 115*6e0bee74Sjhaslam if (lsd < rsd) 116*6e0bee74Sjhaslam return (DT_LESSTHAN); 117*6e0bee74Sjhaslam 118*6e0bee74Sjhaslam if (lsd > rsd) 119*6e0bee74Sjhaslam return (DT_GREATERTHAN); 120*6e0bee74Sjhaslam 121*6e0bee74Sjhaslam return (0); 122*6e0bee74Sjhaslam } 123*6e0bee74Sjhaslam 1247c478bd9Sstevel@tonic-gate /*ARGSUSED*/ 1257c478bd9Sstevel@tonic-gate static void 126187eccf8Sbmc dt_aggregate_lquantize(int64_t *existing, int64_t *new, size_t size) 1277c478bd9Sstevel@tonic-gate { 128187eccf8Sbmc int64_t arg = *existing++; 1297c478bd9Sstevel@tonic-gate uint16_t levels = DTRACE_LQUANTIZE_LEVELS(arg); 1307c478bd9Sstevel@tonic-gate int i; 1317c478bd9Sstevel@tonic-gate 1327c478bd9Sstevel@tonic-gate for (i = 0; i <= levels + 1; i++) 1337c478bd9Sstevel@tonic-gate existing[i] = existing[i] + new[i + 1]; 1347c478bd9Sstevel@tonic-gate } 1357c478bd9Sstevel@tonic-gate 136a1b5e537Sbmc static long double 137187eccf8Sbmc dt_aggregate_lquantizedsum(int64_t *lquanta) 1387c478bd9Sstevel@tonic-gate { 139187eccf8Sbmc int64_t arg = *lquanta++; 1407c478bd9Sstevel@tonic-gate int32_t base = DTRACE_LQUANTIZE_BASE(arg); 1417c478bd9Sstevel@tonic-gate uint16_t step = DTRACE_LQUANTIZE_STEP(arg); 1427c478bd9Sstevel@tonic-gate uint16_t levels = DTRACE_LQUANTIZE_LEVELS(arg), i; 143a1b5e537Sbmc long double total = (long double)lquanta[0] * (long double)(base - 1); 1447c478bd9Sstevel@tonic-gate 1457c478bd9Sstevel@tonic-gate for (i = 0; i < levels; base += step, i++) 146a1b5e537Sbmc total += (long double)lquanta[i + 1] * (long double)base; 1477c478bd9Sstevel@tonic-gate 148a1b5e537Sbmc return (total + (long double)lquanta[levels + 1] * 149a1b5e537Sbmc (long double)(base + 1)); 1507c478bd9Sstevel@tonic-gate } 1517c478bd9Sstevel@tonic-gate 152187eccf8Sbmc static int64_t 153187eccf8Sbmc dt_aggregate_lquantizedzero(int64_t *lquanta) 154187eccf8Sbmc { 155187eccf8Sbmc int64_t arg = *lquanta++; 156187eccf8Sbmc int32_t base = DTRACE_LQUANTIZE_BASE(arg); 157187eccf8Sbmc uint16_t step = DTRACE_LQUANTIZE_STEP(arg); 158187eccf8Sbmc uint16_t levels = DTRACE_LQUANTIZE_LEVELS(arg), i; 159187eccf8Sbmc 160187eccf8Sbmc if (base - 1 == 0) 161187eccf8Sbmc return (lquanta[0]); 162187eccf8Sbmc 163187eccf8Sbmc for (i = 0; i < levels; base += step, i++) { 164187eccf8Sbmc if (base != 0) 165187eccf8Sbmc continue; 166187eccf8Sbmc 167187eccf8Sbmc return (lquanta[i + 1]); 168187eccf8Sbmc } 169187eccf8Sbmc 170187eccf8Sbmc if (base + 1 == 0) 171187eccf8Sbmc return (lquanta[levels + 1]); 172187eccf8Sbmc 173187eccf8Sbmc return (0); 174187eccf8Sbmc } 175187eccf8Sbmc 1767c478bd9Sstevel@tonic-gate static int 177187eccf8Sbmc dt_aggregate_lquantizedcmp(int64_t *lhs, int64_t *rhs) 1787c478bd9Sstevel@tonic-gate { 179a1b5e537Sbmc long double lsum = dt_aggregate_lquantizedsum(lhs); 180a1b5e537Sbmc long double rsum = dt_aggregate_lquantizedsum(rhs); 181187eccf8Sbmc int64_t lzero, rzero; 1827c478bd9Sstevel@tonic-gate 1837c478bd9Sstevel@tonic-gate if (lsum < rsum) 18430ef842dSbmc return (DT_LESSTHAN); 18530ef842dSbmc 18630ef842dSbmc if (lsum > rsum) 18730ef842dSbmc return (DT_GREATERTHAN); 1887c478bd9Sstevel@tonic-gate 189187eccf8Sbmc /* 190187eccf8Sbmc * If they're both equal, then we will compare based on the weights at 191187eccf8Sbmc * zero. If the weights at zero are equal (or if zero is not within 192187eccf8Sbmc * the range of the linear quantization), then this will be judged a 193187eccf8Sbmc * tie and will be resolved based on the key comparison. 194187eccf8Sbmc */ 195187eccf8Sbmc lzero = dt_aggregate_lquantizedzero(lhs); 196187eccf8Sbmc rzero = dt_aggregate_lquantizedzero(rhs); 197187eccf8Sbmc 198187eccf8Sbmc if (lzero < rzero) 19930ef842dSbmc return (DT_LESSTHAN); 20030ef842dSbmc 20130ef842dSbmc if (lzero > rzero) 20230ef842dSbmc return (DT_GREATERTHAN); 203187eccf8Sbmc 2047c478bd9Sstevel@tonic-gate return (0); 2057c478bd9Sstevel@tonic-gate } 2067c478bd9Sstevel@tonic-gate 2077c478bd9Sstevel@tonic-gate static int 208187eccf8Sbmc dt_aggregate_quantizedcmp(int64_t *lhs, int64_t *rhs) 2097c478bd9Sstevel@tonic-gate { 2107c478bd9Sstevel@tonic-gate int nbuckets = DTRACE_QUANTIZE_NBUCKETS, i; 211a1b5e537Sbmc long double ltotal = 0, rtotal = 0; 212187eccf8Sbmc int64_t lzero, rzero; 2137c478bd9Sstevel@tonic-gate 2147c478bd9Sstevel@tonic-gate for (i = 0; i < nbuckets; i++) { 2157c478bd9Sstevel@tonic-gate int64_t bucketval = DTRACE_QUANTIZE_BUCKETVAL(i); 2167c478bd9Sstevel@tonic-gate 217187eccf8Sbmc if (bucketval == 0) { 218187eccf8Sbmc lzero = lhs[i]; 219187eccf8Sbmc rzero = rhs[i]; 220187eccf8Sbmc } 221187eccf8Sbmc 222a1b5e537Sbmc ltotal += (long double)bucketval * (long double)lhs[i]; 223a1b5e537Sbmc rtotal += (long double)bucketval * (long double)rhs[i]; 2247c478bd9Sstevel@tonic-gate } 2257c478bd9Sstevel@tonic-gate 2267c478bd9Sstevel@tonic-gate if (ltotal < rtotal) 22730ef842dSbmc return (DT_LESSTHAN); 22830ef842dSbmc 22930ef842dSbmc if (ltotal > rtotal) 23030ef842dSbmc return (DT_GREATERTHAN); 2317c478bd9Sstevel@tonic-gate 232187eccf8Sbmc /* 233187eccf8Sbmc * If they're both equal, then we will compare based on the weights at 234187eccf8Sbmc * zero. If the weights at zero are equal, then this will be judged a 235187eccf8Sbmc * tie and will be resolved based on the key comparison. 236187eccf8Sbmc */ 237187eccf8Sbmc if (lzero < rzero) 23830ef842dSbmc return (DT_LESSTHAN); 23930ef842dSbmc 24030ef842dSbmc if (lzero > rzero) 24130ef842dSbmc return (DT_GREATERTHAN); 242187eccf8Sbmc 2437c478bd9Sstevel@tonic-gate return (0); 2447c478bd9Sstevel@tonic-gate } 2457c478bd9Sstevel@tonic-gate 246a1b5e537Sbmc static void 247a1b5e537Sbmc dt_aggregate_usym(dtrace_hdl_t *dtp, uint64_t *data) 248a1b5e537Sbmc { 249a1b5e537Sbmc uint64_t pid = data[0]; 250a1b5e537Sbmc uint64_t *pc = &data[1]; 251a1b5e537Sbmc struct ps_prochandle *P; 252a1b5e537Sbmc GElf_Sym sym; 253a1b5e537Sbmc 254a1b5e537Sbmc if (dtp->dt_vector != NULL) 255a1b5e537Sbmc return; 256a1b5e537Sbmc 257a1b5e537Sbmc if ((P = dt_proc_grab(dtp, pid, PGRAB_RDONLY | PGRAB_FORCE, 0)) == NULL) 258a1b5e537Sbmc return; 259a1b5e537Sbmc 260a1b5e537Sbmc dt_proc_lock(dtp, P); 261a1b5e537Sbmc 262a1b5e537Sbmc if (Plookup_by_addr(P, *pc, NULL, 0, &sym) == 0) 263a1b5e537Sbmc *pc = sym.st_value; 264a1b5e537Sbmc 265a1b5e537Sbmc dt_proc_unlock(dtp, P); 266a1b5e537Sbmc dt_proc_release(dtp, P); 267a1b5e537Sbmc } 268a1b5e537Sbmc 269a1b5e537Sbmc static void 270a1b5e537Sbmc dt_aggregate_umod(dtrace_hdl_t *dtp, uint64_t *data) 271a1b5e537Sbmc { 272a1b5e537Sbmc uint64_t pid = data[0]; 273a1b5e537Sbmc uint64_t *pc = &data[1]; 274a1b5e537Sbmc struct ps_prochandle *P; 275a1b5e537Sbmc const prmap_t *map; 276a1b5e537Sbmc 277a1b5e537Sbmc if (dtp->dt_vector != NULL) 278a1b5e537Sbmc return; 279a1b5e537Sbmc 280a1b5e537Sbmc if ((P = dt_proc_grab(dtp, pid, PGRAB_RDONLY | PGRAB_FORCE, 0)) == NULL) 281a1b5e537Sbmc return; 282a1b5e537Sbmc 283a1b5e537Sbmc dt_proc_lock(dtp, P); 284a1b5e537Sbmc 285a1b5e537Sbmc if ((map = Paddr_to_map(P, *pc)) != NULL) 286a1b5e537Sbmc *pc = map->pr_vaddr; 287a1b5e537Sbmc 288a1b5e537Sbmc dt_proc_unlock(dtp, P); 289a1b5e537Sbmc dt_proc_release(dtp, P); 290a1b5e537Sbmc } 291a1b5e537Sbmc 292a1b5e537Sbmc static void 293a1b5e537Sbmc dt_aggregate_sym(dtrace_hdl_t *dtp, uint64_t *data) 294a1b5e537Sbmc { 295a1b5e537Sbmc GElf_Sym sym; 296a1b5e537Sbmc uint64_t *pc = data; 297a1b5e537Sbmc 298a1b5e537Sbmc if (dtrace_lookup_by_addr(dtp, *pc, &sym, NULL) == 0) 299a1b5e537Sbmc *pc = sym.st_value; 300a1b5e537Sbmc } 301a1b5e537Sbmc 302a1b5e537Sbmc static void 303a1b5e537Sbmc dt_aggregate_mod(dtrace_hdl_t *dtp, uint64_t *data) 304a1b5e537Sbmc { 305a1b5e537Sbmc uint64_t *pc = data; 306a1b5e537Sbmc dt_module_t *dmp; 307a1b5e537Sbmc 308a1b5e537Sbmc if (dtp->dt_vector != NULL) { 309a1b5e537Sbmc /* 310a1b5e537Sbmc * We don't have a way of just getting the module for a 311a1b5e537Sbmc * vectored open, and it doesn't seem to be worth defining 312a1b5e537Sbmc * one. This means that use of mod() won't get true 313a1b5e537Sbmc * aggregation in the postmortem case (some modules may 314a1b5e537Sbmc * appear more than once in aggregation output). It seems 315a1b5e537Sbmc * unlikely that anyone will ever notice or care... 316a1b5e537Sbmc */ 317a1b5e537Sbmc return; 318a1b5e537Sbmc } 319a1b5e537Sbmc 320a1b5e537Sbmc for (dmp = dt_list_next(&dtp->dt_modlist); dmp != NULL; 321a1b5e537Sbmc dmp = dt_list_next(dmp)) { 322a1b5e537Sbmc if (*pc - dmp->dm_text_va < dmp->dm_text_size) { 323a1b5e537Sbmc *pc = dmp->dm_text_va; 324a1b5e537Sbmc return; 325a1b5e537Sbmc } 326a1b5e537Sbmc } 327a1b5e537Sbmc } 328a1b5e537Sbmc 32930ef842dSbmc static dtrace_aggvarid_t 33030ef842dSbmc dt_aggregate_aggvarid(dt_ahashent_t *ent) 33130ef842dSbmc { 33230ef842dSbmc dtrace_aggdesc_t *agg = ent->dtahe_data.dtada_desc; 33330ef842dSbmc caddr_t data = ent->dtahe_data.dtada_data; 33430ef842dSbmc dtrace_recdesc_t *rec = agg->dtagd_rec; 33530ef842dSbmc 33630ef842dSbmc /* 33730ef842dSbmc * First, we'll check the variable ID in the aggdesc. If it's valid, 33830ef842dSbmc * we'll return it. If not, we'll use the compiler-generated ID 33930ef842dSbmc * present as the first record. 34030ef842dSbmc */ 34130ef842dSbmc if (agg->dtagd_varid != DTRACE_AGGVARIDNONE) 34230ef842dSbmc return (agg->dtagd_varid); 34330ef842dSbmc 34430ef842dSbmc agg->dtagd_varid = *((dtrace_aggvarid_t *)(uintptr_t)(data + 34530ef842dSbmc rec->dtrd_offset)); 34630ef842dSbmc 34730ef842dSbmc return (agg->dtagd_varid); 34830ef842dSbmc } 34930ef842dSbmc 35030ef842dSbmc 3517c478bd9Sstevel@tonic-gate static int 3527c478bd9Sstevel@tonic-gate dt_aggregate_snap_cpu(dtrace_hdl_t *dtp, processorid_t cpu) 3537c478bd9Sstevel@tonic-gate { 3547c478bd9Sstevel@tonic-gate dtrace_epid_t id; 3557c478bd9Sstevel@tonic-gate uint64_t hashval; 3567c478bd9Sstevel@tonic-gate size_t offs, roffs, size, ndx; 3577c478bd9Sstevel@tonic-gate int i, j, rval; 3587c478bd9Sstevel@tonic-gate caddr_t addr, data; 3597c478bd9Sstevel@tonic-gate dtrace_recdesc_t *rec; 3607c478bd9Sstevel@tonic-gate dt_aggregate_t *agp = &dtp->dt_aggregate; 3617c478bd9Sstevel@tonic-gate dtrace_aggdesc_t *agg; 3627c478bd9Sstevel@tonic-gate dt_ahash_t *hash = &agp->dtat_hash; 3637c478bd9Sstevel@tonic-gate dt_ahashent_t *h; 3647c478bd9Sstevel@tonic-gate dtrace_bufdesc_t b = agp->dtat_buf, *buf = &b; 3657c478bd9Sstevel@tonic-gate dtrace_aggdata_t *aggdata; 3667c478bd9Sstevel@tonic-gate int flags = agp->dtat_flags; 3677c478bd9Sstevel@tonic-gate 3687c478bd9Sstevel@tonic-gate buf->dtbd_cpu = cpu; 3697c478bd9Sstevel@tonic-gate 3707c478bd9Sstevel@tonic-gate if (dt_ioctl(dtp, DTRACEIOC_AGGSNAP, buf) == -1) { 3717c478bd9Sstevel@tonic-gate if (errno == ENOENT) { 3727c478bd9Sstevel@tonic-gate /* 3737c478bd9Sstevel@tonic-gate * If that failed with ENOENT, it may be because the 3747c478bd9Sstevel@tonic-gate * CPU was unconfigured. This is okay; we'll just 3757c478bd9Sstevel@tonic-gate * do nothing but return success. 3767c478bd9Sstevel@tonic-gate */ 3777c478bd9Sstevel@tonic-gate return (0); 3787c478bd9Sstevel@tonic-gate } 3797c478bd9Sstevel@tonic-gate 3807c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, errno)); 3817c478bd9Sstevel@tonic-gate } 3827c478bd9Sstevel@tonic-gate 3837c478bd9Sstevel@tonic-gate if (buf->dtbd_drops != 0) { 3847c478bd9Sstevel@tonic-gate if (dt_handle_cpudrop(dtp, cpu, 3857c478bd9Sstevel@tonic-gate DTRACEDROP_AGGREGATION, buf->dtbd_drops) == -1) 3867c478bd9Sstevel@tonic-gate return (-1); 3877c478bd9Sstevel@tonic-gate } 3887c478bd9Sstevel@tonic-gate 3897c478bd9Sstevel@tonic-gate if (buf->dtbd_size == 0) 3907c478bd9Sstevel@tonic-gate return (0); 3917c478bd9Sstevel@tonic-gate 3927c478bd9Sstevel@tonic-gate if (hash->dtah_hash == NULL) { 3937c478bd9Sstevel@tonic-gate size_t size; 3947c478bd9Sstevel@tonic-gate 3957c478bd9Sstevel@tonic-gate hash->dtah_size = DTRACE_AHASHSIZE; 3967c478bd9Sstevel@tonic-gate size = hash->dtah_size * sizeof (dt_ahashent_t *); 3977c478bd9Sstevel@tonic-gate 3987c478bd9Sstevel@tonic-gate if ((hash->dtah_hash = malloc(size)) == NULL) 3997c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_NOMEM)); 4007c478bd9Sstevel@tonic-gate 4017c478bd9Sstevel@tonic-gate bzero(hash->dtah_hash, size); 4027c478bd9Sstevel@tonic-gate } 4037c478bd9Sstevel@tonic-gate 4047c478bd9Sstevel@tonic-gate for (offs = 0; offs < buf->dtbd_size; ) { 4057c478bd9Sstevel@tonic-gate /* 4067c478bd9Sstevel@tonic-gate * We're guaranteed to have an ID. 4077c478bd9Sstevel@tonic-gate */ 4087c478bd9Sstevel@tonic-gate id = *((dtrace_epid_t *)((uintptr_t)buf->dtbd_data + 4097c478bd9Sstevel@tonic-gate (uintptr_t)offs)); 4107c478bd9Sstevel@tonic-gate 4117c478bd9Sstevel@tonic-gate if (id == DTRACE_AGGIDNONE) { 4127c478bd9Sstevel@tonic-gate /* 4137c478bd9Sstevel@tonic-gate * This is filler to assure proper alignment of the 4147c478bd9Sstevel@tonic-gate * next record; we simply ignore it. 4157c478bd9Sstevel@tonic-gate */ 4167c478bd9Sstevel@tonic-gate offs += sizeof (id); 4177c478bd9Sstevel@tonic-gate continue; 4187c478bd9Sstevel@tonic-gate } 4197c478bd9Sstevel@tonic-gate 4207c478bd9Sstevel@tonic-gate if ((rval = dt_aggid_lookup(dtp, id, &agg)) != 0) 4217c478bd9Sstevel@tonic-gate return (rval); 4227c478bd9Sstevel@tonic-gate 4237c478bd9Sstevel@tonic-gate addr = buf->dtbd_data + offs; 4247c478bd9Sstevel@tonic-gate size = agg->dtagd_size; 4257c478bd9Sstevel@tonic-gate hashval = 0; 4267c478bd9Sstevel@tonic-gate 4277c478bd9Sstevel@tonic-gate for (j = 0; j < agg->dtagd_nrecs - 1; j++) { 4287c478bd9Sstevel@tonic-gate rec = &agg->dtagd_rec[j]; 4297c478bd9Sstevel@tonic-gate roffs = rec->dtrd_offset; 4307c478bd9Sstevel@tonic-gate 431a1b5e537Sbmc switch (rec->dtrd_action) { 432a1b5e537Sbmc case DTRACEACT_USYM: 433a1b5e537Sbmc dt_aggregate_usym(dtp, 434a1b5e537Sbmc /* LINTED - alignment */ 435a1b5e537Sbmc (uint64_t *)&addr[roffs]); 436a1b5e537Sbmc break; 437a1b5e537Sbmc 438a1b5e537Sbmc case DTRACEACT_UMOD: 439a1b5e537Sbmc dt_aggregate_umod(dtp, 440a1b5e537Sbmc /* LINTED - alignment */ 441a1b5e537Sbmc (uint64_t *)&addr[roffs]); 442a1b5e537Sbmc break; 443a1b5e537Sbmc 444a1b5e537Sbmc case DTRACEACT_SYM: 445a1b5e537Sbmc /* LINTED - alignment */ 446a1b5e537Sbmc dt_aggregate_sym(dtp, (uint64_t *)&addr[roffs]); 447a1b5e537Sbmc break; 448a1b5e537Sbmc 449a1b5e537Sbmc case DTRACEACT_MOD: 450a1b5e537Sbmc /* LINTED - alignment */ 451a1b5e537Sbmc dt_aggregate_mod(dtp, (uint64_t *)&addr[roffs]); 452a1b5e537Sbmc break; 453a1b5e537Sbmc 454a1b5e537Sbmc default: 455a1b5e537Sbmc break; 456a1b5e537Sbmc } 457a1b5e537Sbmc 4587c478bd9Sstevel@tonic-gate for (i = 0; i < rec->dtrd_size; i++) 4597c478bd9Sstevel@tonic-gate hashval += addr[roffs + i]; 4607c478bd9Sstevel@tonic-gate } 4617c478bd9Sstevel@tonic-gate 4627c478bd9Sstevel@tonic-gate ndx = hashval % hash->dtah_size; 4637c478bd9Sstevel@tonic-gate 4647c478bd9Sstevel@tonic-gate for (h = hash->dtah_hash[ndx]; h != NULL; h = h->dtahe_next) { 4657c478bd9Sstevel@tonic-gate if (h->dtahe_hashval != hashval) 4667c478bd9Sstevel@tonic-gate continue; 4677c478bd9Sstevel@tonic-gate 4687c478bd9Sstevel@tonic-gate if (h->dtahe_size != size) 4697c478bd9Sstevel@tonic-gate continue; 4707c478bd9Sstevel@tonic-gate 4717c478bd9Sstevel@tonic-gate aggdata = &h->dtahe_data; 4727c478bd9Sstevel@tonic-gate data = aggdata->dtada_data; 4737c478bd9Sstevel@tonic-gate 4747c478bd9Sstevel@tonic-gate for (j = 0; j < agg->dtagd_nrecs - 1; j++) { 4757c478bd9Sstevel@tonic-gate rec = &agg->dtagd_rec[j]; 4767c478bd9Sstevel@tonic-gate roffs = rec->dtrd_offset; 4777c478bd9Sstevel@tonic-gate 4787c478bd9Sstevel@tonic-gate for (i = 0; i < rec->dtrd_size; i++) 4797c478bd9Sstevel@tonic-gate if (addr[roffs + i] != data[roffs + i]) 4807c478bd9Sstevel@tonic-gate goto hashnext; 4817c478bd9Sstevel@tonic-gate } 4827c478bd9Sstevel@tonic-gate 4837c478bd9Sstevel@tonic-gate /* 4847c478bd9Sstevel@tonic-gate * We found it. Now we need to apply the aggregating 4857c478bd9Sstevel@tonic-gate * action on the data here. 4867c478bd9Sstevel@tonic-gate */ 4877c478bd9Sstevel@tonic-gate rec = &agg->dtagd_rec[agg->dtagd_nrecs - 1]; 4887c478bd9Sstevel@tonic-gate roffs = rec->dtrd_offset; 4897c478bd9Sstevel@tonic-gate /* LINTED - alignment */ 490187eccf8Sbmc h->dtahe_aggregate((int64_t *)&data[roffs], 4917c478bd9Sstevel@tonic-gate /* LINTED - alignment */ 492187eccf8Sbmc (int64_t *)&addr[roffs], rec->dtrd_size); 4937c478bd9Sstevel@tonic-gate 4947c478bd9Sstevel@tonic-gate /* 4957c478bd9Sstevel@tonic-gate * If we're keeping per CPU data, apply the aggregating 4967c478bd9Sstevel@tonic-gate * action there as well. 4977c478bd9Sstevel@tonic-gate */ 4987c478bd9Sstevel@tonic-gate if (aggdata->dtada_percpu != NULL) { 4997c478bd9Sstevel@tonic-gate data = aggdata->dtada_percpu[cpu]; 5007c478bd9Sstevel@tonic-gate 5017c478bd9Sstevel@tonic-gate /* LINTED - alignment */ 502187eccf8Sbmc h->dtahe_aggregate((int64_t *)data, 5037c478bd9Sstevel@tonic-gate /* LINTED - alignment */ 504187eccf8Sbmc (int64_t *)&addr[roffs], rec->dtrd_size); 5057c478bd9Sstevel@tonic-gate } 5067c478bd9Sstevel@tonic-gate 5077c478bd9Sstevel@tonic-gate goto bufnext; 5087c478bd9Sstevel@tonic-gate hashnext: 5097c478bd9Sstevel@tonic-gate continue; 5107c478bd9Sstevel@tonic-gate } 5117c478bd9Sstevel@tonic-gate 5127c478bd9Sstevel@tonic-gate /* 5137c478bd9Sstevel@tonic-gate * If we're here, we couldn't find an entry for this record. 5147c478bd9Sstevel@tonic-gate */ 5157c478bd9Sstevel@tonic-gate if ((h = malloc(sizeof (dt_ahashent_t))) == NULL) 5167c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_NOMEM)); 5177c478bd9Sstevel@tonic-gate bzero(h, sizeof (dt_ahashent_t)); 5187c478bd9Sstevel@tonic-gate aggdata = &h->dtahe_data; 5197c478bd9Sstevel@tonic-gate 5207c478bd9Sstevel@tonic-gate if ((aggdata->dtada_data = malloc(size)) == NULL) { 5217c478bd9Sstevel@tonic-gate free(h); 5227c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_NOMEM)); 5237c478bd9Sstevel@tonic-gate } 5247c478bd9Sstevel@tonic-gate 5257c478bd9Sstevel@tonic-gate bcopy(addr, aggdata->dtada_data, size); 5267c478bd9Sstevel@tonic-gate aggdata->dtada_size = size; 5277c478bd9Sstevel@tonic-gate aggdata->dtada_desc = agg; 5287c478bd9Sstevel@tonic-gate aggdata->dtada_handle = dtp; 5297c478bd9Sstevel@tonic-gate (void) dt_epid_lookup(dtp, agg->dtagd_epid, 5307c478bd9Sstevel@tonic-gate &aggdata->dtada_edesc, &aggdata->dtada_pdesc); 5317c478bd9Sstevel@tonic-gate aggdata->dtada_normal = 1; 5327c478bd9Sstevel@tonic-gate 5337c478bd9Sstevel@tonic-gate h->dtahe_hashval = hashval; 5347c478bd9Sstevel@tonic-gate h->dtahe_size = size; 53530ef842dSbmc (void) dt_aggregate_aggvarid(h); 5367c478bd9Sstevel@tonic-gate 5377c478bd9Sstevel@tonic-gate rec = &agg->dtagd_rec[agg->dtagd_nrecs - 1]; 5387c478bd9Sstevel@tonic-gate 5397c478bd9Sstevel@tonic-gate if (flags & DTRACE_A_PERCPU) { 5407c478bd9Sstevel@tonic-gate int max_cpus = agp->dtat_maxcpu; 5417c478bd9Sstevel@tonic-gate caddr_t *percpu = malloc(max_cpus * sizeof (caddr_t)); 5427c478bd9Sstevel@tonic-gate 5437c478bd9Sstevel@tonic-gate if (percpu == NULL) { 5447c478bd9Sstevel@tonic-gate free(aggdata->dtada_data); 5457c478bd9Sstevel@tonic-gate free(h); 5467c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_NOMEM)); 5477c478bd9Sstevel@tonic-gate } 5487c478bd9Sstevel@tonic-gate 5497c478bd9Sstevel@tonic-gate for (j = 0; j < max_cpus; j++) { 5507c478bd9Sstevel@tonic-gate percpu[j] = malloc(rec->dtrd_size); 5517c478bd9Sstevel@tonic-gate 5527c478bd9Sstevel@tonic-gate if (percpu[j] == NULL) { 5537c478bd9Sstevel@tonic-gate while (--j >= 0) 5547c478bd9Sstevel@tonic-gate free(percpu[j]); 5557c478bd9Sstevel@tonic-gate 5567c478bd9Sstevel@tonic-gate free(aggdata->dtada_data); 5577c478bd9Sstevel@tonic-gate free(h); 5587c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_NOMEM)); 5597c478bd9Sstevel@tonic-gate } 5607c478bd9Sstevel@tonic-gate 5617c478bd9Sstevel@tonic-gate if (j == cpu) { 5627c478bd9Sstevel@tonic-gate bcopy(&addr[rec->dtrd_offset], 5637c478bd9Sstevel@tonic-gate percpu[j], rec->dtrd_size); 5647c478bd9Sstevel@tonic-gate } else { 5657c478bd9Sstevel@tonic-gate bzero(percpu[j], rec->dtrd_size); 5667c478bd9Sstevel@tonic-gate } 5677c478bd9Sstevel@tonic-gate } 5687c478bd9Sstevel@tonic-gate 5697c478bd9Sstevel@tonic-gate aggdata->dtada_percpu = percpu; 5707c478bd9Sstevel@tonic-gate } 5717c478bd9Sstevel@tonic-gate 5727c478bd9Sstevel@tonic-gate switch (rec->dtrd_action) { 5737c478bd9Sstevel@tonic-gate case DTRACEAGG_MIN: 5747c478bd9Sstevel@tonic-gate h->dtahe_aggregate = dt_aggregate_min; 5757c478bd9Sstevel@tonic-gate break; 5767c478bd9Sstevel@tonic-gate 5777c478bd9Sstevel@tonic-gate case DTRACEAGG_MAX: 5787c478bd9Sstevel@tonic-gate h->dtahe_aggregate = dt_aggregate_max; 5797c478bd9Sstevel@tonic-gate break; 5807c478bd9Sstevel@tonic-gate 5817c478bd9Sstevel@tonic-gate case DTRACEAGG_LQUANTIZE: 5827c478bd9Sstevel@tonic-gate h->dtahe_aggregate = dt_aggregate_lquantize; 5837c478bd9Sstevel@tonic-gate break; 5847c478bd9Sstevel@tonic-gate 5857c478bd9Sstevel@tonic-gate case DTRACEAGG_COUNT: 5867c478bd9Sstevel@tonic-gate case DTRACEAGG_SUM: 5877c478bd9Sstevel@tonic-gate case DTRACEAGG_AVG: 588*6e0bee74Sjhaslam case DTRACEAGG_STDDEV: 5897c478bd9Sstevel@tonic-gate case DTRACEAGG_QUANTIZE: 5907c478bd9Sstevel@tonic-gate h->dtahe_aggregate = dt_aggregate_count; 5917c478bd9Sstevel@tonic-gate break; 5927c478bd9Sstevel@tonic-gate 5937c478bd9Sstevel@tonic-gate default: 5947c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_BADAGG)); 5957c478bd9Sstevel@tonic-gate } 5967c478bd9Sstevel@tonic-gate 5977c478bd9Sstevel@tonic-gate if (hash->dtah_hash[ndx] != NULL) 5987c478bd9Sstevel@tonic-gate hash->dtah_hash[ndx]->dtahe_prev = h; 5997c478bd9Sstevel@tonic-gate 6007c478bd9Sstevel@tonic-gate h->dtahe_next = hash->dtah_hash[ndx]; 6017c478bd9Sstevel@tonic-gate hash->dtah_hash[ndx] = h; 6027c478bd9Sstevel@tonic-gate 6037c478bd9Sstevel@tonic-gate if (hash->dtah_all != NULL) 6047c478bd9Sstevel@tonic-gate hash->dtah_all->dtahe_prevall = h; 6057c478bd9Sstevel@tonic-gate 6067c478bd9Sstevel@tonic-gate h->dtahe_nextall = hash->dtah_all; 6077c478bd9Sstevel@tonic-gate hash->dtah_all = h; 6087c478bd9Sstevel@tonic-gate bufnext: 6097c478bd9Sstevel@tonic-gate offs += agg->dtagd_size; 6107c478bd9Sstevel@tonic-gate } 6117c478bd9Sstevel@tonic-gate 6127c478bd9Sstevel@tonic-gate return (0); 6137c478bd9Sstevel@tonic-gate } 6147c478bd9Sstevel@tonic-gate 6157c478bd9Sstevel@tonic-gate int 6167c478bd9Sstevel@tonic-gate dtrace_aggregate_snap(dtrace_hdl_t *dtp) 6177c478bd9Sstevel@tonic-gate { 6187c478bd9Sstevel@tonic-gate int i, rval; 6197c478bd9Sstevel@tonic-gate dt_aggregate_t *agp = &dtp->dt_aggregate; 6207c478bd9Sstevel@tonic-gate hrtime_t now = gethrtime(); 6217c478bd9Sstevel@tonic-gate dtrace_optval_t interval = dtp->dt_options[DTRACEOPT_AGGRATE]; 6227c478bd9Sstevel@tonic-gate 6237c478bd9Sstevel@tonic-gate if (dtp->dt_lastagg != 0) { 6247c478bd9Sstevel@tonic-gate if (now - dtp->dt_lastagg < interval) 6257c478bd9Sstevel@tonic-gate return (0); 6267c478bd9Sstevel@tonic-gate 6277c478bd9Sstevel@tonic-gate dtp->dt_lastagg += interval; 6287c478bd9Sstevel@tonic-gate } else { 6297c478bd9Sstevel@tonic-gate dtp->dt_lastagg = now; 6307c478bd9Sstevel@tonic-gate } 6317c478bd9Sstevel@tonic-gate 6327c478bd9Sstevel@tonic-gate if (!dtp->dt_active) 6337c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EINVAL)); 6347c478bd9Sstevel@tonic-gate 6357c478bd9Sstevel@tonic-gate if (agp->dtat_buf.dtbd_size == 0) 6367c478bd9Sstevel@tonic-gate return (0); 6377c478bd9Sstevel@tonic-gate 6387c478bd9Sstevel@tonic-gate for (i = 0; i < agp->dtat_ncpus; i++) { 6397c478bd9Sstevel@tonic-gate if (rval = dt_aggregate_snap_cpu(dtp, agp->dtat_cpus[i])) 6407c478bd9Sstevel@tonic-gate return (rval); 6417c478bd9Sstevel@tonic-gate } 6427c478bd9Sstevel@tonic-gate 6437c478bd9Sstevel@tonic-gate return (0); 6447c478bd9Sstevel@tonic-gate } 6457c478bd9Sstevel@tonic-gate 6467c478bd9Sstevel@tonic-gate static int 6477c478bd9Sstevel@tonic-gate dt_aggregate_hashcmp(const void *lhs, const void *rhs) 6487c478bd9Sstevel@tonic-gate { 6497c478bd9Sstevel@tonic-gate dt_ahashent_t *lh = *((dt_ahashent_t **)lhs); 6507c478bd9Sstevel@tonic-gate dt_ahashent_t *rh = *((dt_ahashent_t **)rhs); 6517c478bd9Sstevel@tonic-gate dtrace_aggdesc_t *lagg = lh->dtahe_data.dtada_desc; 6527c478bd9Sstevel@tonic-gate dtrace_aggdesc_t *ragg = rh->dtahe_data.dtada_desc; 6537c478bd9Sstevel@tonic-gate 6547c478bd9Sstevel@tonic-gate if (lagg->dtagd_nrecs < ragg->dtagd_nrecs) 65530ef842dSbmc return (DT_LESSTHAN); 6567c478bd9Sstevel@tonic-gate 6577c478bd9Sstevel@tonic-gate if (lagg->dtagd_nrecs > ragg->dtagd_nrecs) 65830ef842dSbmc return (DT_GREATERTHAN); 6597c478bd9Sstevel@tonic-gate 6607c478bd9Sstevel@tonic-gate return (0); 6617c478bd9Sstevel@tonic-gate } 6627c478bd9Sstevel@tonic-gate 6637c478bd9Sstevel@tonic-gate static int 6647c478bd9Sstevel@tonic-gate dt_aggregate_varcmp(const void *lhs, const void *rhs) 6657c478bd9Sstevel@tonic-gate { 6667c478bd9Sstevel@tonic-gate dt_ahashent_t *lh = *((dt_ahashent_t **)lhs); 6677c478bd9Sstevel@tonic-gate dt_ahashent_t *rh = *((dt_ahashent_t **)rhs); 66830ef842dSbmc dtrace_aggvarid_t lid, rid; 6697c478bd9Sstevel@tonic-gate 67030ef842dSbmc lid = dt_aggregate_aggvarid(lh); 67130ef842dSbmc rid = dt_aggregate_aggvarid(rh); 6727c478bd9Sstevel@tonic-gate 6737c478bd9Sstevel@tonic-gate if (lid < rid) 67430ef842dSbmc return (DT_LESSTHAN); 6757c478bd9Sstevel@tonic-gate 6767c478bd9Sstevel@tonic-gate if (lid > rid) 67730ef842dSbmc return (DT_GREATERTHAN); 6787c478bd9Sstevel@tonic-gate 6797c478bd9Sstevel@tonic-gate return (0); 6807c478bd9Sstevel@tonic-gate } 6817c478bd9Sstevel@tonic-gate 6827c478bd9Sstevel@tonic-gate static int 6837c478bd9Sstevel@tonic-gate dt_aggregate_keycmp(const void *lhs, const void *rhs) 6847c478bd9Sstevel@tonic-gate { 6857c478bd9Sstevel@tonic-gate dt_ahashent_t *lh = *((dt_ahashent_t **)lhs); 6867c478bd9Sstevel@tonic-gate dt_ahashent_t *rh = *((dt_ahashent_t **)rhs); 6877c478bd9Sstevel@tonic-gate dtrace_aggdesc_t *lagg = lh->dtahe_data.dtada_desc; 6887c478bd9Sstevel@tonic-gate dtrace_aggdesc_t *ragg = rh->dtahe_data.dtada_desc; 6897c478bd9Sstevel@tonic-gate dtrace_recdesc_t *lrec, *rrec; 6907c478bd9Sstevel@tonic-gate char *ldata, *rdata; 69130ef842dSbmc int rval, i, j, keypos, nrecs; 6927c478bd9Sstevel@tonic-gate 6937c478bd9Sstevel@tonic-gate if ((rval = dt_aggregate_hashcmp(lhs, rhs)) != 0) 6947c478bd9Sstevel@tonic-gate return (rval); 6957c478bd9Sstevel@tonic-gate 69630ef842dSbmc nrecs = lagg->dtagd_nrecs - 1; 69730ef842dSbmc assert(nrecs == ragg->dtagd_nrecs - 1); 69830ef842dSbmc 69930ef842dSbmc keypos = dt_keypos + 1 >= nrecs ? 0 : dt_keypos; 70030ef842dSbmc 70130ef842dSbmc for (i = 1; i < nrecs; i++) { 7027c478bd9Sstevel@tonic-gate uint64_t lval, rval; 70330ef842dSbmc int ndx = i + keypos; 7047c478bd9Sstevel@tonic-gate 70530ef842dSbmc if (ndx >= nrecs) 70630ef842dSbmc ndx = ndx - nrecs + 1; 70730ef842dSbmc 70830ef842dSbmc lrec = &lagg->dtagd_rec[ndx]; 70930ef842dSbmc rrec = &ragg->dtagd_rec[ndx]; 7107c478bd9Sstevel@tonic-gate 7117c478bd9Sstevel@tonic-gate ldata = lh->dtahe_data.dtada_data + lrec->dtrd_offset; 7127c478bd9Sstevel@tonic-gate rdata = rh->dtahe_data.dtada_data + rrec->dtrd_offset; 7137c478bd9Sstevel@tonic-gate 7147c478bd9Sstevel@tonic-gate if (lrec->dtrd_size < rrec->dtrd_size) 71530ef842dSbmc return (DT_LESSTHAN); 7167c478bd9Sstevel@tonic-gate 7177c478bd9Sstevel@tonic-gate if (lrec->dtrd_size > rrec->dtrd_size) 71830ef842dSbmc return (DT_GREATERTHAN); 7197c478bd9Sstevel@tonic-gate 7207c478bd9Sstevel@tonic-gate switch (lrec->dtrd_size) { 7217c478bd9Sstevel@tonic-gate case sizeof (uint64_t): 7227c478bd9Sstevel@tonic-gate /* LINTED - alignment */ 7237c478bd9Sstevel@tonic-gate lval = *((uint64_t *)ldata); 7247c478bd9Sstevel@tonic-gate /* LINTED - alignment */ 7257c478bd9Sstevel@tonic-gate rval = *((uint64_t *)rdata); 7267c478bd9Sstevel@tonic-gate break; 7277c478bd9Sstevel@tonic-gate 7287c478bd9Sstevel@tonic-gate case sizeof (uint32_t): 7297c478bd9Sstevel@tonic-gate /* LINTED - alignment */ 7307c478bd9Sstevel@tonic-gate lval = *((uint32_t *)ldata); 7317c478bd9Sstevel@tonic-gate /* LINTED - alignment */ 7327c478bd9Sstevel@tonic-gate rval = *((uint32_t *)rdata); 7337c478bd9Sstevel@tonic-gate break; 7347c478bd9Sstevel@tonic-gate 7357c478bd9Sstevel@tonic-gate case sizeof (uint16_t): 7367c478bd9Sstevel@tonic-gate /* LINTED - alignment */ 7377c478bd9Sstevel@tonic-gate lval = *((uint16_t *)ldata); 7387c478bd9Sstevel@tonic-gate /* LINTED - alignment */ 7397c478bd9Sstevel@tonic-gate rval = *((uint16_t *)rdata); 7407c478bd9Sstevel@tonic-gate break; 7417c478bd9Sstevel@tonic-gate 7427c478bd9Sstevel@tonic-gate case sizeof (uint8_t): 7437c478bd9Sstevel@tonic-gate lval = *((uint8_t *)ldata); 7447c478bd9Sstevel@tonic-gate rval = *((uint8_t *)rdata); 7457c478bd9Sstevel@tonic-gate break; 7467c478bd9Sstevel@tonic-gate 7477c478bd9Sstevel@tonic-gate default: 748127bbe13Stomee switch (lrec->dtrd_action) { 749127bbe13Stomee case DTRACEACT_UMOD: 750127bbe13Stomee case DTRACEACT_UADDR: 751127bbe13Stomee case DTRACEACT_USYM: 752127bbe13Stomee for (j = 0; j < 2; j++) { 753127bbe13Stomee /* LINTED - alignment */ 754127bbe13Stomee lval = ((uint64_t *)ldata)[j]; 755127bbe13Stomee /* LINTED - alignment */ 756127bbe13Stomee rval = ((uint64_t *)rdata)[j]; 757127bbe13Stomee 758127bbe13Stomee if (lval < rval) 759127bbe13Stomee return (DT_LESSTHAN); 760127bbe13Stomee 761127bbe13Stomee if (lval > rval) 762127bbe13Stomee return (DT_GREATERTHAN); 763127bbe13Stomee } 7647c478bd9Sstevel@tonic-gate 765127bbe13Stomee break; 7667c478bd9Sstevel@tonic-gate 767127bbe13Stomee default: 768127bbe13Stomee for (j = 0; j < lrec->dtrd_size; j++) { 769127bbe13Stomee lval = ((uint8_t *)ldata)[j]; 770127bbe13Stomee rval = ((uint8_t *)rdata)[j]; 77130ef842dSbmc 772127bbe13Stomee if (lval < rval) 773127bbe13Stomee return (DT_LESSTHAN); 774127bbe13Stomee 775127bbe13Stomee if (lval > rval) 776127bbe13Stomee return (DT_GREATERTHAN); 777127bbe13Stomee } 7787c478bd9Sstevel@tonic-gate } 7797c478bd9Sstevel@tonic-gate 7807c478bd9Sstevel@tonic-gate continue; 7817c478bd9Sstevel@tonic-gate } 7827c478bd9Sstevel@tonic-gate 7837c478bd9Sstevel@tonic-gate if (lval < rval) 78430ef842dSbmc return (DT_LESSTHAN); 7857c478bd9Sstevel@tonic-gate 7867c478bd9Sstevel@tonic-gate if (lval > rval) 78730ef842dSbmc return (DT_GREATERTHAN); 7887c478bd9Sstevel@tonic-gate } 7897c478bd9Sstevel@tonic-gate 7907c478bd9Sstevel@tonic-gate return (0); 7917c478bd9Sstevel@tonic-gate } 7927c478bd9Sstevel@tonic-gate 7937c478bd9Sstevel@tonic-gate static int 7947c478bd9Sstevel@tonic-gate dt_aggregate_valcmp(const void *lhs, const void *rhs) 7957c478bd9Sstevel@tonic-gate { 7967c478bd9Sstevel@tonic-gate dt_ahashent_t *lh = *((dt_ahashent_t **)lhs); 7977c478bd9Sstevel@tonic-gate dt_ahashent_t *rh = *((dt_ahashent_t **)rhs); 7987c478bd9Sstevel@tonic-gate dtrace_aggdesc_t *lagg = lh->dtahe_data.dtada_desc; 7997c478bd9Sstevel@tonic-gate dtrace_aggdesc_t *ragg = rh->dtahe_data.dtada_desc; 8007c478bd9Sstevel@tonic-gate caddr_t ldata = lh->dtahe_data.dtada_data; 8017c478bd9Sstevel@tonic-gate caddr_t rdata = rh->dtahe_data.dtada_data; 8027c478bd9Sstevel@tonic-gate dtrace_recdesc_t *lrec, *rrec; 803187eccf8Sbmc int64_t *laddr, *raddr; 8047c478bd9Sstevel@tonic-gate int rval, i; 8057c478bd9Sstevel@tonic-gate 8067c478bd9Sstevel@tonic-gate if ((rval = dt_aggregate_hashcmp(lhs, rhs)) != 0) 8077c478bd9Sstevel@tonic-gate return (rval); 8087c478bd9Sstevel@tonic-gate 8097c478bd9Sstevel@tonic-gate if (lagg->dtagd_nrecs > ragg->dtagd_nrecs) 81030ef842dSbmc return (DT_GREATERTHAN); 81130ef842dSbmc 81230ef842dSbmc if (lagg->dtagd_nrecs < ragg->dtagd_nrecs) 81330ef842dSbmc return (DT_LESSTHAN); 8147c478bd9Sstevel@tonic-gate 8157c478bd9Sstevel@tonic-gate for (i = 0; i < lagg->dtagd_nrecs; i++) { 8167c478bd9Sstevel@tonic-gate lrec = &lagg->dtagd_rec[i]; 8177c478bd9Sstevel@tonic-gate rrec = &ragg->dtagd_rec[i]; 8187c478bd9Sstevel@tonic-gate 8197c478bd9Sstevel@tonic-gate if (lrec->dtrd_offset < rrec->dtrd_offset) 82030ef842dSbmc return (DT_LESSTHAN); 8217c478bd9Sstevel@tonic-gate 8227c478bd9Sstevel@tonic-gate if (lrec->dtrd_offset > rrec->dtrd_offset) 82330ef842dSbmc return (DT_GREATERTHAN); 8247c478bd9Sstevel@tonic-gate 8257c478bd9Sstevel@tonic-gate if (lrec->dtrd_action < rrec->dtrd_action) 82630ef842dSbmc return (DT_LESSTHAN); 8277c478bd9Sstevel@tonic-gate 8287c478bd9Sstevel@tonic-gate if (lrec->dtrd_action > rrec->dtrd_action) 82930ef842dSbmc return (DT_GREATERTHAN); 8307c478bd9Sstevel@tonic-gate } 8317c478bd9Sstevel@tonic-gate 832187eccf8Sbmc laddr = (int64_t *)(uintptr_t)(ldata + lrec->dtrd_offset); 833187eccf8Sbmc raddr = (int64_t *)(uintptr_t)(rdata + rrec->dtrd_offset); 8347c478bd9Sstevel@tonic-gate 8357c478bd9Sstevel@tonic-gate switch (lrec->dtrd_action) { 8367c478bd9Sstevel@tonic-gate case DTRACEAGG_AVG: 8377c478bd9Sstevel@tonic-gate rval = dt_aggregate_averagecmp(laddr, raddr); 8387c478bd9Sstevel@tonic-gate break; 8397c478bd9Sstevel@tonic-gate 840*6e0bee74Sjhaslam case DTRACEAGG_STDDEV: 841*6e0bee74Sjhaslam rval = dt_aggregate_stddevcmp(laddr, raddr); 842*6e0bee74Sjhaslam break; 843*6e0bee74Sjhaslam 8447c478bd9Sstevel@tonic-gate case DTRACEAGG_QUANTIZE: 8457c478bd9Sstevel@tonic-gate rval = dt_aggregate_quantizedcmp(laddr, raddr); 8467c478bd9Sstevel@tonic-gate break; 8477c478bd9Sstevel@tonic-gate 8487c478bd9Sstevel@tonic-gate case DTRACEAGG_LQUANTIZE: 8497c478bd9Sstevel@tonic-gate rval = dt_aggregate_lquantizedcmp(laddr, raddr); 8507c478bd9Sstevel@tonic-gate break; 8517c478bd9Sstevel@tonic-gate 8527c478bd9Sstevel@tonic-gate case DTRACEAGG_COUNT: 8537c478bd9Sstevel@tonic-gate case DTRACEAGG_SUM: 8547c478bd9Sstevel@tonic-gate case DTRACEAGG_MIN: 8557c478bd9Sstevel@tonic-gate case DTRACEAGG_MAX: 8567c478bd9Sstevel@tonic-gate rval = dt_aggregate_countcmp(laddr, raddr); 8577c478bd9Sstevel@tonic-gate break; 8587c478bd9Sstevel@tonic-gate 8597c478bd9Sstevel@tonic-gate default: 8607c478bd9Sstevel@tonic-gate assert(0); 8617c478bd9Sstevel@tonic-gate } 8627c478bd9Sstevel@tonic-gate 86330ef842dSbmc return (rval); 86430ef842dSbmc } 86530ef842dSbmc 86630ef842dSbmc static int 86730ef842dSbmc dt_aggregate_valkeycmp(const void *lhs, const void *rhs) 86830ef842dSbmc { 86930ef842dSbmc int rval; 87030ef842dSbmc 87130ef842dSbmc if ((rval = dt_aggregate_valcmp(lhs, rhs)) != 0) 8727c478bd9Sstevel@tonic-gate return (rval); 8737c478bd9Sstevel@tonic-gate 8747c478bd9Sstevel@tonic-gate /* 8757c478bd9Sstevel@tonic-gate * If we're here, the values for the two aggregation elements are 8767c478bd9Sstevel@tonic-gate * equal. We already know that the key layout is the same for the two 8777c478bd9Sstevel@tonic-gate * elements; we must now compare the keys themselves as a tie-breaker. 8787c478bd9Sstevel@tonic-gate */ 8797c478bd9Sstevel@tonic-gate return (dt_aggregate_keycmp(lhs, rhs)); 8807c478bd9Sstevel@tonic-gate } 8817c478bd9Sstevel@tonic-gate 8827c478bd9Sstevel@tonic-gate static int 8837c478bd9Sstevel@tonic-gate dt_aggregate_keyvarcmp(const void *lhs, const void *rhs) 8847c478bd9Sstevel@tonic-gate { 8857c478bd9Sstevel@tonic-gate int rval; 8867c478bd9Sstevel@tonic-gate 8877c478bd9Sstevel@tonic-gate if ((rval = dt_aggregate_keycmp(lhs, rhs)) != 0) 8887c478bd9Sstevel@tonic-gate return (rval); 8897c478bd9Sstevel@tonic-gate 8907c478bd9Sstevel@tonic-gate return (dt_aggregate_varcmp(lhs, rhs)); 8917c478bd9Sstevel@tonic-gate } 8927c478bd9Sstevel@tonic-gate 8937c478bd9Sstevel@tonic-gate static int 8947c478bd9Sstevel@tonic-gate dt_aggregate_varkeycmp(const void *lhs, const void *rhs) 8957c478bd9Sstevel@tonic-gate { 8967c478bd9Sstevel@tonic-gate int rval; 8977c478bd9Sstevel@tonic-gate 8987c478bd9Sstevel@tonic-gate if ((rval = dt_aggregate_varcmp(lhs, rhs)) != 0) 8997c478bd9Sstevel@tonic-gate return (rval); 9007c478bd9Sstevel@tonic-gate 9017c478bd9Sstevel@tonic-gate return (dt_aggregate_keycmp(lhs, rhs)); 9027c478bd9Sstevel@tonic-gate } 9037c478bd9Sstevel@tonic-gate 9047c478bd9Sstevel@tonic-gate static int 9057c478bd9Sstevel@tonic-gate dt_aggregate_valvarcmp(const void *lhs, const void *rhs) 9067c478bd9Sstevel@tonic-gate { 9077c478bd9Sstevel@tonic-gate int rval; 9087c478bd9Sstevel@tonic-gate 90930ef842dSbmc if ((rval = dt_aggregate_valkeycmp(lhs, rhs)) != 0) 9107c478bd9Sstevel@tonic-gate return (rval); 9117c478bd9Sstevel@tonic-gate 9127c478bd9Sstevel@tonic-gate return (dt_aggregate_varcmp(lhs, rhs)); 9137c478bd9Sstevel@tonic-gate } 9147c478bd9Sstevel@tonic-gate 9157c478bd9Sstevel@tonic-gate static int 9167c478bd9Sstevel@tonic-gate dt_aggregate_varvalcmp(const void *lhs, const void *rhs) 9177c478bd9Sstevel@tonic-gate { 9187c478bd9Sstevel@tonic-gate int rval; 9197c478bd9Sstevel@tonic-gate 9207c478bd9Sstevel@tonic-gate if ((rval = dt_aggregate_varcmp(lhs, rhs)) != 0) 9217c478bd9Sstevel@tonic-gate return (rval); 9227c478bd9Sstevel@tonic-gate 92330ef842dSbmc return (dt_aggregate_valkeycmp(lhs, rhs)); 9247c478bd9Sstevel@tonic-gate } 9257c478bd9Sstevel@tonic-gate 9267c478bd9Sstevel@tonic-gate static int 9277c478bd9Sstevel@tonic-gate dt_aggregate_keyvarrevcmp(const void *lhs, const void *rhs) 9287c478bd9Sstevel@tonic-gate { 9297c478bd9Sstevel@tonic-gate return (dt_aggregate_keyvarcmp(rhs, lhs)); 9307c478bd9Sstevel@tonic-gate } 9317c478bd9Sstevel@tonic-gate 9327c478bd9Sstevel@tonic-gate static int 9337c478bd9Sstevel@tonic-gate dt_aggregate_varkeyrevcmp(const void *lhs, const void *rhs) 9347c478bd9Sstevel@tonic-gate { 9357c478bd9Sstevel@tonic-gate return (dt_aggregate_varkeycmp(rhs, lhs)); 9367c478bd9Sstevel@tonic-gate } 9377c478bd9Sstevel@tonic-gate 9387c478bd9Sstevel@tonic-gate static int 9397c478bd9Sstevel@tonic-gate dt_aggregate_valvarrevcmp(const void *lhs, const void *rhs) 9407c478bd9Sstevel@tonic-gate { 9417c478bd9Sstevel@tonic-gate return (dt_aggregate_valvarcmp(rhs, lhs)); 9427c478bd9Sstevel@tonic-gate } 9437c478bd9Sstevel@tonic-gate 9447c478bd9Sstevel@tonic-gate static int 9457c478bd9Sstevel@tonic-gate dt_aggregate_varvalrevcmp(const void *lhs, const void *rhs) 9467c478bd9Sstevel@tonic-gate { 9477c478bd9Sstevel@tonic-gate return (dt_aggregate_varvalcmp(rhs, lhs)); 9487c478bd9Sstevel@tonic-gate } 9497c478bd9Sstevel@tonic-gate 95030ef842dSbmc static int 95130ef842dSbmc dt_aggregate_bundlecmp(const void *lhs, const void *rhs) 95230ef842dSbmc { 95330ef842dSbmc dt_ahashent_t **lh = *((dt_ahashent_t ***)lhs); 95430ef842dSbmc dt_ahashent_t **rh = *((dt_ahashent_t ***)rhs); 95530ef842dSbmc int i, rval; 95630ef842dSbmc 95730ef842dSbmc if (dt_keysort) { 95830ef842dSbmc /* 95930ef842dSbmc * If we're sorting on keys, we need to scan until we find the 96030ef842dSbmc * last entry -- that's the representative key. (The order of 96130ef842dSbmc * the bundle is values followed by key to accommodate the 96230ef842dSbmc * default behavior of sorting by value.) If the keys are 96330ef842dSbmc * equal, we'll fall into the value comparison loop, below. 96430ef842dSbmc */ 96530ef842dSbmc for (i = 0; lh[i + 1] != NULL; i++) 96630ef842dSbmc continue; 96730ef842dSbmc 96830ef842dSbmc assert(i != 0); 96930ef842dSbmc assert(rh[i + 1] == NULL); 97030ef842dSbmc 97130ef842dSbmc if ((rval = dt_aggregate_keycmp(&lh[i], &rh[i])) != 0) 97230ef842dSbmc return (rval); 97330ef842dSbmc } 97430ef842dSbmc 97530ef842dSbmc for (i = 0; ; i++) { 97630ef842dSbmc if (lh[i + 1] == NULL) { 97730ef842dSbmc /* 97830ef842dSbmc * All of the values are equal; if we're sorting on 97930ef842dSbmc * keys, then we're only here because the keys were 98030ef842dSbmc * found to be equal and these records are therefore 98130ef842dSbmc * equal. If we're not sorting on keys, we'll use the 98230ef842dSbmc * key comparison from the representative key as the 98330ef842dSbmc * tie-breaker. 98430ef842dSbmc */ 98530ef842dSbmc if (dt_keysort) 98630ef842dSbmc return (0); 98730ef842dSbmc 98830ef842dSbmc assert(i != 0); 98930ef842dSbmc assert(rh[i + 1] == NULL); 99030ef842dSbmc return (dt_aggregate_keycmp(&lh[i], &rh[i])); 99130ef842dSbmc } else { 99230ef842dSbmc if ((rval = dt_aggregate_valcmp(&lh[i], &rh[i])) != 0) 99330ef842dSbmc return (rval); 99430ef842dSbmc } 99530ef842dSbmc } 99630ef842dSbmc } 99730ef842dSbmc 9987c478bd9Sstevel@tonic-gate int 9997c478bd9Sstevel@tonic-gate dt_aggregate_go(dtrace_hdl_t *dtp) 10007c478bd9Sstevel@tonic-gate { 10017c478bd9Sstevel@tonic-gate dt_aggregate_t *agp = &dtp->dt_aggregate; 10027c478bd9Sstevel@tonic-gate dtrace_optval_t size, cpu; 10037c478bd9Sstevel@tonic-gate dtrace_bufdesc_t *buf = &agp->dtat_buf; 10047c478bd9Sstevel@tonic-gate int rval, i; 10057c478bd9Sstevel@tonic-gate 10067c478bd9Sstevel@tonic-gate assert(agp->dtat_maxcpu == 0); 10077c478bd9Sstevel@tonic-gate assert(agp->dtat_ncpu == 0); 10087c478bd9Sstevel@tonic-gate assert(agp->dtat_cpus == NULL); 10097c478bd9Sstevel@tonic-gate 10107c478bd9Sstevel@tonic-gate agp->dtat_maxcpu = dt_sysconf(dtp, _SC_CPUID_MAX) + 1; 10117c478bd9Sstevel@tonic-gate agp->dtat_ncpu = dt_sysconf(dtp, _SC_NPROCESSORS_MAX); 10127c478bd9Sstevel@tonic-gate agp->dtat_cpus = malloc(agp->dtat_ncpu * sizeof (processorid_t)); 10137c478bd9Sstevel@tonic-gate 10147c478bd9Sstevel@tonic-gate if (agp->dtat_cpus == NULL) 10157c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_NOMEM)); 10167c478bd9Sstevel@tonic-gate 10177c478bd9Sstevel@tonic-gate /* 10187c478bd9Sstevel@tonic-gate * Use the aggregation buffer size as reloaded from the kernel. 10197c478bd9Sstevel@tonic-gate */ 10207c478bd9Sstevel@tonic-gate size = dtp->dt_options[DTRACEOPT_AGGSIZE]; 10217c478bd9Sstevel@tonic-gate 10227c478bd9Sstevel@tonic-gate rval = dtrace_getopt(dtp, "aggsize", &size); 10237c478bd9Sstevel@tonic-gate assert(rval == 0); 10247c478bd9Sstevel@tonic-gate 10257c478bd9Sstevel@tonic-gate if (size == 0 || size == DTRACEOPT_UNSET) 10267c478bd9Sstevel@tonic-gate return (0); 10277c478bd9Sstevel@tonic-gate 10287c478bd9Sstevel@tonic-gate buf = &agp->dtat_buf; 10297c478bd9Sstevel@tonic-gate buf->dtbd_size = size; 10307c478bd9Sstevel@tonic-gate 10317c478bd9Sstevel@tonic-gate if ((buf->dtbd_data = malloc(buf->dtbd_size)) == NULL) 10327c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_NOMEM)); 10337c478bd9Sstevel@tonic-gate 10347c478bd9Sstevel@tonic-gate /* 10357c478bd9Sstevel@tonic-gate * Now query for the CPUs enabled. 10367c478bd9Sstevel@tonic-gate */ 10377c478bd9Sstevel@tonic-gate rval = dtrace_getopt(dtp, "cpu", &cpu); 10387c478bd9Sstevel@tonic-gate assert(rval == 0 && cpu != DTRACEOPT_UNSET); 10397c478bd9Sstevel@tonic-gate 10407c478bd9Sstevel@tonic-gate if (cpu != DTRACE_CPUALL) { 10417c478bd9Sstevel@tonic-gate assert(cpu < agp->dtat_ncpu); 10427c478bd9Sstevel@tonic-gate agp->dtat_cpus[agp->dtat_ncpus++] = (processorid_t)cpu; 10437c478bd9Sstevel@tonic-gate 10447c478bd9Sstevel@tonic-gate return (0); 10457c478bd9Sstevel@tonic-gate } 10467c478bd9Sstevel@tonic-gate 10477c478bd9Sstevel@tonic-gate agp->dtat_ncpus = 0; 10487c478bd9Sstevel@tonic-gate for (i = 0; i < agp->dtat_maxcpu; i++) { 10497c478bd9Sstevel@tonic-gate if (dt_status(dtp, i) == -1) 10507c478bd9Sstevel@tonic-gate continue; 10517c478bd9Sstevel@tonic-gate 10527c478bd9Sstevel@tonic-gate agp->dtat_cpus[agp->dtat_ncpus++] = i; 10537c478bd9Sstevel@tonic-gate } 10547c478bd9Sstevel@tonic-gate 10557c478bd9Sstevel@tonic-gate return (0); 10567c478bd9Sstevel@tonic-gate } 10577c478bd9Sstevel@tonic-gate 10587c478bd9Sstevel@tonic-gate static int 10597c478bd9Sstevel@tonic-gate dt_aggwalk_rval(dtrace_hdl_t *dtp, dt_ahashent_t *h, int rval) 10607c478bd9Sstevel@tonic-gate { 10617c478bd9Sstevel@tonic-gate dt_aggregate_t *agp = &dtp->dt_aggregate; 10627c478bd9Sstevel@tonic-gate dtrace_aggdata_t *data; 10637c478bd9Sstevel@tonic-gate dtrace_aggdesc_t *aggdesc; 10647c478bd9Sstevel@tonic-gate dtrace_recdesc_t *rec; 10657c478bd9Sstevel@tonic-gate int i; 10667c478bd9Sstevel@tonic-gate 10677c478bd9Sstevel@tonic-gate switch (rval) { 10687c478bd9Sstevel@tonic-gate case DTRACE_AGGWALK_NEXT: 10697c478bd9Sstevel@tonic-gate break; 10707c478bd9Sstevel@tonic-gate 10717c478bd9Sstevel@tonic-gate case DTRACE_AGGWALK_CLEAR: { 10727c478bd9Sstevel@tonic-gate uint32_t size, offs = 0; 10737c478bd9Sstevel@tonic-gate 10747c478bd9Sstevel@tonic-gate aggdesc = h->dtahe_data.dtada_desc; 10757c478bd9Sstevel@tonic-gate rec = &aggdesc->dtagd_rec[aggdesc->dtagd_nrecs - 1]; 10767c478bd9Sstevel@tonic-gate size = rec->dtrd_size; 10777c478bd9Sstevel@tonic-gate data = &h->dtahe_data; 10787c478bd9Sstevel@tonic-gate 10797c478bd9Sstevel@tonic-gate if (rec->dtrd_action == DTRACEAGG_LQUANTIZE) { 10807c478bd9Sstevel@tonic-gate offs = sizeof (uint64_t); 10817c478bd9Sstevel@tonic-gate size -= sizeof (uint64_t); 10827c478bd9Sstevel@tonic-gate } 10837c478bd9Sstevel@tonic-gate 10847c478bd9Sstevel@tonic-gate bzero(&data->dtada_data[rec->dtrd_offset] + offs, size); 10857c478bd9Sstevel@tonic-gate 10867c478bd9Sstevel@tonic-gate if (data->dtada_percpu == NULL) 10877c478bd9Sstevel@tonic-gate break; 10887c478bd9Sstevel@tonic-gate 10897c478bd9Sstevel@tonic-gate for (i = 0; i < dtp->dt_aggregate.dtat_maxcpu; i++) 10907c478bd9Sstevel@tonic-gate bzero(data->dtada_percpu[i] + offs, size); 10917c478bd9Sstevel@tonic-gate break; 10927c478bd9Sstevel@tonic-gate } 10937c478bd9Sstevel@tonic-gate 10947c478bd9Sstevel@tonic-gate case DTRACE_AGGWALK_ERROR: 10957c478bd9Sstevel@tonic-gate /* 10967c478bd9Sstevel@tonic-gate * We assume that errno is already set in this case. 10977c478bd9Sstevel@tonic-gate */ 10987c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, errno)); 10997c478bd9Sstevel@tonic-gate 11007c478bd9Sstevel@tonic-gate case DTRACE_AGGWALK_ABORT: 11017c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_DIRABORT)); 11027c478bd9Sstevel@tonic-gate 11037c478bd9Sstevel@tonic-gate case DTRACE_AGGWALK_DENORMALIZE: 11047c478bd9Sstevel@tonic-gate h->dtahe_data.dtada_normal = 1; 11057c478bd9Sstevel@tonic-gate return (0); 11067c478bd9Sstevel@tonic-gate 11077c478bd9Sstevel@tonic-gate case DTRACE_AGGWALK_NORMALIZE: 11087c478bd9Sstevel@tonic-gate if (h->dtahe_data.dtada_normal == 0) { 11097c478bd9Sstevel@tonic-gate h->dtahe_data.dtada_normal = 1; 11107c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_BADRVAL)); 11117c478bd9Sstevel@tonic-gate } 11127c478bd9Sstevel@tonic-gate 11137c478bd9Sstevel@tonic-gate return (0); 11147c478bd9Sstevel@tonic-gate 11157c478bd9Sstevel@tonic-gate case DTRACE_AGGWALK_REMOVE: { 11167c478bd9Sstevel@tonic-gate dtrace_aggdata_t *aggdata = &h->dtahe_data; 11177c478bd9Sstevel@tonic-gate int i, max_cpus = agp->dtat_maxcpu; 11187c478bd9Sstevel@tonic-gate 11197c478bd9Sstevel@tonic-gate /* 11207c478bd9Sstevel@tonic-gate * First, remove this hash entry from its hash chain. 11217c478bd9Sstevel@tonic-gate */ 11227c478bd9Sstevel@tonic-gate if (h->dtahe_prev != NULL) { 11237c478bd9Sstevel@tonic-gate h->dtahe_prev->dtahe_next = h->dtahe_next; 11247c478bd9Sstevel@tonic-gate } else { 11257c478bd9Sstevel@tonic-gate dt_ahash_t *hash = &agp->dtat_hash; 11267c478bd9Sstevel@tonic-gate size_t ndx = h->dtahe_hashval % hash->dtah_size; 11277c478bd9Sstevel@tonic-gate 11287c478bd9Sstevel@tonic-gate assert(hash->dtah_hash[ndx] == h); 11297c478bd9Sstevel@tonic-gate hash->dtah_hash[ndx] = h->dtahe_next; 11307c478bd9Sstevel@tonic-gate } 11317c478bd9Sstevel@tonic-gate 11327c478bd9Sstevel@tonic-gate if (h->dtahe_next != NULL) 11337c478bd9Sstevel@tonic-gate h->dtahe_next->dtahe_prev = h->dtahe_prev; 11347c478bd9Sstevel@tonic-gate 11357c478bd9Sstevel@tonic-gate /* 11367c478bd9Sstevel@tonic-gate * Now remove it from the list of all hash entries. 11377c478bd9Sstevel@tonic-gate */ 11387c478bd9Sstevel@tonic-gate if (h->dtahe_prevall != NULL) { 11397c478bd9Sstevel@tonic-gate h->dtahe_prevall->dtahe_nextall = h->dtahe_nextall; 11407c478bd9Sstevel@tonic-gate } else { 11417c478bd9Sstevel@tonic-gate dt_ahash_t *hash = &agp->dtat_hash; 11427c478bd9Sstevel@tonic-gate 11437c478bd9Sstevel@tonic-gate assert(hash->dtah_all == h); 11447c478bd9Sstevel@tonic-gate hash->dtah_all = h->dtahe_nextall; 11457c478bd9Sstevel@tonic-gate } 11467c478bd9Sstevel@tonic-gate 11477c478bd9Sstevel@tonic-gate if (h->dtahe_nextall != NULL) 11487c478bd9Sstevel@tonic-gate h->dtahe_nextall->dtahe_prevall = h->dtahe_prevall; 11497c478bd9Sstevel@tonic-gate 11507c478bd9Sstevel@tonic-gate /* 11517c478bd9Sstevel@tonic-gate * We're unlinked. We can safely destroy the data. 11527c478bd9Sstevel@tonic-gate */ 11537c478bd9Sstevel@tonic-gate if (aggdata->dtada_percpu != NULL) { 11547c478bd9Sstevel@tonic-gate for (i = 0; i < max_cpus; i++) 11557c478bd9Sstevel@tonic-gate free(aggdata->dtada_percpu[i]); 11567c478bd9Sstevel@tonic-gate free(aggdata->dtada_percpu); 11577c478bd9Sstevel@tonic-gate } 11587c478bd9Sstevel@tonic-gate 11597c478bd9Sstevel@tonic-gate free(aggdata->dtada_data); 11607c478bd9Sstevel@tonic-gate free(h); 11617c478bd9Sstevel@tonic-gate 11627c478bd9Sstevel@tonic-gate return (0); 11637c478bd9Sstevel@tonic-gate } 11647c478bd9Sstevel@tonic-gate 11657c478bd9Sstevel@tonic-gate default: 11667c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, EDT_BADRVAL)); 11677c478bd9Sstevel@tonic-gate } 11687c478bd9Sstevel@tonic-gate 11697c478bd9Sstevel@tonic-gate return (0); 11707c478bd9Sstevel@tonic-gate } 11717c478bd9Sstevel@tonic-gate 117230ef842dSbmc void 117330ef842dSbmc dt_aggregate_qsort(dtrace_hdl_t *dtp, void *base, size_t nel, size_t width, 117430ef842dSbmc int (*compar)(const void *, const void *)) 117530ef842dSbmc { 117630ef842dSbmc int rev = dt_revsort, key = dt_keysort, keypos = dt_keypos; 117730ef842dSbmc dtrace_optval_t keyposopt = dtp->dt_options[DTRACEOPT_AGGSORTKEYPOS]; 117830ef842dSbmc 117930ef842dSbmc dt_revsort = (dtp->dt_options[DTRACEOPT_AGGSORTREV] != DTRACEOPT_UNSET); 118030ef842dSbmc dt_keysort = (dtp->dt_options[DTRACEOPT_AGGSORTKEY] != DTRACEOPT_UNSET); 118130ef842dSbmc 118230ef842dSbmc if (keyposopt != DTRACEOPT_UNSET && keyposopt <= INT_MAX) { 118330ef842dSbmc dt_keypos = (int)keyposopt; 118430ef842dSbmc } else { 118530ef842dSbmc dt_keypos = 0; 118630ef842dSbmc } 118730ef842dSbmc 118830ef842dSbmc if (compar == NULL) { 118930ef842dSbmc if (!dt_keysort) { 119030ef842dSbmc compar = dt_aggregate_varvalcmp; 119130ef842dSbmc } else { 119230ef842dSbmc compar = dt_aggregate_varkeycmp; 119330ef842dSbmc } 119430ef842dSbmc } 119530ef842dSbmc 119630ef842dSbmc qsort(base, nel, width, compar); 119730ef842dSbmc 119830ef842dSbmc dt_revsort = rev; 119930ef842dSbmc dt_keysort = key; 120030ef842dSbmc dt_keypos = keypos; 120130ef842dSbmc } 120230ef842dSbmc 12037c478bd9Sstevel@tonic-gate int 12047c478bd9Sstevel@tonic-gate dtrace_aggregate_walk(dtrace_hdl_t *dtp, dtrace_aggregate_f *func, void *arg) 12057c478bd9Sstevel@tonic-gate { 12067c478bd9Sstevel@tonic-gate dt_ahashent_t *h, *next; 12077c478bd9Sstevel@tonic-gate dt_ahash_t *hash = &dtp->dt_aggregate.dtat_hash; 12087c478bd9Sstevel@tonic-gate 12097c478bd9Sstevel@tonic-gate for (h = hash->dtah_all; h != NULL; h = next) { 12107c478bd9Sstevel@tonic-gate /* 12117c478bd9Sstevel@tonic-gate * dt_aggwalk_rval() can potentially remove the current hash 12127c478bd9Sstevel@tonic-gate * entry; we need to load the next hash entry before calling 12137c478bd9Sstevel@tonic-gate * into it. 12147c478bd9Sstevel@tonic-gate */ 12157c478bd9Sstevel@tonic-gate next = h->dtahe_nextall; 12167c478bd9Sstevel@tonic-gate 12177c478bd9Sstevel@tonic-gate if (dt_aggwalk_rval(dtp, h, func(&h->dtahe_data, arg)) == -1) 12187c478bd9Sstevel@tonic-gate return (-1); 12197c478bd9Sstevel@tonic-gate } 12207c478bd9Sstevel@tonic-gate 12217c478bd9Sstevel@tonic-gate return (0); 12227c478bd9Sstevel@tonic-gate } 12237c478bd9Sstevel@tonic-gate 12247c478bd9Sstevel@tonic-gate static int 12257c478bd9Sstevel@tonic-gate dt_aggregate_walk_sorted(dtrace_hdl_t *dtp, 12267c478bd9Sstevel@tonic-gate dtrace_aggregate_f *func, void *arg, 12277c478bd9Sstevel@tonic-gate int (*sfunc)(const void *, const void *)) 12287c478bd9Sstevel@tonic-gate { 12297c478bd9Sstevel@tonic-gate dt_aggregate_t *agp = &dtp->dt_aggregate; 12307c478bd9Sstevel@tonic-gate dt_ahashent_t *h, **sorted; 12317c478bd9Sstevel@tonic-gate dt_ahash_t *hash = &agp->dtat_hash; 12327c478bd9Sstevel@tonic-gate size_t i, nentries = 0; 12337c478bd9Sstevel@tonic-gate 12347c478bd9Sstevel@tonic-gate for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) 12357c478bd9Sstevel@tonic-gate nentries++; 12367c478bd9Sstevel@tonic-gate 123730ef842dSbmc sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *)); 12387c478bd9Sstevel@tonic-gate 12397c478bd9Sstevel@tonic-gate if (sorted == NULL) 124030ef842dSbmc return (-1); 12417c478bd9Sstevel@tonic-gate 12427c478bd9Sstevel@tonic-gate for (h = hash->dtah_all, i = 0; h != NULL; h = h->dtahe_nextall) 12437c478bd9Sstevel@tonic-gate sorted[i++] = h; 12447c478bd9Sstevel@tonic-gate 124530ef842dSbmc (void) pthread_mutex_lock(&dt_qsort_lock); 124630ef842dSbmc 124730ef842dSbmc if (sfunc == NULL) { 124830ef842dSbmc dt_aggregate_qsort(dtp, sorted, nentries, 124930ef842dSbmc sizeof (dt_ahashent_t *), NULL); 125030ef842dSbmc } else { 125130ef842dSbmc /* 125230ef842dSbmc * If we've been explicitly passed a sorting function, 125330ef842dSbmc * we'll use that -- ignoring the values of the "aggsortrev", 125430ef842dSbmc * "aggsortkey" and "aggsortkeypos" options. 125530ef842dSbmc */ 125630ef842dSbmc qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc); 125730ef842dSbmc } 125830ef842dSbmc 125930ef842dSbmc (void) pthread_mutex_unlock(&dt_qsort_lock); 12607c478bd9Sstevel@tonic-gate 12617c478bd9Sstevel@tonic-gate for (i = 0; i < nentries; i++) { 12627c478bd9Sstevel@tonic-gate h = sorted[i]; 12637c478bd9Sstevel@tonic-gate 126430ef842dSbmc if (dt_aggwalk_rval(dtp, h, func(&h->dtahe_data, arg)) == -1) { 126530ef842dSbmc dt_free(dtp, sorted); 12667c478bd9Sstevel@tonic-gate return (-1); 126730ef842dSbmc } 12687c478bd9Sstevel@tonic-gate } 12697c478bd9Sstevel@tonic-gate 127030ef842dSbmc dt_free(dtp, sorted); 12717c478bd9Sstevel@tonic-gate return (0); 12727c478bd9Sstevel@tonic-gate } 12737c478bd9Sstevel@tonic-gate 127430ef842dSbmc int 127530ef842dSbmc dtrace_aggregate_walk_sorted(dtrace_hdl_t *dtp, 127630ef842dSbmc dtrace_aggregate_f *func, void *arg) 127730ef842dSbmc { 127830ef842dSbmc return (dt_aggregate_walk_sorted(dtp, func, arg, NULL)); 127930ef842dSbmc } 128030ef842dSbmc 12817c478bd9Sstevel@tonic-gate int 12827c478bd9Sstevel@tonic-gate dtrace_aggregate_walk_keysorted(dtrace_hdl_t *dtp, 12837c478bd9Sstevel@tonic-gate dtrace_aggregate_f *func, void *arg) 12847c478bd9Sstevel@tonic-gate { 12857c478bd9Sstevel@tonic-gate return (dt_aggregate_walk_sorted(dtp, func, 12867c478bd9Sstevel@tonic-gate arg, dt_aggregate_varkeycmp)); 12877c478bd9Sstevel@tonic-gate } 12887c478bd9Sstevel@tonic-gate 12897c478bd9Sstevel@tonic-gate int 12907c478bd9Sstevel@tonic-gate dtrace_aggregate_walk_valsorted(dtrace_hdl_t *dtp, 12917c478bd9Sstevel@tonic-gate dtrace_aggregate_f *func, void *arg) 12927c478bd9Sstevel@tonic-gate { 12937c478bd9Sstevel@tonic-gate return (dt_aggregate_walk_sorted(dtp, func, 12947c478bd9Sstevel@tonic-gate arg, dt_aggregate_varvalcmp)); 12957c478bd9Sstevel@tonic-gate } 12967c478bd9Sstevel@tonic-gate 12977c478bd9Sstevel@tonic-gate int 12987c478bd9Sstevel@tonic-gate dtrace_aggregate_walk_keyvarsorted(dtrace_hdl_t *dtp, 12997c478bd9Sstevel@tonic-gate dtrace_aggregate_f *func, void *arg) 13007c478bd9Sstevel@tonic-gate { 13017c478bd9Sstevel@tonic-gate return (dt_aggregate_walk_sorted(dtp, func, 13027c478bd9Sstevel@tonic-gate arg, dt_aggregate_keyvarcmp)); 13037c478bd9Sstevel@tonic-gate } 13047c478bd9Sstevel@tonic-gate 13057c478bd9Sstevel@tonic-gate int 13067c478bd9Sstevel@tonic-gate dtrace_aggregate_walk_valvarsorted(dtrace_hdl_t *dtp, 13077c478bd9Sstevel@tonic-gate dtrace_aggregate_f *func, void *arg) 13087c478bd9Sstevel@tonic-gate { 13097c478bd9Sstevel@tonic-gate return (dt_aggregate_walk_sorted(dtp, func, 13107c478bd9Sstevel@tonic-gate arg, dt_aggregate_valvarcmp)); 13117c478bd9Sstevel@tonic-gate } 13127c478bd9Sstevel@tonic-gate 13137c478bd9Sstevel@tonic-gate int 13147c478bd9Sstevel@tonic-gate dtrace_aggregate_walk_keyrevsorted(dtrace_hdl_t *dtp, 13157c478bd9Sstevel@tonic-gate dtrace_aggregate_f *func, void *arg) 13167c478bd9Sstevel@tonic-gate { 13177c478bd9Sstevel@tonic-gate return (dt_aggregate_walk_sorted(dtp, func, 13187c478bd9Sstevel@tonic-gate arg, dt_aggregate_varkeyrevcmp)); 13197c478bd9Sstevel@tonic-gate } 13207c478bd9Sstevel@tonic-gate 13217c478bd9Sstevel@tonic-gate int 13227c478bd9Sstevel@tonic-gate dtrace_aggregate_walk_valrevsorted(dtrace_hdl_t *dtp, 13237c478bd9Sstevel@tonic-gate dtrace_aggregate_f *func, void *arg) 13247c478bd9Sstevel@tonic-gate { 13257c478bd9Sstevel@tonic-gate return (dt_aggregate_walk_sorted(dtp, func, 13267c478bd9Sstevel@tonic-gate arg, dt_aggregate_varvalrevcmp)); 13277c478bd9Sstevel@tonic-gate } 13287c478bd9Sstevel@tonic-gate 13297c478bd9Sstevel@tonic-gate int 13307c478bd9Sstevel@tonic-gate dtrace_aggregate_walk_keyvarrevsorted(dtrace_hdl_t *dtp, 13317c478bd9Sstevel@tonic-gate dtrace_aggregate_f *func, void *arg) 13327c478bd9Sstevel@tonic-gate { 13337c478bd9Sstevel@tonic-gate return (dt_aggregate_walk_sorted(dtp, func, 13347c478bd9Sstevel@tonic-gate arg, dt_aggregate_keyvarrevcmp)); 13357c478bd9Sstevel@tonic-gate } 13367c478bd9Sstevel@tonic-gate 13377c478bd9Sstevel@tonic-gate int 13387c478bd9Sstevel@tonic-gate dtrace_aggregate_walk_valvarrevsorted(dtrace_hdl_t *dtp, 13397c478bd9Sstevel@tonic-gate dtrace_aggregate_f *func, void *arg) 13407c478bd9Sstevel@tonic-gate { 13417c478bd9Sstevel@tonic-gate return (dt_aggregate_walk_sorted(dtp, func, 13427c478bd9Sstevel@tonic-gate arg, dt_aggregate_valvarrevcmp)); 13437c478bd9Sstevel@tonic-gate } 13447c478bd9Sstevel@tonic-gate 134530ef842dSbmc int 134630ef842dSbmc dtrace_aggregate_walk_joined(dtrace_hdl_t *dtp, dtrace_aggvarid_t *aggvars, 134730ef842dSbmc int naggvars, dtrace_aggregate_walk_joined_f *func, void *arg) 134830ef842dSbmc { 134930ef842dSbmc dt_aggregate_t *agp = &dtp->dt_aggregate; 135030ef842dSbmc dt_ahashent_t *h, **sorted = NULL, ***bundle, **nbundle; 135130ef842dSbmc const dtrace_aggdata_t **data; 135230ef842dSbmc dt_ahashent_t *zaggdata = NULL; 135330ef842dSbmc dt_ahash_t *hash = &agp->dtat_hash; 135430ef842dSbmc size_t nentries = 0, nbundles = 0, start, zsize = 0, bundlesize; 135530ef842dSbmc dtrace_aggvarid_t max = 0, aggvar; 135630ef842dSbmc int rval = -1, *map, *remap = NULL; 135730ef842dSbmc int i, j; 135830ef842dSbmc dtrace_optval_t sortpos = dtp->dt_options[DTRACEOPT_AGGSORTPOS]; 135930ef842dSbmc 136030ef842dSbmc /* 136130ef842dSbmc * If the sorting position is greater than the number of aggregation 136230ef842dSbmc * variable IDs, we silently set it to 0. 136330ef842dSbmc */ 136430ef842dSbmc if (sortpos == DTRACEOPT_UNSET || sortpos >= naggvars) 136530ef842dSbmc sortpos = 0; 136630ef842dSbmc 136730ef842dSbmc /* 136830ef842dSbmc * First we need to translate the specified aggregation variable IDs 136930ef842dSbmc * into a linear map that will allow us to translate an aggregation 137030ef842dSbmc * variable ID into its position in the specified aggvars. 137130ef842dSbmc */ 137230ef842dSbmc for (i = 0; i < naggvars; i++) { 137330ef842dSbmc if (aggvars[i] == DTRACE_AGGVARIDNONE || aggvars[i] < 0) 137430ef842dSbmc return (dt_set_errno(dtp, EDT_BADAGGVAR)); 137530ef842dSbmc 137630ef842dSbmc if (aggvars[i] > max) 137730ef842dSbmc max = aggvars[i]; 137830ef842dSbmc } 137930ef842dSbmc 138030ef842dSbmc if ((map = dt_zalloc(dtp, (max + 1) * sizeof (int))) == NULL) 138130ef842dSbmc return (-1); 138230ef842dSbmc 138330ef842dSbmc zaggdata = dt_zalloc(dtp, naggvars * sizeof (dt_ahashent_t)); 138430ef842dSbmc 138530ef842dSbmc if (zaggdata == NULL) 138630ef842dSbmc goto out; 138730ef842dSbmc 138830ef842dSbmc for (i = 0; i < naggvars; i++) { 138930ef842dSbmc int ndx = i + sortpos; 139030ef842dSbmc 139130ef842dSbmc if (ndx >= naggvars) 139230ef842dSbmc ndx -= naggvars; 139330ef842dSbmc 139430ef842dSbmc aggvar = aggvars[ndx]; 139530ef842dSbmc assert(aggvar <= max); 139630ef842dSbmc 139730ef842dSbmc if (map[aggvar]) { 139830ef842dSbmc /* 139930ef842dSbmc * We have an aggregation variable that is present 140030ef842dSbmc * more than once in the array of aggregation 140130ef842dSbmc * variables. While it's unclear why one might want 140230ef842dSbmc * to do this, it's legal. To support this construct, 140330ef842dSbmc * we will allocate a remap that will indicate the 140430ef842dSbmc * position from which this aggregation variable 140530ef842dSbmc * should be pulled. (That is, where the remap will 140630ef842dSbmc * map from one position to another.) 140730ef842dSbmc */ 140830ef842dSbmc if (remap == NULL) { 140930ef842dSbmc remap = dt_zalloc(dtp, naggvars * sizeof (int)); 141030ef842dSbmc 141130ef842dSbmc if (remap == NULL) 141230ef842dSbmc goto out; 141330ef842dSbmc } 141430ef842dSbmc 141530ef842dSbmc /* 141630ef842dSbmc * Given that the variable is already present, assert 141730ef842dSbmc * that following through the mapping and adjusting 141830ef842dSbmc * for the sort position yields the same aggregation 141930ef842dSbmc * variable ID. 142030ef842dSbmc */ 142130ef842dSbmc assert(aggvars[(map[aggvar] - 1 + sortpos) % 142230ef842dSbmc naggvars] == aggvars[ndx]); 142330ef842dSbmc 142430ef842dSbmc remap[i] = map[aggvar]; 142530ef842dSbmc continue; 142630ef842dSbmc } 142730ef842dSbmc 142830ef842dSbmc map[aggvar] = i + 1; 142930ef842dSbmc } 143030ef842dSbmc 143130ef842dSbmc /* 143230ef842dSbmc * We need to take two passes over the data to size our allocation, so 143330ef842dSbmc * we'll use the first pass to also fill in the zero-filled data to be 143430ef842dSbmc * used to properly format a zero-valued aggregation. 143530ef842dSbmc */ 143630ef842dSbmc for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) { 143730ef842dSbmc dtrace_aggvarid_t id; 143830ef842dSbmc int ndx; 143930ef842dSbmc 144030ef842dSbmc if ((id = dt_aggregate_aggvarid(h)) > max || !(ndx = map[id])) 144130ef842dSbmc continue; 144230ef842dSbmc 144330ef842dSbmc if (zaggdata[ndx - 1].dtahe_size == 0) { 144430ef842dSbmc zaggdata[ndx - 1].dtahe_size = h->dtahe_size; 144530ef842dSbmc zaggdata[ndx - 1].dtahe_data = h->dtahe_data; 144630ef842dSbmc } 144730ef842dSbmc 144830ef842dSbmc nentries++; 144930ef842dSbmc } 145030ef842dSbmc 145130ef842dSbmc if (nentries == 0) { 145230ef842dSbmc /* 145330ef842dSbmc * We couldn't find any entries; there is nothing else to do. 145430ef842dSbmc */ 145530ef842dSbmc rval = 0; 145630ef842dSbmc goto out; 145730ef842dSbmc } 145830ef842dSbmc 145930ef842dSbmc /* 146030ef842dSbmc * Before we sort the data, we're going to look for any holes in our 146130ef842dSbmc * zero-filled data. This will occur if an aggregation variable that 146230ef842dSbmc * we are being asked to print has not yet been assigned the result of 146330ef842dSbmc * any aggregating action for _any_ tuple. The issue becomes that we 146430ef842dSbmc * would like a zero value to be printed for all columns for this 146530ef842dSbmc * aggregation, but without any record description, we don't know the 146630ef842dSbmc * aggregating action that corresponds to the aggregation variable. To 146730ef842dSbmc * try to find a match, we're simply going to lookup aggregation IDs 146830ef842dSbmc * (which are guaranteed to be contiguous and to start from 1), looking 146930ef842dSbmc * for the specified aggregation variable ID. If we find a match, 147030ef842dSbmc * we'll use that. If we iterate over all aggregation IDs and don't 147130ef842dSbmc * find a match, then we must be an anonymous enabling. (Anonymous 147230ef842dSbmc * enablings can't currently derive either aggregation variable IDs or 147330ef842dSbmc * aggregation variable names given only an aggregation ID.) In this 147430ef842dSbmc * obscure case (anonymous enabling, multiple aggregation printa() with 147530ef842dSbmc * some aggregations not represented for any tuple), our defined 147630ef842dSbmc * behavior is that the zero will be printed in the format of the first 147730ef842dSbmc * aggregation variable that contains any non-zero value. 147830ef842dSbmc */ 147930ef842dSbmc for (i = 0; i < naggvars; i++) { 148030ef842dSbmc if (zaggdata[i].dtahe_size == 0) { 148130ef842dSbmc dtrace_aggvarid_t aggvar; 148230ef842dSbmc 148330ef842dSbmc aggvar = aggvars[(i - sortpos + naggvars) % naggvars]; 148430ef842dSbmc assert(zaggdata[i].dtahe_data.dtada_data == NULL); 148530ef842dSbmc 148630ef842dSbmc for (j = DTRACE_AGGIDNONE + 1; ; j++) { 148730ef842dSbmc dtrace_aggdesc_t *agg; 148830ef842dSbmc dtrace_aggdata_t *aggdata; 148930ef842dSbmc 149030ef842dSbmc if (dt_aggid_lookup(dtp, j, &agg) != 0) 149130ef842dSbmc break; 149230ef842dSbmc 149330ef842dSbmc if (agg->dtagd_varid != aggvar) 149430ef842dSbmc continue; 149530ef842dSbmc 149630ef842dSbmc /* 149730ef842dSbmc * We have our description -- now we need to 149830ef842dSbmc * cons up the zaggdata entry for it. 149930ef842dSbmc */ 150030ef842dSbmc aggdata = &zaggdata[i].dtahe_data; 150130ef842dSbmc aggdata->dtada_size = agg->dtagd_size; 150230ef842dSbmc aggdata->dtada_desc = agg; 150330ef842dSbmc aggdata->dtada_handle = dtp; 150430ef842dSbmc (void) dt_epid_lookup(dtp, agg->dtagd_epid, 150530ef842dSbmc &aggdata->dtada_edesc, 150630ef842dSbmc &aggdata->dtada_pdesc); 150730ef842dSbmc aggdata->dtada_normal = 1; 150830ef842dSbmc zaggdata[i].dtahe_hashval = 0; 150930ef842dSbmc zaggdata[i].dtahe_size = agg->dtagd_size; 151030ef842dSbmc break; 151130ef842dSbmc } 151230ef842dSbmc 151330ef842dSbmc if (zaggdata[i].dtahe_size == 0) { 151430ef842dSbmc caddr_t data; 151530ef842dSbmc 151630ef842dSbmc /* 151730ef842dSbmc * We couldn't find this aggregation, meaning 151830ef842dSbmc * that we have never seen it before for any 151930ef842dSbmc * tuple _and_ this is an anonymous enabling. 152030ef842dSbmc * That is, we're in the obscure case outlined 152130ef842dSbmc * above. In this case, our defined behavior 152230ef842dSbmc * is to format the data in the format of the 152330ef842dSbmc * first non-zero aggregation -- of which, of 152430ef842dSbmc * course, we know there to be at least one 152530ef842dSbmc * (or nentries would have been zero). 152630ef842dSbmc */ 152730ef842dSbmc for (j = 0; j < naggvars; j++) { 152830ef842dSbmc if (zaggdata[j].dtahe_size != 0) 152930ef842dSbmc break; 153030ef842dSbmc } 153130ef842dSbmc 153230ef842dSbmc assert(j < naggvars); 153330ef842dSbmc zaggdata[i] = zaggdata[j]; 153430ef842dSbmc 153530ef842dSbmc data = zaggdata[i].dtahe_data.dtada_data; 153630ef842dSbmc assert(data != NULL); 153730ef842dSbmc } 153830ef842dSbmc } 153930ef842dSbmc } 154030ef842dSbmc 154130ef842dSbmc /* 154230ef842dSbmc * Now we need to allocate our zero-filled data for use for 154330ef842dSbmc * aggregations that don't have a value corresponding to a given key. 154430ef842dSbmc */ 154530ef842dSbmc for (i = 0; i < naggvars; i++) { 154630ef842dSbmc dtrace_aggdata_t *aggdata = &zaggdata[i].dtahe_data; 154730ef842dSbmc dtrace_aggdesc_t *aggdesc = aggdata->dtada_desc; 154830ef842dSbmc dtrace_recdesc_t *rec; 154930ef842dSbmc uint64_t larg; 155030ef842dSbmc caddr_t zdata; 155130ef842dSbmc 155230ef842dSbmc zsize = zaggdata[i].dtahe_size; 155330ef842dSbmc assert(zsize != 0); 155430ef842dSbmc 155530ef842dSbmc if ((zdata = dt_zalloc(dtp, zsize)) == NULL) { 155630ef842dSbmc /* 155730ef842dSbmc * If we failed to allocated some zero-filled data, we 155830ef842dSbmc * need to zero out the remaining dtada_data pointers 155930ef842dSbmc * to prevent the wrong data from being freed below. 156030ef842dSbmc */ 156130ef842dSbmc for (j = i; j < naggvars; j++) 156230ef842dSbmc zaggdata[j].dtahe_data.dtada_data = NULL; 156330ef842dSbmc goto out; 156430ef842dSbmc } 156530ef842dSbmc 156630ef842dSbmc aggvar = aggvars[(i - sortpos + naggvars) % naggvars]; 156730ef842dSbmc 156830ef842dSbmc /* 156930ef842dSbmc * First, the easy bit. To maintain compatibility with 157030ef842dSbmc * consumers that pull the compiler-generated ID out of the 157130ef842dSbmc * data, we put that ID at the top of the zero-filled data. 157230ef842dSbmc */ 157330ef842dSbmc rec = &aggdesc->dtagd_rec[0]; 157430ef842dSbmc /* LINTED - alignment */ 157530ef842dSbmc *((dtrace_aggvarid_t *)(zdata + rec->dtrd_offset)) = aggvar; 157630ef842dSbmc 157730ef842dSbmc rec = &aggdesc->dtagd_rec[aggdesc->dtagd_nrecs - 1]; 157830ef842dSbmc 157930ef842dSbmc /* 158030ef842dSbmc * Now for the more complicated part. If (and only if) this 158130ef842dSbmc * is an lquantize() aggregating action, zero-filled data is 158230ef842dSbmc * not equivalent to an empty record: we must also get the 158330ef842dSbmc * parameters for the lquantize(). 158430ef842dSbmc */ 158530ef842dSbmc if (rec->dtrd_action == DTRACEAGG_LQUANTIZE) { 158630ef842dSbmc if (aggdata->dtada_data != NULL) { 158730ef842dSbmc /* 158830ef842dSbmc * The easier case here is if we actually have 158930ef842dSbmc * some prototype data -- in which case we 159030ef842dSbmc * manually dig it out of the aggregation 159130ef842dSbmc * record. 159230ef842dSbmc */ 159330ef842dSbmc /* LINTED - alignment */ 159430ef842dSbmc larg = *((uint64_t *)(aggdata->dtada_data + 159530ef842dSbmc rec->dtrd_offset)); 159630ef842dSbmc } else { 159730ef842dSbmc /* 159830ef842dSbmc * We don't have any prototype data. As a 159930ef842dSbmc * result, we know that we _do_ have the 160030ef842dSbmc * compiler-generated information. (If this 160130ef842dSbmc * were an anonymous enabling, all of our 160230ef842dSbmc * zero-filled data would have prototype data 160330ef842dSbmc * -- either directly or indirectly.) So as 160430ef842dSbmc * gross as it is, we'll grovel around in the 160530ef842dSbmc * compiler-generated information to find the 160630ef842dSbmc * lquantize() parameters. 160730ef842dSbmc */ 160830ef842dSbmc dtrace_stmtdesc_t *sdp; 160930ef842dSbmc dt_ident_t *aid; 161030ef842dSbmc dt_idsig_t *isp; 161130ef842dSbmc 161230ef842dSbmc sdp = (dtrace_stmtdesc_t *)(uintptr_t) 161330ef842dSbmc aggdesc->dtagd_rec[0].dtrd_uarg; 161430ef842dSbmc aid = sdp->dtsd_aggdata; 161530ef842dSbmc isp = (dt_idsig_t *)aid->di_data; 161630ef842dSbmc assert(isp->dis_auxinfo != 0); 161730ef842dSbmc larg = isp->dis_auxinfo; 161830ef842dSbmc } 161930ef842dSbmc 162030ef842dSbmc /* LINTED - alignment */ 162130ef842dSbmc *((uint64_t *)(zdata + rec->dtrd_offset)) = larg; 162230ef842dSbmc } 162330ef842dSbmc 162430ef842dSbmc aggdata->dtada_data = zdata; 162530ef842dSbmc } 162630ef842dSbmc 162730ef842dSbmc /* 162830ef842dSbmc * Now that we've dealt with setting up our zero-filled data, we can 162930ef842dSbmc * allocate our sorted array, and take another pass over the data to 163030ef842dSbmc * fill it. 163130ef842dSbmc */ 163230ef842dSbmc sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *)); 163330ef842dSbmc 163430ef842dSbmc if (sorted == NULL) 163530ef842dSbmc goto out; 163630ef842dSbmc 163730ef842dSbmc for (h = hash->dtah_all, i = 0; h != NULL; h = h->dtahe_nextall) { 163830ef842dSbmc dtrace_aggvarid_t id; 163930ef842dSbmc 164030ef842dSbmc if ((id = dt_aggregate_aggvarid(h)) > max || !map[id]) 164130ef842dSbmc continue; 164230ef842dSbmc 164330ef842dSbmc sorted[i++] = h; 164430ef842dSbmc } 164530ef842dSbmc 164630ef842dSbmc assert(i == nentries); 164730ef842dSbmc 164830ef842dSbmc /* 164930ef842dSbmc * We've loaded our array; now we need to sort by value to allow us 165030ef842dSbmc * to create bundles of like value. We're going to acquire the 165130ef842dSbmc * dt_qsort_lock here, and hold it across all of our subsequent 165230ef842dSbmc * comparison and sorting. 165330ef842dSbmc */ 165430ef842dSbmc (void) pthread_mutex_lock(&dt_qsort_lock); 165530ef842dSbmc 165630ef842dSbmc qsort(sorted, nentries, sizeof (dt_ahashent_t *), 165730ef842dSbmc dt_aggregate_keyvarcmp); 165830ef842dSbmc 165930ef842dSbmc /* 166030ef842dSbmc * Now we need to go through and create bundles. Because the number 166130ef842dSbmc * of bundles is bounded by the size of the sorted array, we're going 166230ef842dSbmc * to reuse the underlying storage. And note that "bundle" is an 166330ef842dSbmc * array of pointers to arrays of pointers to dt_ahashent_t -- making 166430ef842dSbmc * its type (regrettably) "dt_ahashent_t ***". (Regrettable because 166530ef842dSbmc * '*' -- like '_' and 'X' -- should never appear in triplicate in 166630ef842dSbmc * an ideal world.) 166730ef842dSbmc */ 166830ef842dSbmc bundle = (dt_ahashent_t ***)sorted; 166930ef842dSbmc 167030ef842dSbmc for (i = 1, start = 0; i <= nentries; i++) { 167130ef842dSbmc if (i < nentries && 167230ef842dSbmc dt_aggregate_keycmp(&sorted[i], &sorted[i - 1]) == 0) 167330ef842dSbmc continue; 167430ef842dSbmc 167530ef842dSbmc /* 167630ef842dSbmc * We have a bundle boundary. Everything from start to 167730ef842dSbmc * (i - 1) belongs in one bundle. 167830ef842dSbmc */ 167930ef842dSbmc assert(i - start <= naggvars); 168030ef842dSbmc bundlesize = (naggvars + 2) * sizeof (dt_ahashent_t *); 168130ef842dSbmc 168230ef842dSbmc if ((nbundle = dt_zalloc(dtp, bundlesize)) == NULL) { 168330ef842dSbmc (void) pthread_mutex_unlock(&dt_qsort_lock); 168430ef842dSbmc goto out; 168530ef842dSbmc } 168630ef842dSbmc 168730ef842dSbmc for (j = start; j < i; j++) { 168830ef842dSbmc dtrace_aggvarid_t id = dt_aggregate_aggvarid(sorted[j]); 168930ef842dSbmc 169030ef842dSbmc assert(id <= max); 169130ef842dSbmc assert(map[id] != 0); 169230ef842dSbmc assert(map[id] - 1 < naggvars); 169330ef842dSbmc assert(nbundle[map[id] - 1] == NULL); 169430ef842dSbmc nbundle[map[id] - 1] = sorted[j]; 169530ef842dSbmc 169630ef842dSbmc if (nbundle[naggvars] == NULL) 169730ef842dSbmc nbundle[naggvars] = sorted[j]; 169830ef842dSbmc } 169930ef842dSbmc 170030ef842dSbmc for (j = 0; j < naggvars; j++) { 170130ef842dSbmc if (nbundle[j] != NULL) 170230ef842dSbmc continue; 170330ef842dSbmc 170430ef842dSbmc /* 170530ef842dSbmc * Before we assume that this aggregation variable 170630ef842dSbmc * isn't present (and fall back to using the 170730ef842dSbmc * zero-filled data allocated earlier), check the 170830ef842dSbmc * remap. If we have a remapping, we'll drop it in 170930ef842dSbmc * here. Note that we might be remapping an 171030ef842dSbmc * aggregation variable that isn't present for this 171130ef842dSbmc * key; in this case, the aggregation data that we 171230ef842dSbmc * copy will point to the zeroed data. 171330ef842dSbmc */ 171430ef842dSbmc if (remap != NULL && remap[j]) { 171530ef842dSbmc assert(remap[j] - 1 < j); 171630ef842dSbmc assert(nbundle[remap[j] - 1] != NULL); 171730ef842dSbmc nbundle[j] = nbundle[remap[j] - 1]; 171830ef842dSbmc } else { 171930ef842dSbmc nbundle[j] = &zaggdata[j]; 172030ef842dSbmc } 172130ef842dSbmc } 172230ef842dSbmc 172330ef842dSbmc bundle[nbundles++] = nbundle; 172430ef842dSbmc start = i; 172530ef842dSbmc } 172630ef842dSbmc 172730ef842dSbmc /* 172830ef842dSbmc * Now we need to re-sort based on the first value. 172930ef842dSbmc */ 173030ef842dSbmc dt_aggregate_qsort(dtp, bundle, nbundles, sizeof (dt_ahashent_t **), 173130ef842dSbmc dt_aggregate_bundlecmp); 173230ef842dSbmc 173330ef842dSbmc (void) pthread_mutex_unlock(&dt_qsort_lock); 173430ef842dSbmc 173530ef842dSbmc /* 173630ef842dSbmc * We're done! Now we just need to go back over the sorted bundles, 173730ef842dSbmc * calling the function. 173830ef842dSbmc */ 173930ef842dSbmc data = alloca((naggvars + 1) * sizeof (dtrace_aggdata_t *)); 174030ef842dSbmc 174130ef842dSbmc for (i = 0; i < nbundles; i++) { 174230ef842dSbmc for (j = 0; j < naggvars; j++) 174330ef842dSbmc data[j + 1] = NULL; 174430ef842dSbmc 174530ef842dSbmc for (j = 0; j < naggvars; j++) { 174630ef842dSbmc int ndx = j - sortpos; 174730ef842dSbmc 174830ef842dSbmc if (ndx < 0) 174930ef842dSbmc ndx += naggvars; 175030ef842dSbmc 175130ef842dSbmc assert(bundle[i][ndx] != NULL); 175230ef842dSbmc data[j + 1] = &bundle[i][ndx]->dtahe_data; 175330ef842dSbmc } 175430ef842dSbmc 175530ef842dSbmc for (j = 0; j < naggvars; j++) 175630ef842dSbmc assert(data[j + 1] != NULL); 175730ef842dSbmc 175830ef842dSbmc /* 175930ef842dSbmc * The representative key is the last element in the bundle. 176030ef842dSbmc * Assert that we have one, and then set it to be the first 176130ef842dSbmc * element of data. 176230ef842dSbmc */ 176330ef842dSbmc assert(bundle[i][j] != NULL); 176430ef842dSbmc data[0] = &bundle[i][j]->dtahe_data; 176530ef842dSbmc 176630ef842dSbmc if ((rval = func(data, naggvars + 1, arg)) == -1) 176730ef842dSbmc goto out; 176830ef842dSbmc } 176930ef842dSbmc 177030ef842dSbmc rval = 0; 177130ef842dSbmc out: 177230ef842dSbmc for (i = 0; i < nbundles; i++) 177330ef842dSbmc dt_free(dtp, bundle[i]); 177430ef842dSbmc 177530ef842dSbmc if (zaggdata != NULL) { 177630ef842dSbmc for (i = 0; i < naggvars; i++) 177730ef842dSbmc dt_free(dtp, zaggdata[i].dtahe_data.dtada_data); 177830ef842dSbmc } 177930ef842dSbmc 178030ef842dSbmc dt_free(dtp, zaggdata); 178130ef842dSbmc dt_free(dtp, sorted); 178230ef842dSbmc dt_free(dtp, remap); 178330ef842dSbmc dt_free(dtp, map); 178430ef842dSbmc 178530ef842dSbmc return (rval); 178630ef842dSbmc } 178730ef842dSbmc 17887c478bd9Sstevel@tonic-gate int 17897c478bd9Sstevel@tonic-gate dtrace_aggregate_print(dtrace_hdl_t *dtp, FILE *fp, 17907c478bd9Sstevel@tonic-gate dtrace_aggregate_walk_f *func) 17917c478bd9Sstevel@tonic-gate { 17927c478bd9Sstevel@tonic-gate dt_print_aggdata_t pd; 17937c478bd9Sstevel@tonic-gate 17947c478bd9Sstevel@tonic-gate pd.dtpa_dtp = dtp; 17957c478bd9Sstevel@tonic-gate pd.dtpa_fp = fp; 17967c478bd9Sstevel@tonic-gate pd.dtpa_allunprint = 1; 17977c478bd9Sstevel@tonic-gate 17987c478bd9Sstevel@tonic-gate if (func == NULL) 179930ef842dSbmc func = dtrace_aggregate_walk_sorted; 18007c478bd9Sstevel@tonic-gate 18017c478bd9Sstevel@tonic-gate if ((*func)(dtp, dt_print_agg, &pd) == -1) 18027c478bd9Sstevel@tonic-gate return (dt_set_errno(dtp, dtp->dt_errno)); 18037c478bd9Sstevel@tonic-gate 18047c478bd9Sstevel@tonic-gate return (0); 18057c478bd9Sstevel@tonic-gate } 18067c478bd9Sstevel@tonic-gate 18077c478bd9Sstevel@tonic-gate void 18087c478bd9Sstevel@tonic-gate dtrace_aggregate_clear(dtrace_hdl_t *dtp) 18097c478bd9Sstevel@tonic-gate { 18107c478bd9Sstevel@tonic-gate dt_aggregate_t *agp = &dtp->dt_aggregate; 18117c478bd9Sstevel@tonic-gate dt_ahash_t *hash = &agp->dtat_hash; 18127c478bd9Sstevel@tonic-gate dt_ahashent_t *h; 18137c478bd9Sstevel@tonic-gate dtrace_aggdata_t *data; 18147c478bd9Sstevel@tonic-gate dtrace_aggdesc_t *aggdesc; 18157c478bd9Sstevel@tonic-gate dtrace_recdesc_t *rec; 18167c478bd9Sstevel@tonic-gate int i, max_cpus = agp->dtat_maxcpu; 18177c478bd9Sstevel@tonic-gate 18187c478bd9Sstevel@tonic-gate for (h = hash->dtah_all; h != NULL; h = h->dtahe_nextall) { 18197c478bd9Sstevel@tonic-gate aggdesc = h->dtahe_data.dtada_desc; 18207c478bd9Sstevel@tonic-gate rec = &aggdesc->dtagd_rec[aggdesc->dtagd_nrecs - 1]; 18217c478bd9Sstevel@tonic-gate data = &h->dtahe_data; 18227c478bd9Sstevel@tonic-gate 18237c478bd9Sstevel@tonic-gate bzero(&data->dtada_data[rec->dtrd_offset], rec->dtrd_size); 18247c478bd9Sstevel@tonic-gate 18257c478bd9Sstevel@tonic-gate if (data->dtada_percpu == NULL) 18267c478bd9Sstevel@tonic-gate continue; 18277c478bd9Sstevel@tonic-gate 18287c478bd9Sstevel@tonic-gate for (i = 0; i < max_cpus; i++) 18297c478bd9Sstevel@tonic-gate bzero(data->dtada_percpu[i], rec->dtrd_size); 18307c478bd9Sstevel@tonic-gate } 18317c478bd9Sstevel@tonic-gate } 18327c478bd9Sstevel@tonic-gate 18337c478bd9Sstevel@tonic-gate void 18347c478bd9Sstevel@tonic-gate dt_aggregate_destroy(dtrace_hdl_t *dtp) 18357c478bd9Sstevel@tonic-gate { 18367c478bd9Sstevel@tonic-gate dt_aggregate_t *agp = &dtp->dt_aggregate; 18377c478bd9Sstevel@tonic-gate dt_ahash_t *hash = &agp->dtat_hash; 18387c478bd9Sstevel@tonic-gate dt_ahashent_t *h, *next; 18397c478bd9Sstevel@tonic-gate dtrace_aggdata_t *aggdata; 18407c478bd9Sstevel@tonic-gate int i, max_cpus = agp->dtat_maxcpu; 18417c478bd9Sstevel@tonic-gate 18427c478bd9Sstevel@tonic-gate if (hash->dtah_hash == NULL) { 18437c478bd9Sstevel@tonic-gate assert(hash->dtah_all == NULL); 18447c478bd9Sstevel@tonic-gate } else { 18457c478bd9Sstevel@tonic-gate free(hash->dtah_hash); 18467c478bd9Sstevel@tonic-gate 18477c478bd9Sstevel@tonic-gate for (h = hash->dtah_all; h != NULL; h = next) { 18487c478bd9Sstevel@tonic-gate next = h->dtahe_nextall; 18497c478bd9Sstevel@tonic-gate 18507c478bd9Sstevel@tonic-gate aggdata = &h->dtahe_data; 18517c478bd9Sstevel@tonic-gate 18527c478bd9Sstevel@tonic-gate if (aggdata->dtada_percpu != NULL) { 18537c478bd9Sstevel@tonic-gate for (i = 0; i < max_cpus; i++) 18547c478bd9Sstevel@tonic-gate free(aggdata->dtada_percpu[i]); 18557c478bd9Sstevel@tonic-gate free(aggdata->dtada_percpu); 18567c478bd9Sstevel@tonic-gate } 18577c478bd9Sstevel@tonic-gate 18587c478bd9Sstevel@tonic-gate free(aggdata->dtada_data); 18597c478bd9Sstevel@tonic-gate free(h); 18607c478bd9Sstevel@tonic-gate } 18617c478bd9Sstevel@tonic-gate 18627c478bd9Sstevel@tonic-gate hash->dtah_hash = NULL; 18637c478bd9Sstevel@tonic-gate hash->dtah_all = NULL; 18647c478bd9Sstevel@tonic-gate hash->dtah_size = 0; 18657c478bd9Sstevel@tonic-gate } 18667c478bd9Sstevel@tonic-gate 18677c478bd9Sstevel@tonic-gate free(agp->dtat_buf.dtbd_data); 18687c478bd9Sstevel@tonic-gate free(agp->dtat_cpus); 18697c478bd9Sstevel@tonic-gate } 1870