blob: 1b2626ecf5a936738f3eb18c1a90512476d000f6 (
plain)
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
|
/* Processing Queue Management */
/*
* This file is part of gapk (GSM Audio Pocket Knife).
*
* gapk 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 3 of the License, or
* (at your option) any later version.
*
* gapk 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 gapk. If not, see <http://www.gnu.org/licenses/>.
*/
#include <errno.h>
#include <stdint.h>
#include <stdlib.h>
#include <gapk/procqueue.h>
#define MAX_PQ_ITEMS 8
struct pq {
int n_items;
struct pq_item* items[MAX_PQ_ITEMS];
void * buffers[MAX_PQ_ITEMS+1];
};
struct pq *
pq_create(void)
{
return (struct pq *) calloc(1, sizeof(struct pq));
}
void
pq_destroy(struct pq *pq)
{
int i;
if (!pq)
return;
for (i=0; i<pq->n_items; i++) {
if (!pq->items[i])
continue;
if (pq->items[i]->exit)
pq->items[i]->exit(pq->items[i]->state);
free(pq->items[i]);
}
for (i=0; i<pq->n_items-1; i++)
free(pq->buffers[i]); /* free is NULL safe */
free(pq);
}
struct pq_item *
pq_add_item(struct pq *pq)
{
struct pq_item *item;
if (pq->n_items == MAX_PQ_ITEMS)
return NULL;
item = calloc(1, sizeof(struct pq_item));
if (!item)
return NULL;
pq->items[pq->n_items++] = item;
return item;
}
int
pq_prepare(struct pq *pq)
{
int i;
unsigned int len_prev;
len_prev = 0;
for (i=0; i<pq->n_items; i++) {
struct pq_item *item = pq->items[i];
if (item->len_in != len_prev)
return -EINVAL;
if (i < (pq->n_items-1)) {
pq->buffers[i] = malloc(item->len_out);
if (!pq->buffers[i])
return -ENOMEM;
} else{
if (item->len_out)
return -EINVAL;
}
len_prev = item->len_out;
}
return 0;
}
int
pq_execute(struct pq *pq)
{
int i;
void *buf_prev, *buf;
buf_prev = NULL;
for (i=0; i<pq->n_items; i++) {
int rv;
struct pq_item *item = pq->items[i];
buf = i < (pq->n_items-1) ? pq->buffers[i] : NULL;
rv = item->proc(item->state, buf, buf_prev);
if (rv)
return rv;
buf_prev = buf;
}
return 0;
}
|
