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
|
/* $OpenBSD: opt.c,v 1.10 2010/07/06 01:12:45 ratchov Exp $ */
/*
* Copyright (c) 2008 Alexandre Ratchov <alex@caoua.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "dev.h"
#include "conf.h"
#include "opt.h"
#ifdef DEBUG
#include "dbg.h"
#endif
struct optlist opt_list = SLIST_HEAD_INITIALIZER(&opt_list);
void
opt_new(char *name, struct dev *d, struct aparams *wpar, struct aparams *rpar,
int maxweight, int mmc, int join, unsigned mode)
{
struct opt *o;
unsigned len;
char c;
for (len = 0; name[len] != '\0'; len++) {
if (len == OPT_NAMEMAX) {
fprintf(stderr, "%s: name too long\n", name);
exit(1);
}
c = name[len];
if (c < 'a' && c > 'z' &&
c < 'A' && c > 'Z' &&
c < '0' && c > '9' &&
c != '_') {
fprintf(stderr, "%s: '%c' not allowed\n", name, c);
exit(1);
}
}
SLIST_FOREACH(o, &opt_list, entry) {
if (strcmp(name, o->name) == 0) {
fprintf(stderr, "%s: already defined\n", name);
exit(1);
}
}
o = malloc(sizeof(struct opt));
if (o == NULL) {
perror("opt_new: malloc");
exit(1);
}
memcpy(o->name, name, len + 1);
if (mode & MODE_RECMASK)
o->wpar = (mode & MODE_MON) ? *rpar : *wpar;
if (mode & MODE_PLAY)
o->rpar = *rpar;
o->maxweight = maxweight;
o->mmc = mmc;
o->join = join;
o->mode = mode;
o->dev = d;
#ifdef DEBUG
if (debug_level >= 2) {
dbg_puts(o->name);
dbg_puts("@");
dbg_puts(o->dev->path);
dbg_puts(":");
if (mode & MODE_REC) {
dbg_puts(" rec=");
dbg_putu(o->wpar.cmin);
dbg_puts(":");
dbg_putu(o->wpar.cmax);
}
if (mode & MODE_PLAY) {
dbg_puts(" play=");
dbg_putu(o->rpar.cmin);
dbg_puts(":");
dbg_putu(o->rpar.cmax);
dbg_puts(" vol=");
dbg_putu(o->maxweight);
}
if (mode & MODE_MON) {
dbg_puts(" mon=");
dbg_putu(o->wpar.cmin);
dbg_puts(":");
dbg_putu(o->wpar.cmax);
}
if (o->mmc)
dbg_puts(" mmc");
dbg_puts("\n");
}
#endif
SLIST_INSERT_HEAD(&opt_list, o, entry);
}
struct opt *
opt_byname(char *name)
{
struct opt *o;
SLIST_FOREACH(o, &opt_list, entry) {
if (strcmp(name, o->name) == 0) {
#ifdef DEBUG
if (debug_level >= 3) {
dbg_puts(o->name);
dbg_puts(": option found\n");
}
#endif
return o;
}
}
#ifdef DEBUG
if (debug_level >= 3) {
dbg_puts(name);
dbg_puts(": option not found\n");
}
#endif
return NULL;
}
|
