sl@0
|
1 |
/*
|
sl@0
|
2 |
* LIBOIL - Library of Optimized Inner Loops
|
sl@0
|
3 |
* Copyright (c) 2003,2004 David A. Schleef <ds@schleef.org>
|
sl@0
|
4 |
* All rights reserved.
|
sl@0
|
5 |
*
|
sl@0
|
6 |
* Redistribution and use in source and binary forms, with or without
|
sl@0
|
7 |
* modification, are permitted provided that the following conditions
|
sl@0
|
8 |
* are met:
|
sl@0
|
9 |
* 1. Redistributions of source code must retain the above copyright
|
sl@0
|
10 |
* notice, this list of conditions and the following disclaimer.
|
sl@0
|
11 |
* 2. Redistributions in binary form must reproduce the above copyright
|
sl@0
|
12 |
* notice, this list of conditions and the following disclaimer in the
|
sl@0
|
13 |
* documentation and/or other materials provided with the distribution.
|
sl@0
|
14 |
*
|
sl@0
|
15 |
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
sl@0
|
16 |
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
sl@0
|
17 |
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
sl@0
|
18 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
|
sl@0
|
19 |
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
sl@0
|
20 |
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
sl@0
|
21 |
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
sl@0
|
22 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
sl@0
|
23 |
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
sl@0
|
24 |
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
sl@0
|
25 |
* POSSIBILITY OF SUCH DAMAGE.
|
sl@0
|
26 |
*/
|
sl@0
|
27 |
|
sl@0
|
28 |
#ifdef HAVE_CONFIG_H
|
sl@0
|
29 |
#include "config.h"
|
sl@0
|
30 |
#endif
|
sl@0
|
31 |
#include <liboil/liboilfunction.h>
|
sl@0
|
32 |
#include <liboil/liboildebug.h>
|
sl@0
|
33 |
#include <liboil/liboilutils.h>
|
sl@0
|
34 |
|
sl@0
|
35 |
#ifdef HAVE_UNISTD_H
|
sl@0
|
36 |
#include <unistd.h>
|
sl@0
|
37 |
#endif
|
sl@0
|
38 |
#include <fcntl.h>
|
sl@0
|
39 |
#include <stdlib.h>
|
sl@0
|
40 |
#include <string.h>
|
sl@0
|
41 |
|
sl@0
|
42 |
int
|
sl@0
|
43 |
get_file_int (const char *file, int *value)
|
sl@0
|
44 |
{
|
sl@0
|
45 |
char buffer[20];
|
sl@0
|
46 |
char *endptr;
|
sl@0
|
47 |
int fd;
|
sl@0
|
48 |
int n;
|
sl@0
|
49 |
|
sl@0
|
50 |
fd = open (file, O_RDONLY);
|
sl@0
|
51 |
if (fd < 0) return 0;
|
sl@0
|
52 |
|
sl@0
|
53 |
n = read(fd, buffer, 19);
|
sl@0
|
54 |
close(fd);
|
sl@0
|
55 |
if (n < 0) {
|
sl@0
|
56 |
return 0;
|
sl@0
|
57 |
}
|
sl@0
|
58 |
buffer[n] = 0;
|
sl@0
|
59 |
|
sl@0
|
60 |
*value = strtol (buffer, &endptr, 0);
|
sl@0
|
61 |
|
sl@0
|
62 |
if (endptr[0] == 0 || endptr[0] == '\n') return 1;
|
sl@0
|
63 |
return 0;
|
sl@0
|
64 |
}
|
sl@0
|
65 |
|
sl@0
|
66 |
char *
|
sl@0
|
67 |
get_file (const char *filename)
|
sl@0
|
68 |
{
|
sl@0
|
69 |
char *cpuinfo;
|
sl@0
|
70 |
int fd;
|
sl@0
|
71 |
int n;
|
sl@0
|
72 |
|
sl@0
|
73 |
cpuinfo = malloc(4096);
|
sl@0
|
74 |
if (cpuinfo == NULL) return NULL;
|
sl@0
|
75 |
|
sl@0
|
76 |
fd = open(filename, O_RDONLY);
|
sl@0
|
77 |
if (fd < 0) {
|
sl@0
|
78 |
free (cpuinfo);
|
sl@0
|
79 |
return NULL;
|
sl@0
|
80 |
}
|
sl@0
|
81 |
|
sl@0
|
82 |
n = read(fd, cpuinfo, 4095);
|
sl@0
|
83 |
if (n < 0) {
|
sl@0
|
84 |
free (cpuinfo);
|
sl@0
|
85 |
close (fd);
|
sl@0
|
86 |
return NULL;
|
sl@0
|
87 |
}
|
sl@0
|
88 |
cpuinfo[n] = 0;
|
sl@0
|
89 |
|
sl@0
|
90 |
close (fd);
|
sl@0
|
91 |
|
sl@0
|
92 |
return cpuinfo;
|
sl@0
|
93 |
}
|
sl@0
|
94 |
|
sl@0
|
95 |
char *
|
sl@0
|
96 |
get_cpuinfo_line (char *cpuinfo, const char *tag)
|
sl@0
|
97 |
{
|
sl@0
|
98 |
char *flags;
|
sl@0
|
99 |
char *end;
|
sl@0
|
100 |
char *colon;
|
sl@0
|
101 |
|
sl@0
|
102 |
flags = strstr(cpuinfo,tag);
|
sl@0
|
103 |
if (flags == NULL) return NULL;
|
sl@0
|
104 |
|
sl@0
|
105 |
end = strchr(flags, '\n');
|
sl@0
|
106 |
if (end == NULL) return NULL;
|
sl@0
|
107 |
colon = strchr (flags, ':');
|
sl@0
|
108 |
if (colon == NULL) return NULL;
|
sl@0
|
109 |
colon++;
|
sl@0
|
110 |
if(colon >= end) return NULL;
|
sl@0
|
111 |
|
sl@0
|
112 |
return _strndup (colon, end-colon);
|
sl@0
|
113 |
}
|
sl@0
|
114 |
|
sl@0
|
115 |
char *
|
sl@0
|
116 |
_strndup (const char *s, int n)
|
sl@0
|
117 |
{
|
sl@0
|
118 |
char *r;
|
sl@0
|
119 |
r = malloc (n+1);
|
sl@0
|
120 |
memcpy(r,s,n);
|
sl@0
|
121 |
r[n]=0;
|
sl@0
|
122 |
|
sl@0
|
123 |
return r;
|
sl@0
|
124 |
}
|
sl@0
|
125 |
|
sl@0
|
126 |
char **
|
sl@0
|
127 |
strsplit (char *s)
|
sl@0
|
128 |
{
|
sl@0
|
129 |
char **list = NULL;
|
sl@0
|
130 |
char *tok;
|
sl@0
|
131 |
int n = 0;
|
sl@0
|
132 |
|
sl@0
|
133 |
while (*s == ' ') s++;
|
sl@0
|
134 |
|
sl@0
|
135 |
list = malloc (1 * sizeof(char *));
|
sl@0
|
136 |
while (*s) {
|
sl@0
|
137 |
tok = s;
|
sl@0
|
138 |
while (*s && *s != ' ') s++;
|
sl@0
|
139 |
|
sl@0
|
140 |
list[n] = _strndup (tok, s - tok);
|
sl@0
|
141 |
while (*s && *s == ' ') s++;
|
sl@0
|
142 |
list = realloc (list, (n + 2) * sizeof(char *));
|
sl@0
|
143 |
n++;
|
sl@0
|
144 |
}
|
sl@0
|
145 |
|
sl@0
|
146 |
list[n] = NULL;
|
sl@0
|
147 |
return list;
|
sl@0
|
148 |
}
|
sl@0
|
149 |
|
sl@0
|
150 |
char *
|
sl@0
|
151 |
get_tag_value (char *s, const char *tag)
|
sl@0
|
152 |
{
|
sl@0
|
153 |
char *flags;
|
sl@0
|
154 |
char *end;
|
sl@0
|
155 |
char *colon;
|
sl@0
|
156 |
|
sl@0
|
157 |
flags = strstr(s,tag);
|
sl@0
|
158 |
if (flags == NULL) return NULL;
|
sl@0
|
159 |
|
sl@0
|
160 |
end = strchr(flags, '\n');
|
sl@0
|
161 |
if (end == NULL) return NULL;
|
sl@0
|
162 |
colon = strchr (flags, ':');
|
sl@0
|
163 |
if (colon == NULL) return NULL;
|
sl@0
|
164 |
colon++;
|
sl@0
|
165 |
if(colon >= end) return NULL;
|
sl@0
|
166 |
|
sl@0
|
167 |
return _strndup (colon, end-colon);
|
sl@0
|
168 |
}
|
sl@0
|
169 |
|
sl@0
|
170 |
|