summaryrefslogtreecommitdiff
path: root/input.cpp
blob: 5434b2d62e31e496cb9dd58e771ab8723b08e286 (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
133
134
135
136
137
138
139
140
141
142
143
144
/*
 *  Copyright 2007, 2008 Adrian Thurston <thurston@complang.org>
 */

/*  This file is part of Colm.
 *
 *  Colm 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.
 * 
 *  Colm 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 Colm; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA 
 */

#include "input.h"
#include "colm.h"
#include "fsmrun.h"
#include <stdio.h>
#include <iostream>

using std::cerr;
using std::endl;

/*
 * String
 */

int InputStreamString::getData( char *dest, int length )
{ 
	int available = data.length() - offset;

	if ( available < length )
		length = available;

	memcpy( dest, data.data+offset, length );
	offset += length;

	if ( offset == data.length() )
		eof = true;

	return length;
}

void InputStreamString::pushBack( char *data, long len )
{
	assert( len <= offset );
	offset -= len;
}

/*
 * File
 */

int InputStreamFile::isEOF()
{
	return queue == 0 && feof( file );
}

int InputStreamFile::needFlush()
{
	return queue == 0 && feof( file );
}

int InputStreamFile::getData( char *dest, int length )
{
	/* If there is any data in queue, read from that first. */
	if ( queue != 0 ) {
		long avail = queue->length - queue->offset;
		if ( length >= avail ) {
			memcpy( dest, &queue->buf[queue->offset], avail );
			RunBuf *del = queue;
			queue = queue->next;
			delete del;
			return avail;
		}
		else {
			memcpy( dest, &queue->buf[queue->offset], length );
			queue->offset += length;
			return length;
		}
	}
	else {
		return fread( dest, 1, length, file );
	}
}

void InputStreamFile::pushBack( RunBuf *runBuf )
{
	runBuf->next = queue;
	queue = runBuf;
}

/*
 * FD
 */

int InputStreamFD::isEOF()
{
	return queue == 0 && eof;
}

int InputStreamFD::needFlush()
{
	return queue == 0 && eof;
}

void InputStreamFD::pushBack( RunBuf *runBuf )
{
	runBuf->next = queue;
	queue = runBuf;
}

int InputStreamFD::getData( char *dest, int length )
{
	/* If there is any data in queue, read from that first. */
	if ( queue != 0 ) {
		long avail = queue->length - queue->offset;
		if ( length >= avail ) {
			memcpy( dest, &queue->buf[queue->offset], avail );
			RunBuf *del = queue;
			queue = queue->next;
			delete del;
			return avail;
		}
		else {
			memcpy( dest, &queue->buf[queue->offset], length );
			queue->offset += length;
			return length;
		}
	}
	else {
		long got = read( fd, dest, length );
		if ( got == 0 )
			eof = true;
		return got;
	}
}