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.10 by pajs, Mon Oct 20 15:25:47 2003 UTC vs.
Revision 1.19 by pajs, Fri Jan 9 16:19:58 2004 UTC

#	Line 25 | Line 25
25		#include <stdio.h>
26		#include <string.h>
27		#include <stdlib.h>
28	+	#include <unistd.h>
29		#include <sys/types.h>
30		#include <regex.h>
31		#ifdef ALLBSD
#	Line 37 | Line 38
38
39		#include "tools.h"
40
41	+	#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	+	struct dirent *dp;
111	+	struct stat stbuf;
112	+	char *svr_name;
113	+	char current_dir[MAXPATHLEN];
114	+	char file_name[MAXPATHLEN];
115	+	char temp_name[MAXPATHLEN];
116	+	char dir_dname[MAXPATHLEN];
117	+	char *dsk_dir;
118	+	int x;
119	+
120	+	dsk_dir = "/dev/osa/dev/dsk";
121	+	strncpy(current_dir, dsk_dir, sizeof current_dir);
122	+	if ((dirp = opendir(current_dir)) == NULL){
123	+	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	+	while ((dp = readdir(dirp)) != NULL){
131	+	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	+	closedir(dirp);
146	+	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	+	return 1;
163	+	}
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	+	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	+	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	+	}
186	+	di_fini(root_node);
187	+	return 0;
188	+	}
189	+
190	+	int build_mapping(){
191	+	char device_name[512];
192	+	int x;
193	+	kstat_ctl_t *kc;
194	+	kstat_t *ksp;
195	+	kstat_io_t kios;
196	+
197	+	if ((kc = kstat_open()) == NULL) {
198	+	return;
199	+	}
200	+
201	+	for (ksp = kc->kc_chain; ksp; ksp = ksp->ks_next) {
202	+	if (!strcmp(ksp->ks_class, "disk")) {
203	+	if(ksp->ks_type != KSTAT_TYPE_IO) continue;
204	+	/* We dont want metadevices appearing as num_diskio */
205	+	if(strcmp(ksp->ks_module, "md")==0) continue;
206	+	if((kstat_read(kc, ksp, &kios))==-1) continue;
207	+	strncpy(device_name, ksp->ks_name, sizeof device_name);
208	+	for(x=0;x<(sizeof device_name);x++){
209	+	if( isdigit((int)device_name[x]) ) break;
210	+	}
211	+	if(x == sizeof device_name) x--;
212	+	device_name[x] = '\0';
213	+	if((get_alias(device_name)) != 0){
214	+	return 1;
215	+	}
216	+	}
217	+	}
218	+
219	+	return 0;
220	+	}
221	+
222	+	#endif
223	+
224	+
225	+
226		char *f_read_line(FILE *f, const char *string){
227		/* Max line length. 8k should be more than enough */
228		static char line[8192];
#	Line 60 | Line 246 | char *get_string_match(char *line, regmatch_t *match){
246		return match_string;
247		}
248
249	<	#ifdef HAVE_ATOLL
249	>
250	>
251	>	#ifndef HAVE_ATOLL
252	>	static long long atoll(const char *s) {
253	>	long long value = 0;
254	>	int isneg = 0;
255	>
256	>	while (*s == ' ' || *s == '\t') {
257	>	s++;
258	>	}
259	>	if (*s == '-') {
260	>	isneg = 1;
261	>	s++;
262	>	}
263	>	while (*s >= '0' && *s <= '9') {
264	>	value = (10 * value) + (*s - '0');
265	>	s++;
266	>	}
267	>	return (isneg ? -value : value);
268	>	}
269	>	#endif
270	>
271	>	#ifndef HAVE_STRLCPY
272	>	*      $OpenBSD: strlcpy.c,v 1.8 2003/06/17 21:56:24 millert Exp $     */
273	>
274	>	/*
275	>	* Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
276	>	*
277	>	* Permission to use, copy, modify, and distribute this software for any
278	>	* purpose with or without fee is hereby granted, provided that the above
279	>	* copyright notice and this permission notice appear in all copies.
280	>	*
281	>	* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
282	>	* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
283	>	* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
284	>	* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
285	>	* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
286	>	* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
287	>	* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
288	>	*/
289	>
290	>	/*
291	>	* Copy src to string dst of size siz.  At most siz-1 characters
292	>	* will be copied.  Always NUL terminates (unless siz == 0).
293	>	* Returns strlen(src); if retval >= siz, truncation occurred.
294	>	*/
295	>	size_t strlcpy(char *dst, const char *src, size_t siz){
296	>	register char *d = dst;
297	>	register const char *s = src;
298	>	register size_t n = siz;
299	>
300	>	/* Copy as many bytes as will fit */
301	>	if (n != 0 && --n != 0) {
302	>	do {
303	>	if ((*d++ = *s++) == 0)
304	>	break;
305	>	} while (--n != 0);
306	>	}
307	>
308	>	/* Not enough room in dst, add NUL and traverse rest of src */
309	>	if (n == 0) {
310	>	if (siz != 0)
311	>	*d = '\0';              /* NUL-terminate dst */
312	>	while (*s++)
313	>	;
314	>	}
315	>
316	>	return(s - src - 1);    /* count does not include NUL */
317	>	}
318	>	#endif
319	>
320	>	#ifndef HAVE_STRLCAT
321	>	/*      $OpenBSD: strlcat.c,v 1.11 2003/06/17 21:56:24 millert Exp $    */
322	>
323	>	/*
324	>	* Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
325	>	*
326	>	* Permission to use, copy, modify, and distribute this software for any
327	>	* purpose with or without fee is hereby granted, provided that the above
328	>	* copyright notice and this permission notice appear in all copies.
329	>	*
330	>	* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
331	>	* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
332	>	* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
333	>	* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
334	>	* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
335	>	* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
336	>	* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
337	>	*/
338	>
339	>	/*
340	>	* Appends src to string dst of size siz (unlike strncat, siz is the
341	>	* full size of dst, not space left).  At most siz-1 characters
342	>	* will be copied.  Always NUL terminates (unless siz <= strlen(dst)).
343	>	* Returns strlen(src) + MIN(siz, strlen(initial dst)).
344	>	* If retval >= siz, truncation occurred.
345	>	*/
346	>	size_t strlcat(char *dst, const char *src, size_t siz){
347	>	register char *d = dst;
348	>	register const char *s = src;
349	>	register size_t n = siz;
350	>	size_t dlen;
351	>
352	>	/* Find the end of dst and adjust bytes left but don't go past end */
353	>	while (n-- != 0 && *d != '\0')
354	>	d++;
355	>	dlen = d - dst;
356	>	n = siz - dlen;
357	>
358	>	if (n == 0)
359	>	return(dlen + strlen(s));
360	>	while (*s != '\0') {
361	>	if (n != 1) {
362	>	*d++ = *s;
363	>	n--;
364	>	}
365	>	s++;
366	>	}
367	>	*d = '\0';
368	>
369	>	return(dlen + (s - src));       /* count does not include NUL */
370	>	}
371	>
372	>	#endif
373	>
374		long long get_ll_match(char *line, regmatch_t *match){
375		char *ptr;
376		long long num;
#	Line 70 | Line 380 | long long get_ll_match(char *line, regmatch_t *match){
380
381		return num;
382		}
73	–	#endif
383
384		#ifdef ALLBSD
385		kvm_t *get_kvm() {
#	Line 115 | Line 424 | struct uvmexp *get_uvmexp() {
424		#endif
425
426		int statgrab_init(){
427	<
428	<	#ifdef ALLBSD
429	<	kvm_t *kvmd;
427	>	#ifdef ALLBSD
428	>	{
429	>	kvm_t *kvmd = get_kvm();
430	>	if (kvmd == NULL) return 1;
431	>	}
432		#endif
433		#ifdef NETBSD
434	<	struct uvmexp *uvm;
434	>	{
435	>	struct uvmexp *uvm = get_uvmexp();
436	>	if (uvm == NULL) return 1;
437	>	}
438		#endif
439	<
440	<	#ifdef ALLBSD
127	<	kvmd = get_kvm();
128	<	if (kvmd == NULL) return 1;
439	>	#ifdef SOLARIS
440	>	if((build_mapping()) != 0) return 1;
441		#endif
130	–	#ifdef NETBSD
131	–	uvm = get_uvmexp();
132	–	if (uvm == NULL) return 1;
133	–	#endif
442		return 0;
443		}
444	+
445	+	int statgrab_drop_privileges() {
446	+	if (setegid(getgid()) != 0) return -1;
447	+	if (seteuid(getuid()) != 0) return -1;
448	+	return 0;
449	+	}
450	+

Diff Legend

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