BadVPN – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /** |
2 | * @file BPredicate.l |
||
3 | * @author Ambroz Bizjak <ambrop7@gmail.com> |
||
4 | * |
||
5 | * @section LICENSE |
||
6 | * |
||
7 | * Redistribution and use in source and binary forms, with or without |
||
8 | * modification, are permitted provided that the following conditions are met: |
||
9 | * 1. Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * 2. 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 | * 3. Neither the name of the author nor the |
||
15 | * names of its contributors may be used to endorse or promote products |
||
16 | * derived from this software without specific prior written permission. |
||
17 | * |
||
18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
||
19 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
||
20 | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
||
21 | * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY |
||
22 | * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
||
23 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
||
24 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
||
25 | * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
||
27 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
28 | * |
||
29 | * @section DESCRIPTION |
||
30 | * |
||
31 | * {@link BPredicate} lexer file. |
||
32 | */ |
||
33 | |||
34 | %{ |
||
35 | |||
36 | #include <string.h> |
||
37 | #include <stdlib.h> |
||
38 | |||
39 | #include <predicate/LexMemoryBufferInput.h> |
||
40 | #include <predicate/BPredicate_internal.h> |
||
41 | |||
42 | #include <generated/bison_BPredicate.h> |
||
43 | |||
44 | #define YY_INPUT(buffer, res, max_size) \ |
||
45 | int bytes_read = LexMemoryBufferInput_Read((LexMemoryBufferInput *)yyget_extra(yyscanner), buffer, max_size); \ |
||
46 | res = (bytes_read == 0 ? YY_NULL : bytes_read); |
||
47 | |||
48 | %} |
||
49 | |||
50 | %option reentrant stack noyywrap bison-bridge bison-locations never-interactive nounistd |
||
51 | |||
52 | %% |
||
53 | \( return SPAR; |
||
54 | \) return EPAR; |
||
55 | , return COMMA; |
||
56 | AND return AND; |
||
57 | OR return OR; |
||
58 | NOT return NOT; |
||
59 | true return CONSTANT_TRUE; |
||
60 | false return CONSTANT_FALSE; |
||
61 | [a-zA-Z0-9_]+ { |
||
62 | int l = strlen(yytext); |
||
63 | char *p = (char *)malloc(l + 1); |
||
64 | if (p) { |
||
65 | memcpy(p, yytext, l); |
||
66 | p[l] = '\0'; |
||
67 | } |
||
68 | yylval->text = p; |
||
69 | return NAME; |
||
70 | } |
||
71 | \"[^\"]*\" { |
||
72 | int l = strlen(yytext); |
||
73 | char *p = (char *)malloc(l - 1); |
||
74 | if (p) { |
||
75 | memcpy(p, yytext + 1, l - 2); |
||
76 | p[l - 2] = '\0'; |
||
77 | } |
||
78 | yylval->text = p; |
||
79 | return STRING; |
||
80 | } |
||
81 | [ \t\n]+ ; |
||
82 | . LexMemoryBufferInput_SetError((LexMemoryBufferInput *)yyget_extra(yyscanner)); return 0; // remember failure and report EOF |
||
83 | %% |