File: cfg.c

package info (click to toggle)
simpleproxy 3.5-1
  • links: PTS
  • area: main
  • in suites: bullseye, buster, sid, stretch
  • size: 276 kB
  • ctags: 88
  • sloc: ansic: 1,417; sh: 214; makefile: 35
file content (373 lines) | stat: -rw-r--r-- 8,814 bytes parent folder | download
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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
/*
 *  $Id$
 *
 *  Vadim Zaliva <lord@crocodile.org>
 *  http://www.crocodile.org/
 *
 *  Copyright (C) 1999 Vadim Zaliva
 *
 *  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., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 */

#include "cfg.h"
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>
#include <stdarg.h>

#define MAXTOKENLEN 1024

static int cfg_entry_cmp(const void *a,const void *b)
{
    return(strcmp((*((struct Dict **)a))->name, (*((struct Dict **)b))->name));
}

static int cfg_entry_match(const void *a,const void *b)
{
    return(strcmp((const char *)a, (*((struct Dict **)b))->name));
}

char *cfgfind(const char *name,struct Cfg *cfg, int offset)
{
    struct Dict **res;
    
    res=(struct Dict **)bsearch(name,
                                cfg->dict,
                                cfg->nelements,
                                sizeof(struct Dict *),
                                cfg_entry_match
    );
    
    if(!res)
        return NULL;
    
    if(offset>=(*res)->nvalues)
        return NULL;
    
    return (*res)->value[offset];
}

int writecfg(const char *name,struct Cfg *cfg)
{
    FILE *f;
    int  j;
    int i;

    if((f=fopen(name,"wb"))==NULL)
        return -1;
    
    if(cfg)
    {
        for(i=0;i<cfg->nelements;i++)
        {
            if(!cfg->dict[i]->name)
                continue;
            fprintf(f,"%s\t",cfg->dict[i]->name);
            for(j=0;j<cfg->dict[i]->nvalues;j++)
                if(cfg->dict[i]->value[j])
                    fprintf(f," %s",cfg->dict[i]->value[j]); //TODO: quote values with spaces.
            fprintf(f,"\n");
        }
    }
    fclose(f);
    return 0;
}

void freecfg(struct Cfg *cfg)
{
    int i,j;
    
    if(!cfg)
        return;
    
    for(i=0;i<cfg->nelements;i++)
    {
        if(cfg->dict[i]->value)
        {
            for(j=0;j<cfg->dict[i]->nvalues;j++)
                if(cfg->dict[i]->value[j])
                    free(cfg->dict[i]->value[j]);
            free(cfg->dict[i]->value);
        }
        
        if(cfg->dict[i]->name)
            free(cfg->dict[i]->name);
    }
    
    free(cfg->dict);
    free(cfg);
}

struct Cfg *readcfg(const char *name)
{
    struct Cfg *cfg;
    FILE       *f;
    char        tmp[MAXTOKENLEN];
    char       *s;
    int         c;
    
    enum 
    {
        START,
        NAME,
        VALUE,
        INQUOTE,
        WHITESPACE,
        COMMENT
    } state=START;
    
    if((f=fopen(name,"rb"))==NULL)
        return NULL;

    cfg=malloc(sizeof(struct Cfg));
    cfg->nelements=0;
    s=tmp;
    
    while((c=fgetc(f))!=EOF)
    {
        /* Order of 'case' statements is important here! */
        switch(state)
        {
        case START:
            if(c=='#')
            {
                state=COMMENT;
                break;
            }
            else
                if(!isspace(c))
                {
                    s=tmp;
                    state=NAME;
                } else
                {
                    break;
                }
            
        case NAME:
            if(isspace(c))
            {
                struct Dict *tmp1=malloc(sizeof(struct Dict));
                *s='\0';
                tmp1->nvalues = 0;
                tmp1->value   = NULL;
                tmp1->name    = strdup(tmp);
                
                cfg_add_entry(cfg, tmp1);
                
                state=WHITESPACE;
            }
            else
            {
                *s++=c;
                if(s==(tmp+sizeof(tmp)))
                {
                    /* internal buffer overflow */
                    freecfg(cfg);
                    fclose(f);
                    return NULL;
                }
            }
            break;

        case WHITESPACE:
            if(c=='\n')
            {
                state=START;
                break;
            }
            else
            {
                if(!isspace(c))
                {
                    s=tmp;
                    state=VALUE;
                } else
                {
                    break;
                }
            }
            
        case VALUE:
            if(c=='"')
                state=INQUOTE;
            else
                if(isspace(c))
                {
                    struct Dict *last=cfg->dict[cfg->nelements-1];
                    char **tmp1;
                    int  i;
                    
                    *s='\0';
                    tmp1=last->value;
                    last->value=malloc((last->nvalues+1)*sizeof(char *));
                    if(tmp1)
                    {
                        for(i=0;i<last->nvalues;i++)
                            last->value[i]=tmp1[i];
                        free(tmp1);
                    }
                    last->value[last->nvalues]=strdup(tmp);
                    last->nvalues++;
                    if(c=='\n')
                        state=START;
                    else
                        state=WHITESPACE;
                } else
                {
                    *s++=c;
                    if(s==(tmp+sizeof(tmp)))
                    {
                        /* internal buffer overflow */
                        freecfg(cfg);
                        fclose(f);
                        return NULL;
                    }
                }
            break;

        case INQUOTE:
            if(c=='"')
            {
                state=VALUE;
            }
            else
            {
                *s++=c;
                if(s==(tmp+sizeof(tmp)))
                {
                    /* internal buffer overflow */
                    freecfg(cfg);
                    fclose(f);
                    return NULL;
                }
            }
            break;

        case COMMENT:
            if(c=='\n')
                state=START;
            break;
        }
    }

    sortcfg(cfg);
    fclose(f);
    return cfg;
}

/**
 * Sorts cfg.
 * Should be called after each modification
 * before attempting to retrieve any data.
 */
void sortcfg (struct Cfg *cfg)
{
    qsort((void *) cfg->dict,
          cfg->nelements,
          sizeof(struct Dict *),
          cfg_entry_cmp);
    
}

/**
 * Adds new cfg entry to the end of the dictionary.
 * you need to call sortcfg() before it could be
 * really used.
 */
void cfg_add_entry (struct Cfg *cfg, struct Dict *d)
{
    if(cfg->nelements)
    {
        struct Dict **last=cfg->dict;
        cfg->dict=malloc(sizeof(struct Dict *)*(cfg->nelements+1));
        memcpy(cfg->dict,last,sizeof(struct Dict *)*cfg->nelements);
        cfg->dict[cfg->nelements]=d;
        cfg->nelements++;
        free(last);
    }
    else
    {
        cfg->dict      = malloc(sizeof(struct Dict *));
        cfg->dict[0]   = d;
        cfg->nelements = 1;
    }
}


/**
 * Adds entry with given name and list of values.
 * list should be terminated with NULL and contain
 * only const char pointers.
 */
void cfg_new_entry(struct Cfg *cfg, const char *name, ...)
{
    int n;
    va_list ap;
    struct Dict *tmp=malloc(sizeof(struct Dict));
    
    tmp->name    = strdup(name);
    
    va_start(ap,name);
    n=0;
    while(va_arg(ap, const char *)) n++;
    va_end(ap);

    tmp->nvalues = n;
    if(n)
    {
        int i;
        
        va_start(ap,name);
        tmp->value = malloc(n*sizeof(char *));
        for(i=0;i<n;i++)
            tmp->value[i] = strdup(va_arg(ap, const char *));
        va_end(ap);
    } else
    {
        tmp->value = NULL;
    }
    
    cfg_add_entry(cfg, tmp);
}

void  cfg_new_ulong_entry (struct Cfg *cfg, const char *name, unsigned long v)
{
    char tmp[80];
    sprintf(tmp,"%lu",v);
    cfg_new_entry(cfg, name, tmp, NULL);    
}

/**
 * add long extended to 'w' chars, with added trailing zeros.
 *
 * @param v - field value
 * @param w - field width
 */
void  cfg_new_fmt_ulong_entry (struct Cfg *cfg, const char *name, unsigned long v, int w)
{
    char tmp[80];
    sprintf(tmp,"%0*lu",w, v);
    cfg_new_entry(cfg, name, tmp, NULL);    
}

struct Cfg *newcfg ()
{
    struct Cfg *res=malloc(sizeof(struct Cfg));
    res->nelements  = 0;
    return res;
}