ViewVC Help

View File | Revision Log | Show Annotations | Revision Graph | Root Listing

root/i-scream/projects/libstatgrab/src/libstatgrab/tools.c

Comparing projects/libstatgrab/src/libstatgrab/tools.c (file contents):
Revision 1.9 by ats, Sun Oct 19 02:03:02 2003 UTC vs.
Revision 1.40 by ats, Mon Apr 5 01:06:02 2004 UTC

#	Line 1 | Line 1
1	<	/*
1	>	/*
2		* i-scream central monitoring system
3		* http://www.i-scream.org
4	<	* Copyright (C) 2000-2003 i-scream
4	>	* Copyright (C) 2000-2004 i-scream
5		*
6	<	* This program is free software; you can redistribute it and/or
7	<	* modify it under the terms of the GNU General Public License
8	<	* as published by the Free Software Foundation; either version 2
9	<	* of the License, or (at your option) any later version.
6	>	* This library is free software; you can redistribute it and/or
7	>	* modify it under the terms of the GNU Lesser General Public
8	>	* License as published by the Free Software Foundation; either
9	>	* version 2.1 of the License, or (at your option) any later version.
10		*
11	<	* This program is distributed in the hope that it will be useful,
11	>	* This library is distributed in the hope that it will be useful,
12		* but WITHOUT ANY WARRANTY; without even the implied warranty of
13	<	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14	<	* GNU General Public License for more details.
13	>	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
14	>	* Lesser General Public License for more details.
15		*
16	<	* You should have received a copy of the GNU General Public License
17	<	* along with this program; if not, write to the Free Software
18	<	* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
16	>	* You should have received a copy of the GNU Lesser General Public
17	>	* License along with this library; if not, write to the Free Software
18	>	* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
19	>	* 02111-1307 USA
20	>	*
21	>	* $Id$
22		*/
23
24		#ifdef HAVE_CONFIG_H
#	Line 25 | Line 28
28		#include <stdio.h>
29		#include <string.h>
30		#include <stdlib.h>
31	+	#include <unistd.h>
32		#include <sys/types.h>
33		#include <regex.h>
34		#ifdef ALLBSD
35		#include <fcntl.h>
36	+	#endif
37	+	#if (defined(FREEBSD) && !defined(FREEBSD5)) || defined(DFBSD)
38		#include <kvm.h>
39	+	#include <paths.h>
40		#endif
41	<	#ifdef NETBSD
41	>	#if defined(NETBSD) || defined(OPENBSD)
42		#include <uvm/uvm_extern.h>
43	+	#include <sys/param.h>
44	+	#include <sys/sysctl.h>
45		#endif
46
47		#include "tools.h"
48
49	+	#ifdef SOLARIS
50	+	#ifdef HAVE_LIBDEVINFO_H
51	+	#include <libdevinfo.h>
52	+	#endif
53	+	#include <kstat.h>
54	+	#include <unistd.h>
55	+	#include <ctype.h>
56	+	#include <sys/types.h>
57	+	#include <sys/dkio.h>
58	+	#include <sys/stat.h>
59	+	#include <fcntl.h>
60	+	#include <sys/fcntl.h>
61	+	#include <dirent.h>
62	+	#endif
63	+
64	+	#if defined(SOLARIS) && defined(HAVE_LIBDEVINFO_H)
65	+	struct map{
66	+	char *bsd;
67	+	char *svr;
68	+
69	+	struct map *next;
70	+	};
71	+	typedef struct map mapping_t;
72	+
73	+	static mapping_t *mapping = NULL;
74	+	#endif
75	+
76	+	#ifdef SOLARIS
77	+	const char *get_svr_from_bsd(const char *bsd){
78	+	#ifdef HAVE_LIBDEVINFO_H
79	+	mapping_t *map_ptr;
80	+	for(map_ptr = mapping; map_ptr != NULL; map_ptr = map_ptr->next)
81	+	if(!strcmp(map_ptr->bsd, bsd)) return map_ptr->svr;
82	+	#endif
83	+	return bsd;
84	+	}
85	+	#endif
86	+
87	+	#if defined(SOLARIS) && defined(HAVE_LIBDEVINFO_H)
88	+	void add_mapping(char *bsd, char *svr){
89	+	mapping_t *map_ptr;
90	+	mapping_t *map_end_ptr;
91	+
92	+	if (mapping == NULL){
93	+	mapping = malloc(sizeof(mapping_t));
94	+	if (mapping == NULL) return;
95	+	map_ptr = mapping;
96	+	}else{
97	+	/* See if its already been added */
98	+	for(map_ptr = mapping; map_ptr != NULL; map_ptr = map_ptr->next){
99	+	if( (!strcmp(map_ptr->bsd, bsd)) || (!strcmp(map_ptr->svr, svr)) ){
100	+	return;
101	+	}
102	+	map_end_ptr = map_ptr;
103	+	}
104	+
105	+	/* We've reached end of list and not found the entry.. So we need to malloc
106	+	* new mapping_t
107	+	*/
108	+	map_end_ptr->next = malloc(sizeof(mapping_t));
109	+	if (map_end_ptr->next == NULL) return;
110	+	map_ptr = map_end_ptr->next;
111	+	}
112	+
113	+	map_ptr->next = NULL;
114	+	map_ptr->bsd = strdup(bsd);
115	+	map_ptr->svr = strdup(svr);
116	+
117	+	return;
118	+	}
119	+
120	+	char *read_dir(char *disk_path){
121	+	DIR *dirp;
122	+	struct dirent *dp;
123	+	struct stat stbuf;
124	+	char *svr_name;
125	+	char current_dir[MAXPATHLEN];
126	+	char file_name[MAXPATHLEN];
127	+	char temp_name[MAXPATHLEN];
128	+	char dir_dname[MAXPATHLEN];
129	+	char *dsk_dir;
130	+	int x;
131	+
132	+	dsk_dir = "/dev/osa/dev/dsk";
133	+	strncpy(current_dir, dsk_dir, sizeof current_dir);
134	+	if ((dirp = opendir(current_dir)) == NULL){
135	+	dsk_dir = "/dev/dsk";
136	+	snprintf(current_dir, sizeof current_dir, "%s", dsk_dir);
137	+	if ((dirp = opendir(current_dir)) == NULL){
138	+	return NULL;
139	+	}
140	+	}
141	+
142	+	while ((dp = readdir(dirp)) != NULL){
143	+	snprintf(temp_name, sizeof temp_name, "../..%s", disk_path);
144	+	snprintf(dir_dname, sizeof dir_dname, "%s/%s", dsk_dir, dp->d_name);
145	+	stat(dir_dname,&stbuf);
146	+
147	+	if (S_ISBLK(stbuf.st_mode)){
148	+	x = readlink(dir_dname, file_name, sizeof(file_name));
149	+	file_name[x] = '\0';
150	+	if (strcmp(file_name, temp_name) == 0) {
151	+	svr_name = strdup(dp->d_name);
152	+	closedir(dirp);
153	+	return svr_name;
154	+	}
155	+	}
156	+	}
157	+	closedir(dirp);
158	+	return NULL;
159	+	}
160	+
161	+
162	+
163	+	int get_alias(char *alias){
164	+	char file[MAXPATHLEN];
165	+	di_node_t root_node;
166	+	di_node_t node;
167	+	di_minor_t minor = DI_MINOR_NIL;
168	+	char tmpnode[MAXPATHLEN];
169	+	char *phys_path;
170	+	char *minor_name;
171	+	char *value;
172	+	int instance;
173	+	if ((root_node = di_init("/", DINFOCPYALL)) == DI_NODE_NIL) {
174	+	return 1;
175	+	}
176	+	node = di_drv_first_node(alias, root_node);
177	+	while (node != DI_NODE_NIL) {
178	+	if ((minor = di_minor_next(node, DI_MINOR_NIL)) != DI_MINOR_NIL) {
179	+	instance = di_instance(node);
180	+	phys_path = di_devfs_path(node);
181	+	minor_name = di_minor_name(minor);
182	+	strcpy(tmpnode, alias);
183	+	sprintf(tmpnode, "%s%d", tmpnode, instance);
184	+	strlcpy(file, "/devices", sizeof file);
185	+	strlcat(file, phys_path, sizeof file);
186	+	strlcat(file, ":", sizeof file);
187	+	strlcat(file, minor_name, sizeof file);
188	+	value = read_dir(file);
189	+	if (value != NULL){
190	+	add_mapping(tmpnode, value);
191	+	}
192	+	di_devfs_path_free(phys_path);
193	+	node = di_drv_next_node(node);
194	+	}else{
195	+	node = di_drv_next_node(node);
196	+	}
197	+	}
198	+	di_fini(root_node);
199	+	return 0;
200	+	}
201	+
202	+
203	+	#define BIG_ENOUGH 512
204	+	int build_mapping(){
205	+	char device_name[BIG_ENOUGH];
206	+	int x;
207	+	kstat_ctl_t *kc;
208	+	kstat_t *ksp;
209	+	kstat_io_t kios;
210	+
211	+	char driver_list[BIG_ENOUGH][BIG_ENOUGH];
212	+	int list_entries = 0;
213	+	int found;
214	+
215	+	if ((kc = kstat_open()) == NULL) {
216	+	return 1;
217	+	}
218	+
219	+	for (ksp = kc->kc_chain; ksp; ksp = ksp->ks_next) {
220	+	if (!strcmp(ksp->ks_class, "disk")) {
221	+	if(ksp->ks_type != KSTAT_TYPE_IO) continue;
222	+	/* We dont want metadevices appearing as num_diskio */
223	+	if(strcmp(ksp->ks_module, "md")==0) continue;
224	+	if((kstat_read(kc, ksp, &kios))==-1) continue;
225	+	strncpy(device_name, ksp->ks_name, sizeof device_name);
226	+	for(x=0;x<(sizeof device_name);x++){
227	+	if( isdigit((int)device_name[x]) ) break;
228	+	}
229	+	if(x == sizeof device_name) x--;
230	+	device_name[x] = '\0';
231	+
232	+	/* Check if we've not already looked it up */
233	+	found = 0;
234	+	for(x=0;x<list_entries;x++){
235	+	if (x>=BIG_ENOUGH){
236	+	/* We've got bigger than we thought was massive */
237	+	/* If we hit this.. Make big enough bigger */
238	+	return 1;
239	+	}
240	+	if( !strncmp(driver_list[x], device_name, BIG_ENOUGH)){
241	+	found = 1;
242	+	break;
243	+	}
244	+	}
245	+
246	+	if(!found){
247	+	if((get_alias(device_name)) != 0){
248	+	return 1;
249	+	}
250	+	strncpy(driver_list[x], device_name, BIG_ENOUGH);
251	+	list_entries++;
252	+	}
253	+	}
254	+	}
255	+
256	+	return 0;
257	+	}
258	+
259	+	#endif
260	+
261	+
262	+
263		char *f_read_line(FILE *f, const char *string){
264		/* Max line length. 8k should be more than enough */
265		static char line[8192];
#	Line 60 | Line 283 | char *get_string_match(char *line, regmatch_t *match){
283		return match_string;
284		}
285
286	<	#ifdef HAVE_ATOLL
286	>
287	>
288	>	#ifndef HAVE_ATOLL
289	>	static long long atoll(const char *s) {
290	>	long long value = 0;
291	>	int isneg = 0;
292	>
293	>	while (*s == ' ' || *s == '\t') {
294	>	s++;
295	>	}
296	>	if (*s == '-') {
297	>	isneg = 1;
298	>	s++;
299	>	}
300	>	while (*s >= '0' && *s <= '9') {
301	>	value = (10 * value) + (*s - '0');
302	>	s++;
303	>	}
304	>	return (isneg ? -value : value);
305	>	}
306	>	#endif
307	>
308	>	#ifndef HAVE_STRLCPY
309	>	/*      $OpenBSD: strlcpy.c,v 1.8 2003/06/17 21:56:24 millert Exp $     */
310	>
311	>	/*
312	>	* Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
313	>	*
314	>	* Permission to use, copy, modify, and distribute this software for any
315	>	* purpose with or without fee is hereby granted, provided that the above
316	>	* copyright notice and this permission notice appear in all copies.
317	>	*
318	>	* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
319	>	* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
320	>	* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
321	>	* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
322	>	* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
323	>	* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
324	>	* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
325	>	*/
326	>
327	>	/*
328	>	* Copy src to string dst of size siz.  At most siz-1 characters
329	>	* will be copied.  Always NUL terminates (unless siz == 0).
330	>	* Returns strlen(src); if retval >= siz, truncation occurred.
331	>	*/
332	>	size_t strlcpy(char *dst, const char *src, size_t siz){
333	>	register char *d = dst;
334	>	register const char *s = src;
335	>	register size_t n = siz;
336	>
337	>	/* Copy as many bytes as will fit */
338	>	if (n != 0 && --n != 0) {
339	>	do {
340	>	if ((*d++ = *s++) == 0)
341	>	break;
342	>	} while (--n != 0);
343	>	}
344	>
345	>	/* Not enough room in dst, add NUL and traverse rest of src */
346	>	if (n == 0) {
347	>	if (siz != 0)
348	>	*d = '\0';              /* NUL-terminate dst */
349	>	while (*s++)
350	>	;
351	>	}
352	>
353	>	return(s - src - 1);    /* count does not include NUL */
354	>	}
355	>	#endif
356	>
357	>	#ifndef HAVE_STRLCAT
358	>	/*      $OpenBSD: strlcat.c,v 1.11 2003/06/17 21:56:24 millert Exp $    */
359	>
360	>	/*
361	>	* Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
362	>	*
363	>	* Permission to use, copy, modify, and distribute this software for any
364	>	* purpose with or without fee is hereby granted, provided that the above
365	>	* copyright notice and this permission notice appear in all copies.
366	>	*
367	>	* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
368	>	* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
369	>	* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
370	>	* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
371	>	* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
372	>	* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
373	>	* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
374	>	*/
375	>
376	>	/*
377	>	* Appends src to string dst of size siz (unlike strncat, siz is the
378	>	* full size of dst, not space left).  At most siz-1 characters
379	>	* will be copied.  Always NUL terminates (unless siz <= strlen(dst)).
380	>	* Returns strlen(src) + MIN(siz, strlen(initial dst)).
381	>	* If retval >= siz, truncation occurred.
382	>	*/
383	>	size_t strlcat(char *dst, const char *src, size_t siz){
384	>	register char *d = dst;
385	>	register const char *s = src;
386	>	register size_t n = siz;
387	>	size_t dlen;
388	>
389	>	/* Find the end of dst and adjust bytes left but don't go past end */
390	>	while (n-- != 0 && *d != '\0')
391	>	d++;
392	>	dlen = d - dst;
393	>	n = siz - dlen;
394	>
395	>	if (n == 0)
396	>	return(dlen + strlen(s));
397	>	while (*s != '\0') {
398	>	if (n != 1) {
399	>	*d++ = *s;
400	>	n--;
401	>	}
402	>	s++;
403	>	}
404	>	*d = '\0';
405	>
406	>	return(dlen + (s - src));       /* count does not include NUL */
407	>	}
408	>
409	>	#endif
410	>
411	>	char *update_string(char **dest, const char *src) {
412	>	char *new;
413	>
414	>	new = realloc(*dest, strlen(src) + 1);
415	>	if (new == NULL) {
416	>	return NULL;
417	>	}
418	>
419	>	strcpy(new, src);
420	>	*dest = new;
421	>	return new;
422	>	}
423	>
424		long long get_ll_match(char *line, regmatch_t *match){
425		char *ptr;
426		long long num;
#	Line 70 | Line 430 | long long get_ll_match(char *line, regmatch_t *match){
430
431		return num;
432		}
73	–	#endif
433
434	<	#ifdef ALLBSD
434	>	#if (defined(FREEBSD) && !defined(FREEBSD5)) || defined(DFBSD)
435		kvm_t *get_kvm() {
436		static kvm_t *kvmd = NULL;
437
#	Line 83 | Line 442 | kvm_t *get_kvm() {
442		kvmd = kvm_openfiles(NULL, NULL, NULL, O_RDONLY, NULL);
443		return kvmd;
444		}
445	+
446	+	/* Can't think of a better name for this function */
447	+	kvm_t *get_kvm2() {
448	+	static kvm_t *kvmd2 = NULL;
449	+
450	+	if (kvmd2 != NULL) {
451	+	return kvmd2;
452	+	}
453	+
454	+	kvmd2 = kvm_openfiles(_PATH_DEVNULL, _PATH_DEVNULL, NULL, O_RDONLY, NULL);
455	+	return kvmd2;
456	+	}
457		#endif
458
459	<	#ifdef NETBSD
459	>	#if defined(NETBSD) || defined(OPENBSD)
460		struct uvmexp *get_uvmexp() {
461	<	static u_long addr = 0;
462	<	static struct uvmexp uvm;
463	<	kvm_t *kvmd = get_kvm();
461	>	int mib[2];
462	>	size_t size;
463	>	static struct uvmexp *uvm = NULL;
464	>	struct uvmexp *new;
465
466	<	if (kvmd == NULL) {
466	>	mib[0] = CTL_VM;
467	>	mib[1] = VM_UVMEXP;
468	>
469	>	if (sysctl(mib, 2, NULL, &size, NULL, 0) < 0) {
470		return NULL;
471		}
472
473	<	if (addr == 0) {
474	<	struct nlist symbols[] = {
475	<	{ "_uvmexp" },
101	<	{ NULL }
102	<	};
103	<
104	<	if (kvm_nlist(kvmd, symbols) != 0) {
105	<	return NULL;
106	<	}
107	<	addr = symbols[0].n_value;
473	>	new = realloc(uvm, size);
474	>	if (new == NULL) {
475	>	return NULL;
476		}
477	+	uvm = new;
478
479	<	if (kvm_read(kvmd, addr, &uvm, sizeof uvm) != sizeof uvm) {
479	>	if (sysctl(mib, 2, uvm, &size, NULL, 0) < 0) {
480		return NULL;
481		}
482	<	return &uvm;
482	>
483	>	return uvm;
484		}
485		#endif
486	+
487	+	int statgrab_init(){
488	+	#if (defined(FREEBSD) && !defined(FREEBSD5)) || defined(DFBSD)
489	+	{
490	+	kvm_t *kvmd = get_kvm();
491	+	if (kvmd == NULL) return 1;
492	+	}
493	+	{
494	+	kvm_t *kvmd2 = get_kvm2();
495	+	if (kvmd2 == NULL) return 1;
496	+	}
497	+	#endif
498	+	#if defined(NETBSD) || defined(OPENBSD)
499	+	{
500	+	/* This should always succeed, but it seems that on some
501	+	* versions of NetBSD the first call to get_uvmexp will return
502	+	* a non-filled-in structure; this is a workaround for that.
503	+	*/
504	+	struct uvmexp *uvm = get_uvmexp();
505	+	if (uvm == NULL) return 1;
506	+	}
507	+	#endif
508	+	#ifdef SOLARIS
509	+	/* On solaris 7, this will fail if you are not root. But, everything
510	+	* will still work, just no disk mappings. So we will ignore the exit
511	+	* status of this, and carry on merrily.
512	+	*/
513	+	#ifdef HAVE_LIBDEVINFO_H
514	+	build_mapping();
515	+	#endif
516	+	#endif
517	+	return 0;
518	+	}
519	+
520	+	int statgrab_drop_privileges() {
521	+	if (setegid(getgid()) != 0) return -1;
522	+	if (seteuid(getuid()) != 0) return -1;
523	+	return 0;
524	+	}
525

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines