1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
/* opkg_utils.c - the opkg package management system
Steven M. Ayer
Copyright (C) 2002 Compaq Computer Corporation
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, 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.
*/
#include "includes.h"
#include <errno.h>
#include <ctype.h>
#include <sys/vfs.h>
#include "opkg_utils.h"
#include "pkg.h"
#include "pkg_hash.h"
void print_pkg_status(pkg_t * pkg, FILE * file);
long unsigned int get_available_blocks(char * filesystem)
{
struct statfs sfs;
if(statfs(filesystem, &sfs)){
fprintf(stderr, "bad statfs\n");
return 0;
}
/* fprintf(stderr, "reported fs type %x\n", sfs.f_type); */
// Actually ((sfs.f_bavail * sfs.f_bsize) / 1024)
// and here we try to avoid overflow.
if (sfs.f_bsize >= 1024)
return (sfs.f_bavail * (sfs.f_bsize / 1024));
else if (sfs.f_bsize > 0)
return sfs.f_bavail / (1024 / sfs.f_bsize);
fprintf(stderr, "bad statfs f_bsize == 0\n");
return 0;
}
char **read_raw_pkgs_from_file(const char *file_name)
{
FILE *fp;
char **ret;
if(!(fp = fopen(file_name, "r"))){
fprintf(stderr, "can't get %s open for read\n", file_name);
return NULL;
}
ret = read_raw_pkgs_from_stream(fp);
fclose(fp);
return ret;
}
char **read_raw_pkgs_from_stream(FILE *fp)
{
char **raw = NULL, *buf, *scout;
int count = 0;
size_t size = 512;
buf = calloc (1, size);
while (fgets(buf, size, fp)) {
while (strlen (buf) == (size - 1)
&& buf[size-2] != '\n') {
size_t o = size - 1;
size *= 2;
buf = realloc (buf, size);
if (fgets (buf + o, size - o, fp) == NULL)
break;
}
if(!(count % 50))
raw = realloc(raw, (count + 50) * sizeof(char *));
if((scout = strchr(buf, '\n')))
*scout = '\0';
raw[count++] = strdup(buf);
}
raw = realloc(raw, (count + 1) * sizeof(char *));
raw[count] = NULL;
free (buf);
return raw;
}
/* something to remove whitespace, a hash pooper */
char *trim_alloc(char *line)
{
char *new;
char *dest, *src, *end;
new = calloc(1, strlen(line) + 1);
if ( new == NULL ){
fprintf(stderr,"%s: Unable to allocate memory\n",__FUNCTION__);
return NULL;
}
dest = new, src = line, end = line + (strlen(line) - 1);
/* remove it from the front */
while(src &&
isspace(*src) &&
*src)
src++;
/* and now from the back */
while((end > src) &&
isspace(*end))
end--;
end++;
*end = '\0';
strcpy(new, src);
/* this does from the first space
* blasting away any versions stuff in depends
while(src &&
!isspace(*src) &&
*src)
*dest++ = *src++;
*dest = '\0';
*/
return new;
}
int line_is_blank(const char *line)
{
const char *s;
for (s = line; *s; s++) {
if (!isspace(*s))
return 0;
}
return 1;
}
/*
* XXX: this function should not allocate memory as it may be called to
* print an error because we are out of memory.
*/
void push_error_list(struct errlist ** errors, char * msg){
struct errlist *err_lst_tmp;
err_lst_tmp = calloc (1, sizeof (struct errlist) );
if (err_lst_tmp == NULL) {
fprintf(stderr, "%s: calloc: %s\n", __FUNCTION__, strerror(errno));
return;
}
err_lst_tmp->errmsg = strdup(msg);
if (err_lst_tmp->errmsg == NULL) {
fprintf(stderr, "%s: strdup: %s\n", __FUNCTION__, strerror(errno));
free(err_lst_tmp);
return;
}
err_lst_tmp->next = *errors;
*errors = err_lst_tmp;
}
void reverse_error_list(struct errlist **errors){
struct errlist *result=NULL;
struct errlist *current= *errors;
struct errlist *next;
while ( current != NULL ) {
next = current->next;
current->next=result;
result=current;
current=next;
}
*errors=result;
}
void free_error_list(struct errlist **errors){
struct errlist *err_tmp_lst;
err_tmp_lst = *errors;
while (err_tmp_lst != NULL) {
free(err_tmp_lst->errmsg);
err_tmp_lst = error_list->next;
free(*errors);
*errors = err_tmp_lst;
}
}
|
