src/libstatgrab/tools.c

/* 
 * i-scream central monitoring system
 * http://www.i-scream.org
 * Copyright (C) 2000-2003 i-scream
 * 
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 * 
 * This program 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 General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 */

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