1 /*
2 * This file is part of flex.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 *
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * Neither the name of the University nor the names of its contributors
15 * may be used to endorse or promote products derived from this software
16 * without specific prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
19 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
20 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
21 * PURPOSE.
22 */
23
24 %{
25 /* A file to build "scanner.c". */
26 /* This tests that we can use "yyextra".
27 We buffer all input into a growable array, then print it.
28 We run diff on the input and output.
29 */
30
31 #include <stdio.h>
32 #include <stdlib.h>
33 #include "config.h"
34
35
36 /* We'll store the entire input in this buffer, growing as necessary. */
37 struct Buffer {
38 int curr_len;
39 int max_len;
40 int grow_len;
41 char * data;
42 };
43 #define YY_EXTRA_TYPE struct Buffer *
44
45 /* Save char into junk array at next position. */
46 static void append_char (char c, yyscan_t scanner );
47
48 %}
49
50 %option 8bit prefix="test"
51 %option nounput nomain noyywrap nodefault noinput
52 %option warn
53 %option reentrant
54
55
56 %%
57
58 .|\r|\n { append_char (yytext[0],yyscanner); }
59
60 %%
61
62 int main(void);
63
64 int
main()65 main ()
66 {
67 yyscan_t scanner;
68 struct Buffer * buf;
69 int i;
70
71 buf = (struct Buffer*) malloc(sizeof(struct Buffer));
72 buf->curr_len =0;
73 buf->max_len = 4;
74 buf->grow_len = 100;
75 buf->data = (char*)malloc(buf->max_len);
76
77 testlex_init(&scanner);
78 testset_in( stdin, scanner);
79 testset_out( stdout, scanner);
80 testset_extra( buf, scanner );
81 testlex(scanner);
82
83 buf = testget_extra(scanner);
84 for(i=0; i < buf->curr_len; i++)
85 fputc( buf->data[i], stdout );
86 free( buf->data);
87 free( buf);
88
89 testlex_destroy(scanner);
90 return 0;
91 }
92
93 /* Save char into junk array at next position. */
append_char(char c,yyscan_t scanner)94 static void append_char (char c, yyscan_t scanner )
95 {
96 struct Buffer *buf, *new_buf;
97 buf = testget_extra(scanner);
98
99 /* Grow buffer if necessary. */
100
101 if( buf->curr_len >= buf->max_len )
102 {
103 new_buf = (struct Buffer*) malloc(sizeof(struct Buffer));
104 new_buf->max_len = buf->max_len + buf->grow_len;
105 new_buf->grow_len = buf->grow_len;
106 new_buf->data = (char*)malloc(new_buf->max_len);
107 for( new_buf->curr_len = 0;
108 new_buf->curr_len < buf->curr_len;
109 new_buf->curr_len++ )
110 {
111 new_buf->data[ new_buf->curr_len] = buf->data [ new_buf->curr_len];
112 }
113 free( buf->data );
114 free( buf );
115 buf = new_buf;
116 testset_extra( buf, scanner );
117 }
118
119
120 buf->data[ buf->curr_len++ ] = c;
121 }
122