2013-11-13 22:50:38 +04:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include "option_list.h"
|
|
|
|
|
|
|
|
typedef struct{
|
|
|
|
char *key;
|
|
|
|
char *val;
|
|
|
|
int used;
|
|
|
|
} kvp;
|
|
|
|
|
|
|
|
void option_insert(list *l, char *key, char *val)
|
|
|
|
{
|
|
|
|
kvp *p = malloc(sizeof(kvp));
|
|
|
|
p->key = key;
|
|
|
|
p->val = val;
|
|
|
|
p->used = 0;
|
|
|
|
list_insert(l, p);
|
|
|
|
}
|
|
|
|
|
|
|
|
void option_unused(list *l)
|
|
|
|
{
|
|
|
|
node *n = l->front;
|
|
|
|
while(n){
|
|
|
|
kvp *p = (kvp *)n->val;
|
|
|
|
if(!p->used){
|
|
|
|
fprintf(stderr, "Unused field: '%s = %s'\n", p->key, p->val);
|
|
|
|
}
|
|
|
|
n = n->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
char *option_find(list *l, char *key)
|
|
|
|
{
|
|
|
|
node *n = l->front;
|
|
|
|
while(n){
|
|
|
|
kvp *p = (kvp *)n->val;
|
|
|
|
if(strcmp(p->key, key) == 0){
|
|
|
|
p->used = 1;
|
|
|
|
return p->val;
|
|
|
|
}
|
|
|
|
n = n->next;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
char *option_find_str(list *l, char *key, char *def)
|
|
|
|
{
|
|
|
|
char *v = option_find(l, key);
|
|
|
|
if(v) return v;
|
|
|
|
fprintf(stderr, "%s: Using default '%s'\n", key, def);
|
|
|
|
return def;
|
|
|
|
}
|
|
|
|
|
|
|
|
int option_find_int(list *l, char *key, int def)
|
|
|
|
{
|
|
|
|
char *v = option_find(l, key);
|
|
|
|
if(v) return atoi(v);
|
|
|
|
fprintf(stderr, "%s: Using default '%d'\n", key, def);
|
|
|
|
return def;
|
|
|
|
}
|
|
|
|
|
2014-01-29 04:28:42 +04:00
|
|
|
float option_find_float(list *l, char *key, float def)
|
2013-11-13 22:50:38 +04:00
|
|
|
{
|
|
|
|
char *v = option_find(l, key);
|
|
|
|
if(v) return atof(v);
|
|
|
|
fprintf(stderr, "%s: Using default '%lf'\n", key, def);
|
|
|
|
return def;
|
|
|
|
}
|