1*0Sstevel@tonic-gate /*
2*0Sstevel@tonic-gate * CDDL HEADER START
3*0Sstevel@tonic-gate *
4*0Sstevel@tonic-gate * The contents of this file are subject to the terms of the
5*0Sstevel@tonic-gate * Common Development and Distribution License, Version 1.0 only
6*0Sstevel@tonic-gate * (the "License"). You may not use this file except in compliance
7*0Sstevel@tonic-gate * with the License.
8*0Sstevel@tonic-gate *
9*0Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*0Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing.
11*0Sstevel@tonic-gate * See the License for the specific language governing permissions
12*0Sstevel@tonic-gate * and limitations under the License.
13*0Sstevel@tonic-gate *
14*0Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each
15*0Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*0Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the
17*0Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying
18*0Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner]
19*0Sstevel@tonic-gate *
20*0Sstevel@tonic-gate * CDDL HEADER END
21*0Sstevel@tonic-gate */
22*0Sstevel@tonic-gate /*
23*0Sstevel@tonic-gate * Copyright (c) 1994, by Sun Microsytems, Inc.
24*0Sstevel@tonic-gate */
25*0Sstevel@tonic-gate
26*0Sstevel@tonic-gate #pragma ident "%Z%%M% %I% %E% SMI"
27*0Sstevel@tonic-gate
28*0Sstevel@tonic-gate #include <stdlib.h>
29*0Sstevel@tonic-gate #include <locale.h>
30*0Sstevel@tonic-gate
31*0Sstevel@tonic-gate #include "state.h"
32*0Sstevel@tonic-gate
33*0Sstevel@tonic-gate /*
34*0Sstevel@tonic-gate * This file defines routines on a table data structure. There is one
35*0Sstevel@tonic-gate * static table that has the following operations: insert, sort, print,
36*0Sstevel@tonic-gate * and get an element by index.
37*0Sstevel@tonic-gate */
38*0Sstevel@tonic-gate
39*0Sstevel@tonic-gate static entry_t *table_start = NULL; /* start of table */
40*0Sstevel@tonic-gate static int table_cur = 0; /* current size of table */
41*0Sstevel@tonic-gate static int table_size = 0; /* max number of elements */
42*0Sstevel@tonic-gate
43*0Sstevel@tonic-gate #define GUESS_NUM_ELEM (16 * 1024)
44*0Sstevel@tonic-gate
45*0Sstevel@tonic-gate static void table_grow (int);
46*0Sstevel@tonic-gate static int timecompare (const void *, const void *);
47*0Sstevel@tonic-gate
48*0Sstevel@tonic-gate static void
table_grow(int num_entries)49*0Sstevel@tonic-gate table_grow(int num_entries)
50*0Sstevel@tonic-gate {
51*0Sstevel@tonic-gate entry_t *temp;
52*0Sstevel@tonic-gate
53*0Sstevel@tonic-gate if (table_start == NULL) {
54*0Sstevel@tonic-gate table_size = num_entries;
55*0Sstevel@tonic-gate table_start = malloc(table_size * sizeof (struct entry));
56*0Sstevel@tonic-gate if (table_start == NULL)
57*0Sstevel@tonic-gate fail(1, gettext("malloc:"));
58*0Sstevel@tonic-gate return;
59*0Sstevel@tonic-gate }
60*0Sstevel@tonic-gate table_size += num_entries;
61*0Sstevel@tonic-gate temp = realloc(table_start, table_size * sizeof (struct entry));
62*0Sstevel@tonic-gate if (temp == NULL)
63*0Sstevel@tonic-gate fail(1, gettext("realloc:"));
64*0Sstevel@tonic-gate table_start = temp;
65*0Sstevel@tonic-gate }
66*0Sstevel@tonic-gate
67*0Sstevel@tonic-gate static int
timecompare(const void * i,const void * j)68*0Sstevel@tonic-gate timecompare(const void *i, const void *j)
69*0Sstevel@tonic-gate {
70*0Sstevel@tonic-gate hrtime_t result;
71*0Sstevel@tonic-gate
72*0Sstevel@tonic-gate result = ((entry_t *)i)->time - ((entry_t *)j)->time;
73*0Sstevel@tonic-gate if (result < (longlong_t) 0)
74*0Sstevel@tonic-gate return (-1);
75*0Sstevel@tonic-gate else if (result == (longlong_t) 0)
76*0Sstevel@tonic-gate return (0);
77*0Sstevel@tonic-gate else
78*0Sstevel@tonic-gate return (1);
79*0Sstevel@tonic-gate }
80*0Sstevel@tonic-gate
81*0Sstevel@tonic-gate /*
82*0Sstevel@tonic-gate * insert an entry into the table. Automatically grows it if needed
83*0Sstevel@tonic-gate */
84*0Sstevel@tonic-gate void
table_insert(entry_t * element)85*0Sstevel@tonic-gate table_insert(entry_t *element)
86*0Sstevel@tonic-gate {
87*0Sstevel@tonic-gate if (table_cur >= table_size) {
88*0Sstevel@tonic-gate table_grow(GUESS_NUM_ELEM);
89*0Sstevel@tonic-gate }
90*0Sstevel@tonic-gate /* copy the structure to the array, increment cur index */
91*0Sstevel@tonic-gate table_start[table_cur++] = *element;
92*0Sstevel@tonic-gate }
93*0Sstevel@tonic-gate
94*0Sstevel@tonic-gate int
table_get_num_elements(void)95*0Sstevel@tonic-gate table_get_num_elements(void)
96*0Sstevel@tonic-gate {
97*0Sstevel@tonic-gate return (table_size);
98*0Sstevel@tonic-gate }
99*0Sstevel@tonic-gate
100*0Sstevel@tonic-gate void
table_sort(void)101*0Sstevel@tonic-gate table_sort(void)
102*0Sstevel@tonic-gate {
103*0Sstevel@tonic-gate qsort(table_start, table_cur, sizeof (struct entry), &timecompare);
104*0Sstevel@tonic-gate }
105*0Sstevel@tonic-gate
106*0Sstevel@tonic-gate void
table_print(void (* print_elem)(entry_t *))107*0Sstevel@tonic-gate table_print(void (*print_elem)(entry_t *))
108*0Sstevel@tonic-gate {
109*0Sstevel@tonic-gate int i;
110*0Sstevel@tonic-gate
111*0Sstevel@tonic-gate for (i = 0; i < table_cur; i++) {
112*0Sstevel@tonic-gate print_elem(&(table_start[i]));
113*0Sstevel@tonic-gate }
114*0Sstevel@tonic-gate }
115*0Sstevel@tonic-gate
116*0Sstevel@tonic-gate entry_t *
table_get_entry_indexed(int n)117*0Sstevel@tonic-gate table_get_entry_indexed(int n)
118*0Sstevel@tonic-gate {
119*0Sstevel@tonic-gate if (n < table_cur)
120*0Sstevel@tonic-gate return (&(table_start[n]));
121*0Sstevel@tonic-gate return (NULL);
122*0Sstevel@tonic-gate }
123