src/libstatgrab/tools.c

/*
 * i-scream central monitoring system
 * http://www.i-scream.org
 * Copyright (C) 2000-2004 i-scream
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 * 
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
 * 02111-1307 USA
 *
 * $Id$
 */

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <regex.h>
#ifdef ALLBSD
#include <fcntl.h>
#include <kvm.h>
#endif
#ifdef NETBSD
#include <uvm/uvm_extern.h>
#endif

#include "tools.h"

#ifdef SOLARIS
#include <libdevinfo.h>
#include <kstat.h>
#include <unistd.h>
#include <ctype.h>
#include <sys/types.h>
#include <sys/dkio.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <sys/fcntl.h>
#include <dirent.h>
#endif

#ifdef SOLARIS
struct map{
        char *bsd;
        char *svr;

        struct map *next;
};
typedef struct map mapping_t;

static mapping_t *mapping = NULL; 

char *get_svr_from_bsd(char *bsd){
        mapping_t *map_ptr;
        for(map_ptr = mapping; map_ptr != NULL; map_ptr = map_ptr->next)
                if(!strcmp(map_ptr->bsd, bsd)) return map_ptr->svr;

        return bsd;
}

void add_mapping(char *bsd, char *svr){
        mapping_t *map_ptr;
        mapping_t *map_end_ptr;

        bsd = strdup(bsd);
        svr = strdup(svr);

        if (mapping == NULL){
                mapping = malloc(sizeof(mapping_t));
                if (mapping == NULL) return;
                map_ptr = mapping;
        }else{
                /* See if its already been added */
                for(map_ptr = mapping; map_ptr != NULL; map_ptr = map_ptr->next){
                        if( (!strcmp(map_ptr->bsd, bsd)) || (!strcmp(map_ptr->svr, svr)) ){
                                return;
                        }
                        map_end_ptr = map_ptr;
                }

                /* We've reached end of list and not found the entry.. So we need to malloc
                 * new mapping_t
                 */
                map_end_ptr->next = malloc(sizeof(mapping_t));
                if (map_end_ptr->next == NULL) return;
                map_ptr = map_end_ptr->next;
        }

        map_ptr->next = NULL;
        map_ptr->bsd = bsd;
        map_ptr->svr = svr;

        return;
}

char *read_dir(char *disk_path){
        DIR *dirp;
        struct dirent *dp;
        struct stat stbuf;
        char *svr_name;
        char current_dir[MAXPATHLEN];
        char file_name[MAXPATHLEN];
        char temp_name[MAXPATHLEN];
        char dir_dname[MAXPATHLEN];
        char *dsk_dir;
        int x;

        dsk_dir = "/dev/osa/dev/dsk";
        strncpy(current_dir, dsk_dir, sizeof current_dir);
        if ((dirp = opendir(current_dir)) == NULL){
                dsk_dir = "/dev/dsk";
                snprintf(current_dir, sizeof current_dir, "%s", dsk_dir);
                if ((dirp = opendir(current_dir)) == NULL){
                        return NULL;
                }
        }

        while ((dp = readdir(dirp)) != NULL){
                snprintf(temp_name, sizeof temp_name, "../..%s", disk_path);
                snprintf(dir_dname, sizeof dir_dname, "%s/%s", dsk_dir, dp->d_name);
                stat(dir_dname,&stbuf);

                if (S_ISBLK(stbuf.st_mode)){
                        x = readlink(dir_dname, file_name, sizeof(file_name));
                        file_name[x] = '\0';
                        if (strcmp(file_name, temp_name) == 0) {
                                svr_name = strdup(dp->d_name);
                                closedir(dirp);
                                return svr_name;
                        }
                }
        }
        closedir(dirp);
        return NULL;
}


int get_alias(char *alias){
        char file[MAXPATHLEN];
        di_node_t root_node;
        di_node_t node;
        di_minor_t minor = DI_MINOR_NIL;
        char tmpnode[MAXPATHLEN];
        char *phys_path;
        char *minor_name;
        char *value;
        int instance;
        if ((root_node = di_init("/", DINFOCPYALL)) == DI_NODE_NIL) {
                return 1;
        }
        node = di_drv_first_node(alias, root_node);
        while (node != DI_NODE_NIL) {
                if ((minor = di_minor_next(node, DI_MINOR_NIL)) != DI_MINOR_NIL) {
                        instance = di_instance(node);
                        phys_path = di_devfs_path(node);
                        minor_name = di_minor_name(minor);
                        strcpy(tmpnode, alias);
                        sprintf(tmpnode, "%s%d", tmpnode, instance);
                        strlcpy(file, "/devices", sizeof file);
                        strlcat(file, phys_path, sizeof file);
                        strlcat(file, ":", sizeof file);
                        strlcat(file, minor_name, sizeof file);
                        value = read_dir(file);
                        if (value != NULL){
                                add_mapping(tmpnode, value);
                        }
                        di_devfs_path_free(phys_path);
                        node = di_drv_next_node(node);
                }else{
                        node = di_drv_next_node(node);
                }
        }
        di_fini(root_node);
        return 0;
}


#define BIG_ENOUGH 512
int build_mapping(){
        char device_name[BIG_ENOUGH];
        int x;
        kstat_ctl_t *kc;
        kstat_t *ksp;
        kstat_io_t kios;

        char driver_list[BIG_ENOUGH][BIG_ENOUGH];
        int list_entries = 0;
        int found;

        if ((kc = kstat_open()) == NULL) {
                return;
        }

        for (ksp = kc->kc_chain; ksp; ksp = ksp->ks_next) {
                if (!strcmp(ksp->ks_class, "disk")) {
                        if(ksp->ks_type != KSTAT_TYPE_IO) continue;
                        /* We dont want metadevices appearing as num_diskio */
                        if(strcmp(ksp->ks_module, "md")==0) continue;
                        if((kstat_read(kc, ksp, &kios))==-1) continue;
                        strncpy(device_name, ksp->ks_name, sizeof device_name);
                        for(x=0;x<(sizeof device_name);x++){
                                if( isdigit((int)device_name[x]) ) break;
                        }
                        if(x == sizeof device_name) x--;
                        device_name[x] = '\0';

                        /* Check if we've not already looked it up */
                        found = 0;
                        for(x=0;x<list_entries;x++){
                                if (x>=BIG_ENOUGH){
                                        /* We've got bigger than we thought was massive */
                                        /* If we hit this.. Make big enough bigger */
                                        return 1;
                                }
                                if( !strncmp(driver_list[x], device_name, BIG_ENOUGH)){
                                        found = 1;
                                        break;
                                }
                        }

                        if(!found){
                                if((get_alias(device_name)) != 0){
                                        return 1;
                                }
                                strncpy(driver_list[x], device_name, BIG_ENOUGH);
                                list_entries++;
                        }
                }
        }

        return 0;
}

#endif


char *f_read_line(FILE *f, const char *string){
        /* Max line length. 8k should be more than enough */
        static char line[8192];

        while((fgets(line, sizeof(line), f))!=NULL){
                if(strncmp(string, line, strlen(string))==0){
                        return line;
                }
        }

        return NULL;
}

char *get_string_match(char *line, regmatch_t *match){
        int len=match->rm_eo - match->rm_so;
        char *match_string=malloc(len+1);

        match_string=strncpy(match_string, line+match->rm_so, len);
        match_string[len]='\0';

        return match_string;
}


#ifndef HAVE_ATOLL
static long long atoll(const char *s) {
        long long value = 0;
        int isneg = 0;

        while (*s == ' ' || *s == '\t') {
                s++;
        }
        if (*s == '-') {
                isneg = 1;
                s++;
        }
        while (*s >= '0' && *s <= '9') {
                value = (10 * value) + (*s - '0');
                s++;
        }
        return (isneg ? -value : value);
}
#endif

#ifndef HAVE_STRLCPY
/*      $OpenBSD: strlcpy.c,v 1.8 2003/06/17 21:56:24 millert Exp $     */

/*
 * Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

/*
 * Copy src to string dst of size siz.  At most siz-1 characters
 * will be copied.  Always NUL terminates (unless siz == 0).
 * Returns strlen(src); if retval >= siz, truncation occurred.
 */
size_t strlcpy(char *dst, const char *src, size_t siz){
        register char *d = dst;
        register const char *s = src;
        register size_t n = siz;

        /* Copy as many bytes as will fit */
        if (n != 0 && --n != 0) {
                do {
                        if ((*d++ = *s++) == 0)
                                break;
                } while (--n != 0);
        }

        /* Not enough room in dst, add NUL and traverse rest of src */
        if (n == 0) {
                if (siz != 0)
                        *d = '\0';              /* NUL-terminate dst */
                while (*s++)
                        ;
        }

        return(s - src - 1);    /* count does not include NUL */
}
#endif

#ifndef HAVE_STRLCAT
/*      $OpenBSD: strlcat.c,v 1.11 2003/06/17 21:56:24 millert Exp $    */

/*
 * Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

/*
 * Appends src to string dst of size siz (unlike strncat, siz is the
 * full size of dst, not space left).  At most siz-1 characters
 * will be copied.  Always NUL terminates (unless siz <= strlen(dst)).
 * Returns strlen(src) + MIN(siz, strlen(initial dst)).
 * If retval >= siz, truncation occurred.
 */
size_t strlcat(char *dst, const char *src, size_t siz){
        register char *d = dst;
        register const char *s = src;
        register size_t n = siz;
        size_t dlen;

        /* Find the end of dst and adjust bytes left but don't go past end */
        while (n-- != 0 && *d != '\0')
                d++;
        dlen = d - dst;
        n = siz - dlen;

        if (n == 0)
                return(dlen + strlen(s));
        while (*s != '\0') {
                if (n != 1) {
                        *d++ = *s;
                        n--;
                }
                s++;
        }
        *d = '\0';

        return(dlen + (s - src));       /* count does not include NUL */
}

#endif

long long get_ll_match(char *line, regmatch_t *match){
        char *ptr;
        long long num;

        ptr=line+match->rm_so;
        num=atoll(ptr);

        return num;
}

#ifdef ALLBSD
kvm_t *get_kvm() {
        static kvm_t *kvmd = NULL;

        if (kvmd != NULL) {
                return kvmd;
        }

        kvmd = kvm_openfiles(NULL, NULL, NULL, O_RDONLY, NULL);
        return kvmd;
}
#endif

#ifdef NETBSD
struct uvmexp *get_uvmexp() {
        static u_long addr = 0;
        static struct uvmexp uvm;
        kvm_t *kvmd = get_kvm();

        if (kvmd == NULL) {
                return NULL;
        }

        if (addr == 0) {
                struct nlist symbols[] = {
                        { "_uvmexp" },
                        { NULL }
                };

                if (kvm_nlist(kvmd, symbols) != 0) {
                        return NULL;
                }
                addr = symbols[0].n_value;
        }

        if (kvm_read(kvmd, addr, &uvm, sizeof uvm) != sizeof uvm) {
                return NULL;
        }
        return &uvm;
}
#endif

int statgrab_init(){
#ifdef ALLBSD 
        { 
                kvm_t *kvmd = get_kvm(); 
                if (kvmd == NULL) return 1;
        }
#endif
#ifdef NETBSD
        {
                struct uvmexp *uvm = get_uvmexp();
                if (uvm == NULL) return 1;
        }
#endif
#ifdef SOLARIS
        /* On solaris 7, this will fail if you are not root. But, everything
         * will still work, just no disk mappings. So we will ignore the exit
         * status of this, and carry on merrily.
         */
        build_mapping();
#endif
        return 0;
}

int statgrab_drop_privileges() {
        if (setegid(getgid()) != 0) return -1;
        if (seteuid(getuid()) != 0) return -1;
        return 0;
}

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