|
1 /* vim: set noet nosta sw=4 ts=4 ft=c : */ |
|
2 /* |
|
3 Copyright (c) 2011, Mahlon E. Smith <mahlon@martini.nu> |
|
4 All rights reserved. |
|
5 Redistribution and use in source and binary forms, with or without |
|
6 modification, are permitted provided that the following conditions are met: |
|
7 |
|
8 * Redistributions of source code must retain the above copyright |
|
9 notice, this list of conditions and the following disclaimer. |
|
10 |
|
11 * Redistributions in binary form must reproduce the above copyright |
|
12 notice, this list of conditions and the following disclaimer in the |
|
13 documentation and/or other materials provided with the distribution. |
|
14 |
|
15 * Neither the name of Mahlon E. Smith nor the names of his |
|
16 contributors may be used to endorse or promote products derived |
|
17 from this software without specific prior written permission. |
|
18 |
|
19 THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY |
|
20 EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|
21 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|
22 DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY |
|
23 DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|
24 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
|
25 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
|
26 ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
27 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
|
28 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
29 */ |
|
30 |
|
31 #include "volta.h" |
|
32 |
|
33 /* |
|
34 * Accept lines from squid and pass to the parser. |
|
35 */ |
|
36 int |
|
37 accept_loop( void ) |
|
38 { |
|
39 /* incoming line (stack) */ |
|
40 char buf[ LINE_BUFSIZE ]; |
|
41 |
|
42 /* incoming line (heap) */ |
|
43 char *line = NULL; |
|
44 |
|
45 /* the length of the incoming line buffer */ |
|
46 unsigned short int bufsize; |
|
47 |
|
48 debug( 1, LOC, "Waiting for input...\n" ); |
|
49 while ( fgets( buf, LINE_BUFSIZE, stdin ) != NULL ) { |
|
50 |
|
51 bufsize = strlen( buf ); |
|
52 |
|
53 /* Common case, or last iteration of loop: |
|
54 End of line was found without filling LINE_BUFSIZE |
|
55 */ |
|
56 if ( bufsize + 1 < LINE_BUFSIZE ) { |
|
57 /* line wasn't concatenated onto in previous loops, |
|
58 * just pass it directly to parse() */ |
|
59 if ( line == NULL ) { |
|
60 parse( buf ); |
|
61 } |
|
62 |
|
63 /* memory was previously allocated to contain the line, |
|
64 * append the final chunk, pass to parse(), and cleanup. */ |
|
65 else { |
|
66 if ( (line = extend_line( line, buf )) == NULL ) continue; |
|
67 parse( line ); |
|
68 free( line ); |
|
69 line = NULL; |
|
70 } |
|
71 } |
|
72 |
|
73 /* If we've filled LINE_BUFSIZE on this iteration, we were likely |
|
74 * passed a very long URL that we'll need to allocate more memory |
|
75 * for. Rebuild the line in chunks for each loop iteration. |
|
76 * |
|
77 * If we didn't do this, you could thwart proper parsing by |
|
78 * simply sending requests greater than LINE_BUFSIZE characters. |
|
79 */ |
|
80 else { |
|
81 if ( (line = extend_line( line, buf )) == NULL ) continue; |
|
82 |
|
83 /* Special case if the current buffer's last character is a |
|
84 * newline. This means that the buffer length is exactly |
|
85 * LINE_BUFSIZE, but we can't simply check for that, since |
|
86 * we don't know if there are more iterations pending |
|
87 * (within the current line) that still need to be appended. |
|
88 */ |
|
89 if ( buf[ bufsize - 1 ] == '\n' ) { |
|
90 parse( line ); |
|
91 free( line ); |
|
92 line = NULL; |
|
93 } |
|
94 } |
|
95 } |
|
96 |
|
97 /* stdin closed */ |
|
98 debug( 1, LOC, "End of stream\n" ); |
|
99 return( 0 ); |
|
100 } |
|
101 |