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: sel-lex.l,v 1.1.1.1 2011/06/10 09:34:42 andrew Exp $ */ 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#define YY_NO_UNPUT 1 57 58#undef YY_INPUT 59#define YY_INPUT(buf,res,maxsize) (res = lex_input(buf, maxsize)) 60 61#undef ECHO 62 63%} 64%% 65 66TRUE { return kw_TRUE; } 67FALSE { return kw_FALSE; } 68AND { return kw_AND; } 69OR { return kw_OR; } 70IN { return kw_IN; } 71TAILMATCH { return kw_TAILMATCH; } 72 73[A-Za-z][-A-Za-z0-9_]* { 74 yylval.string = strdup ((const char *)yytext); 75 return IDENTIFIER; 76 } 77"\"" { yylval.string = handle_string(); return STRING; } 78\n { ++lineno; } 79[,.!={}()%] { return *yytext; } 80[ \t] ; 81%% 82 83static char * 84handle_string(void) 85{ 86 char x[1024]; 87 int i = 0; 88 int c; 89 int quote = 0; 90 while((c = input()) != EOF){ 91 if(quote) { 92 x[i++] = '\\'; 93 x[i++] = c; 94 quote = 0; 95 continue; 96 } 97 if(c == '\n'){ 98 _hx509_sel_yyerror("unterminated string"); 99 lineno++; 100 break; 101 } 102 if(c == '\\'){ 103 quote++; 104 continue; 105 } 106 if(c == '\"') 107 break; 108 x[i++] = c; 109 } 110 x[i] = '\0'; 111 return strdup(x); 112} 113 114int 115yywrap () 116{ 117 return 1; 118} 119 120static int 121lex_input(char *buf, int max_size) 122{ 123 int n; 124 125 n = _hx509_expr_input.length - _hx509_expr_input.offset; 126 if (max_size < n) 127 n = max_size; 128 if (n <= 0) 129 return YY_NULL; 130 131 memcpy(buf, _hx509_expr_input.buf + _hx509_expr_input.offset, n); 132 _hx509_expr_input.offset += n; 133 134 return n; 135} 136