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
|
/*
* buffer.c
*
* Copyright (C) Thomas Oestreich - June 2001
*
* This file is part of transcode, a video stream processing tool
*
* transcode 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, or (at your option)
* any later version.
*
* transcode 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 GNU Make; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include "buffer.h"
#include <stdlib.h>
#include <unistd.h>
buffer_list_t *buffer_list_head;
buffer_list_t *buffer_list_tail;
buffer_list_t *buffer_register(int id)
{
/* objectives:
===========
register new buffer
allocate space for new buffer and establish backward reference
*/
buffer_list_t *ptr;
// retrive a valid pointer from the pool
if((ptr = malloc(sizeof(buffer_list_t))) == NULL) return(NULL);
if((ptr->data = (char *) malloc(MAX_PCM_BUFFER)) == NULL) return(NULL);
ptr->status = BUFFER_EMPTY;
ptr->next = NULL;
ptr->prev = NULL;
ptr->id = id;
if(buffer_list_tail != NULL)
{
buffer_list_tail->next = ptr;
ptr->prev = buffer_list_tail;
}
buffer_list_tail = ptr;
/* first buffer registered must set buffer_list_head */
if(buffer_list_head == NULL) buffer_list_head = ptr;
return(ptr);
}
/* ------------------------------------------------------------------ */
void buffer_remove(buffer_list_t *ptr)
{
/* objectives:
===========
remove buffer from chained list
*/
if(ptr == NULL) return; // do nothing if null pointer
if(ptr->prev != NULL) (ptr->prev)->next = ptr->next;
if(ptr->next != NULL) (ptr->next)->prev = ptr->prev;
if(ptr == buffer_list_tail) buffer_list_tail = ptr->prev;
if(ptr == buffer_list_head) buffer_list_head = ptr->next;
// release valid pointer to pool
ptr->status = BUFFER_EMPTY;
free(ptr->data);
free(ptr);
ptr=NULL;
}
/* ------------------------------------------------------------------ */
buffer_list_t *buffer_retrieve()
{
/* objectives:
===========
get pointer to next full buffer
*/
buffer_list_t *ptr;
ptr = buffer_list_head;
/* move along the chain and check for status */
while(ptr != NULL)
{
if(ptr->status == BUFFER_READY)
{
return(ptr);
}
ptr = ptr->next;
}
return(NULL);
}
/*************************************************************************/
/*
* Local variables:
* c-file-style: "stroustrup"
* c-file-offsets: ((case-label . *) (statement-case-intro . *))
* indent-tabs-mode: nil
* End:
*
* vim: expandtab shiftwidth=4:
*/
|
