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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
#include "SpoolRewindInputStream.hpp"
#include "Logger.hpp"
#include <algorithm>
#include <cstring>
#include <cassert>
using namespace std;
spool_streambuf::spool_streambuf( size_t bufSize, size_t putBack, size_t spoolBufSize )
: m_putBack( max( putBack, size_t( 1 ) ) ),
m_spoolBuf( spoolBufSize ), m_spoolBufPos( 0 ),
m_spoolBufSize( spoolBufSize ), m_state( TO_SPOOL_MEMORY ),
m_buf( max( bufSize, putBack ) + putBack ),
m_base( 0 ), m_start( 0 )
{
char *end = &m_buf.front( ) + m_buf.size( );
setg( end, end, end );
}
spool_streambuf::~spool_streambuf( )
{
switch( m_state ) {
case TO_SPOOL_MEMORY:
case FROM_SPOOL_MEMORY:
// memory only, nothing to clean up
break;
case TO_SPOOL_FILE:
case FROM_SPOOL_FILE:
m_spoolFile.close( );
(void)remove( "/tmp/spool.tmp" );
break;
}
}
streambuf::int_type spool_streambuf::underflow( )
{
// check if buffer is exhausted, if not, return current character
if( gptr( ) < egptr( ) )
return traits_type::to_int_type( *gptr( ) );
m_base = &m_buf.front( );
m_start = m_base;
// move put back away
if( eback( ) == m_base ) {
memmove( m_base, egptr( ) - m_putBack, m_putBack );
m_start += m_putBack;
}
// read from source or spool (depends on calling rewind)
streambuf::int_type n;
switch( m_state ) {
case TO_SPOOL_MEMORY:
case TO_SPOOL_FILE:
n = readFromSource( );
if( n == 0 ) {
return traits_type::eof( );
} else if( n < 0 ) {
// TODO handle error
return traits_type::eof( );
}
if( m_state == TO_SPOOL_MEMORY ) {
// as long we can "spool" to memory, do so..
if( m_spoolBufPos + n <= m_spoolBufSize ) {
m_spoolBuf.insert( m_spoolBuf.begin( ) + m_spoolBufPos, m_start, m_start + n );
m_spoolBufPos += n;
} else {
// ..otherwise start spooling to disk, write
// current memory spool buffer first..
LOG( logWARNING ) << "Spooling spool buffer exceeded (>" << m_spoolBufSize << ")";
m_spoolFile.open( "/tmp/spool.tmp", ios::binary | ios::out | ios::trunc );
assert( m_spoolFile.good( ) );
m_spoolFile.write( &m_spoolBuf.front( ), m_spoolBufSize );
assert( m_spoolFile.good( ) );
m_state = TO_SPOOL_FILE;
m_spoolFile.write( m_start, n );
assert( m_spoolFile.good( ) );
}
} else {
// we are appending to the spool file
assert( m_spoolFile.good( ) );
m_spoolFile.write( m_start, n );
assert( m_spoolFile.good( ) );
}
break;
case FROM_SPOOL_MEMORY:
n = min( m_buf.size( ) - ( m_start - m_base ), m_spoolBufSize - m_spoolBufPos );
if( n == 0 ) {
return traits_type::eof( );
}
copy( m_spoolBuf.begin( ) + m_spoolBufPos,
m_spoolBuf.begin( ) + m_spoolBufPos + n,
m_buf.begin( ) + ( m_start - m_base ) );
m_spoolBufPos += n;
break;
case FROM_SPOOL_FILE:
n = min( m_buf.size( ) - ( m_start - m_base ), m_spoolBufSize - m_spoolBufPos );
m_spoolFile.read( m_start, n );
m_spoolBufPos += n;
if( m_spoolBufPos > m_spoolBufSize ) {
return traits_type::eof( );
}
if( n == 0 || m_spoolFile.eof( ) ) {
return traits_type::eof( );
}
break;
}
// set pointers
setg( m_base, m_start, m_start + n );
return traits_type::to_int_type( *gptr( ) );
}
void spool_streambuf::rewind( )
{
switch( m_state ) {
case TO_SPOOL_MEMORY:
m_spoolBufPos = 0;
m_state = FROM_SPOOL_MEMORY;
break;
case TO_SPOOL_FILE:
m_spoolFile.close( );
m_spoolFile.open( "/tmp/spool.tmp", ios::binary | ios::in );
m_spoolFile.seekg( 0, ios::end );
m_spoolBufSize = m_spoolFile.tellg( );
m_spoolFile.seekg( 0, ios::beg );
m_spoolBufPos = 0;
m_state = FROM_SPOOL_FILE;
break;
case FROM_SPOOL_MEMORY:
m_spoolBufPos = 0;
break;
case FROM_SPOOL_FILE:
m_spoolBufPos = 0;
m_spoolFile.seekg( 0, ios::beg );
break;
}
char *end = &m_buf.front( ) + m_buf.size( );
setg( end, end, end );
pubseekpos( 0, ios_base::in );
}
SpoolRewindInputStream::SpoolRewindInputStream( const URL &url )
: RewindInputStream( url ), m_buf( 0 )
{
}
SpoolRewindInputStream::~SpoolRewindInputStream( )
{
}
void SpoolRewindInputStream::rewind( )
{
// consume rest of web request, force spooling in streambuf
enum { CHUNKSIZE = 1024 };
char buf[CHUNKSIZE];
while( good( ) && !eof( ) ) {
read( buf, CHUNKSIZE );
}
ios::clear( );
assert( m_buf != 0 );
m_buf->rewind( );
}
|
