-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathbuffer.c
139 lines (127 loc) · 3.47 KB
/
buffer.c
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
/*
* Copyright (c) 2016, Kalopa Research. All rights reserved. This 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.
*
* It 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 product; see the file COPYING. If not, write to the Free
* Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*
* THIS SOFTWARE IS PROVIDED BY KALOPA RESEARCH "AS IS" AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL KALOPA RESEARCH BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <syslog.h>
#include <string.h>
#include "sermux.h"
struct buffer *freelist = NULL;
/*
* Allocate a free buffer. If there's one on the free list, use that.
* Otherwise, allocate one.
*/
struct buffer *
buf_alloc()
{
struct buffer *bp;
if ((bp = freelist) != NULL)
freelist = bp->next;
else {
if ((bp = (struct buffer *)malloc(sizeof(struct buffer))) == NULL) {
syslog(LOG_ERR, "buf_alloc() malloc: %m");
exit(1);
}
}
bp->size = 0;
bp->next = NULL;
return(bp);
}
/*
* Free up a buffer by sticking it on the free list.
*/
void
buf_free(struct buffer *bp)
{
bp->next = freelist;
freelist = bp;
}
/*
* Flush all the buffers on a given channel.
*/
void
buf_flush(struct channel *chp)
{
struct buffer *bp;
while ((bp = chp->bhead) != NULL) {
chp->bhead = bp->next;
buf_free(bp);
}
}
/*
* Read data for a specific channel into a buffer and queue up the buffer.
*/
int
buf_read(struct channel *chp)
{
struct buffer *bp = buf_alloc();
/*
* Read from the device.
*/
if ((bp->size = read(chp->fd, bp->data, READSIZE)) <= 0) {
buf_free(bp);
return(-1);
}
/*
* Stick the buffer on the end of the channel read queue.
*/
chp->totread += bp->size;
if (chp->bhead == NULL)
chp->bhead = bp;
else {
struct buffer *nbp;
for (nbp = chp->bhead; nbp->next != NULL; nbp = nbp->next)
;
nbp->next = bp;
}
return(bp->size);
}
/*
* Write data from a specific channel to the specified file descriptor.
* We assume we can write at least READSIZE bytes, or else we'll fail.
* Otherwise we'd have to deal with partial buffers, and who wants that?
*/
int
buf_write(struct channel *chp, int wrfd)
{
int n;
struct buffer *bp;
/*
* Pull the buffer from the head of the queue and write it out
* to the specified device.
*/
bp = chp->bhead;
chp->bhead = bp->next;
if ((n = write(wrfd, bp->data, bp->size)) != bp->size)
return(-1);
/*
* Release the buffer and we're done.
*/
chp->totread -= n;
buf_free(bp);
return(n);
}