sel-lex.l revision 226031 
1%{
2/*
3 * Copyright (c) 2004, 2008 Kungliga Tekniska H��gskolan
4 * (Royal Institute of Technology, Stockholm, Sweden).
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 *
14 * 2. Redistributions in binary form must reproduce the above copyright
15 *    notice, this list of conditions and the following disclaimer in the
16 *    documentation and/or other materials provided with the distribution.
17 *
18 * 3. Neither the name of the Institute nor the names of its contributors
19 *    may be used to endorse or promote products derived from this software
20 *    without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 */
34
35/* $Id$ */
36
37#ifdef HAVE_CONFIG_H
38#include <config.h>
39#endif
40
41#undef ECHO
42
43#include <stdio.h>
44#include <string.h>
45#include <stdarg.h>
46#include <stdlib.h>
47#include "sel.h"
48#include "sel-gram.h"
49unsigned lineno = 1;
50
51static char * handle_string(void);
52static int lex_input(char *, int);
53
54struct hx_expr_input _hx509_expr_input;
55
56#ifndef YY_NULL
57#define YY_NULL 0
58#endif
59
60#define YY_NO_UNPUT 1
61
62#undef YY_INPUT
63#define YY_INPUT(buf,res,maxsize) (res = lex_input(buf, maxsize))
64
65#undef ECHO
66
67%}
68%%
69
70TRUE			{ return kw_TRUE; }
71FALSE			{ return kw_FALSE; }
72AND			{ return kw_AND; }
73OR			{ return kw_OR; }
74IN			{ return kw_IN; }
75TAILMATCH		{ return kw_TAILMATCH; }
76
77[A-Za-z][-A-Za-z0-9_]*	{
78			  yylval.string = strdup ((const char *)yytext);
79			  return IDENTIFIER;
80			}
81"\""			{ yylval.string = handle_string(); return STRING; }
82\n			{ ++lineno; }
83[,.!={}()%]		{ return *yytext; }
84[ \t]			;
85%%
86
87static char *
88handle_string(void)
89{
90    char x[1024];
91    int i = 0;
92    int c;
93    int quote = 0;
94    while((c = input()) != EOF){
95	if(quote) {
96	    x[i++] = '\\';
97	    x[i++] = c;
98	    quote = 0;
99	    continue;
100	}
101	if(c == '\n'){
102	    _hx509_sel_yyerror("unterminated string");
103	    lineno++;
104	    break;
105	}
106	if(c == '\\'){
107	    quote++;
108	    continue;
109	}
110	if(c == '\"')
111	    break;
112	x[i++] = c;
113    }
114    x[i] = '\0';
115    return strdup(x);
116}
117
118int
119yywrap ()
120{
121     return 1;
122}
123
124static int
125lex_input(char *buf, int max_size)
126{
127    int n;
128
129    n = _hx509_expr_input.length - _hx509_expr_input.offset;
130    if (max_size < n)
131        n = max_size;
132    if (n <= 0)
133	return YY_NULL;
134
135    memcpy(buf, _hx509_expr_input.buf + _hx509_expr_input.offset, n);
136    _hx509_expr_input.offset += n;
137
138    return n;
139}
140