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
|
/*----------------------------------------------------------------
* partial loading mechanism
*
* Copyright (C) 1996-1999 Takashi Iwai
*
* 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 <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>
#include "util.h"
#include "aweseq.h"
static void set_preset(SFPatchRec *pat, char *arg);
/*----------------------------------------------------------------*/
LoadList *awe_add_loadlist(LoadList *list, SFPatchRec *pat, SFPatchRec *map)
{
LoadList *rec;
rec = (LoadList*)safe_malloc(sizeof(LoadList));
rec->pat = *pat;
if (map)
rec->map = *map;
else
rec->map = *pat;
rec->loaded = FALSE;
rec->next = list;
return rec;
}
/* add the elements in the latter list to the former one */
LoadList *awe_merge_loadlist(LoadList *list, LoadList *old)
{
LoadList *p;
for (p = old; p; p = p->next) {
list = awe_add_loadlist(list, &p->pat, &p->map);
list->loaded = p->loaded;
}
return list;
}
/* free all the elements in the list */
void awe_free_loadlist(LoadList *p)
{
LoadList *next;
for (; p; p = next) {
next = p->next;
safe_free(p);
}
}
/* parse source and mapping presets and return the remaining string;
* the original argument will be broken
*/
int awe_parse_loadlist(char *arg, SFPatchRec *pat, SFPatchRec *map, char **strp)
{
char *next;
if ((next = strschr(arg, ":=")) != NULL)
*next++ = 0;
set_preset(pat, arg);
if (next == NULL) {
*map = *pat;
if (strp) *strp = NULL;
return TRUE;
}
arg = next;
if ((next = strschr(arg, ":=")) != NULL)
*next++ = 0;
set_preset(map, arg);
if (strp) *strp = next;
return TRUE;
}
/* ascii to digit; accept * and - characters */
static int parse_arg(char *arg)
{
if (isdigit(*arg))
return atoi(arg);
else
return -1;
}
/* parse preset/bank/keynote */
static void set_preset(SFPatchRec *pat, char *arg)
{
char *next;
if ((next = strschr(arg, "/: \t\n")) != NULL)
*next++ = 0;
pat->preset = parse_arg(arg);
pat->bank = 0;
pat->keynote = -1;
arg = next;
if (arg) {
if ((next = strschr(arg, "/: \t\n")) != NULL)
*next++ = 0;
pat->bank = parse_arg(arg);
if (next)
pat->keynote = parse_arg(next);
}
}
/* check the preset matches to the given pattern (rec) */
int awe_match_preset(SFPatchRec *rec, SFPatchRec *pat)
{
if (rec->preset != -1 && pat->preset != -1 &&
rec->preset != pat->preset)
return FALSE;
if (rec->bank != -1 && pat->bank != -1 &&
rec->bank != pat->bank)
return FALSE;
if (rec->keynote != -1 && pat->keynote != -1 &&
rec->keynote != pat->keynote)
return FALSE;
return TRUE;
}
/* merge two matching bank/preset/key records */
void awe_merge_keys(SFPatchRec *p1, SFPatchRec *p2, SFPatchRec *rec)
{
rec->bank = (p1->bank == -1 ? p2->bank : p1->bank);
rec->preset = (p1->preset == -1 ? p2->preset : p1->preset);
rec->keynote = (p1->keynote == -1 ? p2->keynote : p1->keynote);
}
|
