Annotation of src/usr.bin/systat/pool.c, Revision 1.3
1.3 ! chl 1: /* $OpenBSD: pool.c,v 1.2 2008/11/02 07:14:16 canacar Exp $ */
1.1 canacar 2: /*
3: * Copyright (c) 2008 Can Erkin Acar <canacar@openbsd.org>
4: *
5: * Permission to use, copy, modify, and distribute this software for any
6: * purpose with or without fee is hereby granted, provided that the above
7: * copyright notice and this permission notice appear in all copies.
8: *
9: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
10: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
11: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
12: * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
13: * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
14: * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
15: * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
16: */
17:
18: #include <sys/types.h>
19: #include <sys/param.h>
20: #include <sys/sysctl.h>
21: #include <sys/pool.h>
22: #include <errno.h>
23: #include <stdlib.h>
1.3 ! chl 24: #include <string.h>
1.1 canacar 25:
26: #include "systat.h"
27:
28: void print_pool(void);
29: int read_pool(void);
30: void sort_pool(void);
31: int select_pool(void);
32: void showpool(int k);
33:
34: /* qsort callbacks */
35: int sort_name_callback(const void *s1, const void *s2);
1.2 canacar 36: int sort_req_callback(const void *s1, const void *s2);
1.1 canacar 37:
38: struct pool_info {
39: char name[32];
40: struct pool pool;
41: };
42:
43:
44: int num_pools = 0;
45: struct pool_info *pools = NULL;
46:
47:
48: field_def fields_pool[] = {
49: {"NAME", 11, 32, 1, FLD_ALIGN_LEFT, -1, 0, 0, 0},
50: {"SIZE", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
51: {"REQUESTS", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
52: {"FAIL", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
53: {"INUSE", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
54: {"PGREQ", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
55: {"PGREL", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
56: {"NPAGE", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
57: {"HIWAT", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
58: {"MINPG", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
59: {"MAXPG", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0},
60: {"IDLE", 8, 24, 1, FLD_ALIGN_RIGHT, -1, 0, 0, 0}
61: };
62:
63:
64: #define FIELD_ADDR(x) (&fields_pool[x])
65:
66: #define FLD_POOL_NAME FIELD_ADDR(0)
67: #define FLD_POOL_SIZE FIELD_ADDR(1)
68: #define FLD_POOL_REQS FIELD_ADDR(2)
69: #define FLD_POOL_FAIL FIELD_ADDR(3)
70: #define FLD_POOL_INUSE FIELD_ADDR(4)
71: #define FLD_POOL_PGREQ FIELD_ADDR(5)
72: #define FLD_POOL_PGREL FIELD_ADDR(6)
73: #define FLD_POOL_NPAGE FIELD_ADDR(7)
74: #define FLD_POOL_HIWAT FIELD_ADDR(8)
75: #define FLD_POOL_MINPG FIELD_ADDR(9)
76: #define FLD_POOL_MAXPG FIELD_ADDR(10)
77: #define FLD_POOL_IDLE FIELD_ADDR(11)
78:
79: /* Define views */
80: field_def *view_pool_0[] = {
81: FLD_POOL_NAME, FLD_POOL_SIZE, FLD_POOL_REQS, FLD_POOL_FAIL,
82: FLD_POOL_INUSE, FLD_POOL_PGREQ, FLD_POOL_PGREL, FLD_POOL_NPAGE,
83: FLD_POOL_HIWAT, FLD_POOL_MINPG, FLD_POOL_MAXPG, FLD_POOL_IDLE, NULL
84: };
85:
86: order_type pool_order_list[] = {
1.2 canacar 87: {"name", "name", 'N', sort_name_callback},
88: {"requests", "requests", 'Q', sort_req_callback},
1.1 canacar 89: {NULL, NULL, 0, NULL}
90: };
91:
92: /* Define view managers */
93: struct view_manager pool_mgr = {
94: "Pool", select_pool, read_pool, sort_pool, print_header,
95: print_pool, keyboard_callback, pool_order_list, pool_order_list
96: };
97:
98: field_view views_pool[] = {
99: {view_pool_0, "pool", '5', &pool_mgr},
100: {NULL, NULL, 0, NULL}
101: };
102:
103:
104: int
105: sort_name_callback(const void *s1, const void *s2)
106: {
107: struct pool_info *p1, *p2;
108: p1 = (struct pool_info *)s1;
109: p2 = (struct pool_info *)s2;
110:
1.2 canacar 111: return strcmp(p1->name, p2->name) * sortdir;
112: }
113:
114: int
115: sort_req_callback(const void *s1, const void *s2)
116: {
117: struct pool_info *p1, *p2;
118: p1 = (struct pool_info *)s1;
119: p2 = (struct pool_info *)s2;
120:
121: if (p1->pool.pr_nget < p2->pool.pr_nget)
122: return sortdir;
123: if (p1->pool.pr_nget > p2->pool.pr_nget)
124: return -sortdir;
125:
126: return sort_name_callback(s1, s2);
1.1 canacar 127: }
128:
129: void
130: sort_pool(void)
131: {
132: order_type *ordering;
133:
134: if (curr_mgr == NULL)
135: return;
136:
137: ordering = curr_mgr->order_curr;
138:
139: if (ordering == NULL)
140: return;
141: if (ordering->func == NULL)
142: return;
143: if (pools == NULL)
144: return;
145: if (num_pools <= 0)
146: return;
147:
1.2 canacar 148: mergesort(pools, num_pools, sizeof(struct pool_info), ordering->func);
1.1 canacar 149: }
150:
151: int
152: select_pool(void)
153: {
154: num_disp = num_pools;
155: return (0);
156: }
157:
158: int
159: read_pool(void)
160: {
161: int mib[4], np, i;
162: size_t size;
163:
164: mib[0] = CTL_KERN;
165: mib[1] = KERN_POOL;
166: mib[2] = KERN_POOL_NPOOLS;
167: size = sizeof(np);
168:
169: if (sysctl(mib, 3, &np, &size, NULL, 0) < 0) {
170: error("sysctl(npools): %s", strerror(errno));
171: return (-1);
172: }
173:
174: if (np <= 0) {
175: num_pools = 0;
176: return (0);
177: }
178:
179: if (np > num_pools || pools == NULL) {
180: struct pool_info *p = realloc(pools, sizeof(*pools) * np);
181: if (p == NULL) {
182: error("realloc: %s", strerror(errno));
183: return (-1);
184: }
185: pools = p;
186: num_pools = np;
187: }
188:
189: for (i = 0; i < num_pools; i++) {
190: mib[0] = CTL_KERN;
191: mib[1] = KERN_POOL;
192: mib[2] = KERN_POOL_POOL;
193: mib[3] = i + 1;
194: size = sizeof(struct pool);
195: if (sysctl(mib, 4, &pools[i].pool, &size, NULL, 0) < 0) {
196: error("sysctl(pool): %s", strerror(errno));
197: break;
198: }
199: mib[2] = KERN_POOL_NAME;
200: size = sizeof(pools[i].name);
201: if (sysctl(mib, 4, &pools[i].name, &size, NULL, 0) < 0) {
202: error("sysctl(pool_name): %s", strerror(errno));
203: break;
204: }
205: }
206:
207: if (i != num_pools) {
208: memset(pools, 0, sizeof(*pools) * num_pools);
209: return (-1);
210: }
211:
212: return 0;
213: }
214:
215:
216: void
217: print_pool(void)
218: {
219: int n, count = 0;
220:
221: if (pools == NULL)
222: return;
223:
224: for (n = dispstart; n < num_disp; n++) {
225: showpool(n);
226: count++;
227: if (maxprint > 0 && count >= maxprint)
228: break;
229: }
230: }
231:
232: int
233: initpool(void)
234: {
235: field_view *v;
236:
237: for (v = views_pool; v->name != NULL; v++)
238: add_view(v);
239:
240: read_pool();
241:
242: return(0);
243: }
244:
245: void
246: showpool(int k)
247: {
248: struct pool_info *p = pools + k;
249:
250: if (k < 0 || k >= num_pools)
251: return;
252:
253: print_fld_str(FLD_POOL_NAME, p->name);
254: print_fld_uint(FLD_POOL_SIZE, p->pool.pr_size);
255:
256: print_fld_size(FLD_POOL_REQS, p->pool.pr_nget);
257: print_fld_size(FLD_POOL_FAIL, p->pool.pr_nfail);
258: print_fld_ssize(FLD_POOL_INUSE, p->pool.pr_nget - p->pool.pr_nput);
259: print_fld_size(FLD_POOL_PGREQ, p->pool.pr_npagealloc);
260: print_fld_size(FLD_POOL_PGREL, p->pool.pr_npagefree);
261:
262: print_fld_size(FLD_POOL_NPAGE, p->pool.pr_npages);
263: print_fld_size(FLD_POOL_HIWAT, p->pool.pr_hiwat);
264: print_fld_size(FLD_POOL_MINPG, p->pool.pr_minpages);
265:
266: if (p->pool.pr_maxpages == UINT_MAX)
267: print_fld_str(FLD_POOL_MAXPG, "inf");
268: else
269: print_fld_size(FLD_POOL_MAXPG, p->pool.pr_maxpages);
270:
271: print_fld_size(FLD_POOL_IDLE, p->pool.pr_nidle);
272:
273: end_line();
274: }
![[BACK]](/icons/back.gif){kind=icon}
Return to pool.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / systat