3 * Copyright © 2010 Intel Corporation
5 * Permission is hereby granted, free of charge, to any person obtaining a
6 * copy of this software and associated documentation files (the "Software"),
7 * to deal in the Software without restriction, including without limitation
8 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 * and/or sell copies of the Software, and to permit persons to whom the
10 * Software is furnished to do so, subject to the following conditions:
12 * The above copyright notice and this permission notice (including the next
13 * paragraph) shall be included in all copies or substantial portions of the
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
21 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
22 * DEALINGS IN THE SOFTWARE.
28 #include "s_expression.h"
30 s_symbol::s_symbol(const char *str
, size_t n
)
32 /* Assume the given string is already nul-terminated and in memory that
33 * will live as long as this node.
35 assert(str
[n
] == '\0');
44 skip_whitespace(const char *&src
, char *&symbol_buffer
)
46 size_t n
= strspn(src
, " \v\t\r\n");
49 /* Also skip Scheme-style comments: semi-colon 'til end of line */
51 n
= strcspn(src
, "\n");
54 skip_whitespace(src
, symbol_buffer
);
59 read_atom(void *ctx
, const char *&src
, char *&symbol_buffer
)
61 s_expression
*expr
= NULL
;
63 skip_whitespace(src
, symbol_buffer
);
65 size_t n
= strcspn(src
, "( \v\t\r\n);");
67 return NULL
; // no atom
69 // Check for the special symbol '+INF', which means +Infinity. Note: C99
70 // requires strtof to parse '+INF' as +Infinity, but we still support some
71 // non-C99-compliant compilers (e.g. MSVC).
72 if (n
== 4 && strncmp(src
, "+INF", 4) == 0) {
73 expr
= new(ctx
) s_float(INFINITY
);
75 // Check if the atom is a number.
76 char *float_end
= NULL
;
77 float f
= _mesa_strtof(src
, &float_end
);
78 if (float_end
!= src
) {
80 int i
= strtol(src
, &int_end
, 10);
81 // If strtof matched more characters, it must have a decimal part
82 if (float_end
> int_end
)
83 expr
= new(ctx
) s_float(f
);
85 expr
= new(ctx
) s_int(i
);
87 // Not a number; return a symbol.
88 symbol_buffer
[n
] = '\0';
89 expr
= new(ctx
) s_symbol(symbol_buffer
, n
);
100 __read_expression(void *ctx
, const char *&src
, char *&symbol_buffer
)
102 s_expression
*atom
= read_atom(ctx
, src
, symbol_buffer
);
106 skip_whitespace(src
, symbol_buffer
);
111 s_list
*list
= new(ctx
) s_list
;
114 while ((expr
= __read_expression(ctx
, src
, symbol_buffer
)) != NULL
) {
115 list
->subexpressions
.push_tail(expr
);
117 skip_whitespace(src
, symbol_buffer
);
119 printf("Unclosed expression (check your parenthesis).\n");
130 s_expression::read_expression(void *ctx
, const char *&src
)
134 /* When we encounter a Symbol, we need to save a nul-terminated copy of
135 * the string. However, ralloc_strndup'ing every individual Symbol is
136 * extremely expensive. We could avoid this by simply overwriting the
137 * next character (guaranteed to be whitespace, parens, or semicolon) with
138 * a nul-byte. But overwriting non-whitespace would mess up parsing.
140 * So, just copy the whole buffer ahead of time. Walk both, leaving the
141 * original source string unmodified, and altering the copy to contain the
142 * necessary nul-bytes whenever we encounter a symbol.
144 char *symbol_buffer
= ralloc_strdup(ctx
, src
);
145 return __read_expression(ctx
, src
, symbol_buffer
);
150 printf("%d", this->val
);
153 void s_float::print()
155 printf("%f", this->val
);
158 void s_symbol::print()
160 printf("%s", this->str
);
166 foreach_in_list(s_expression
, expr
, &this->subexpressions
) {
168 if (!expr
->next
->is_tail_sentinel())
174 // --------------------------------------------------
177 s_pattern::match(s_expression
*expr
)
181 case EXPR
: *p_expr
= expr
; break;
182 case LIST
: if (expr
->is_list()) *p_list
= (s_list
*) expr
; break;
183 case SYMBOL
: if (expr
->is_symbol()) *p_symbol
= (s_symbol
*) expr
; break;
184 case NUMBER
: if (expr
->is_number()) *p_number
= (s_number
*) expr
; break;
185 case INT
: if (expr
->is_int()) *p_int
= (s_int
*) expr
; break;
187 s_symbol
*sym
= SX_AS_SYMBOL(expr
);
188 if (sym
!= NULL
&& strcmp(sym
->value(), literal
) == 0)
193 return *p_expr
== expr
;
197 s_match(s_expression
*top
, unsigned n
, s_pattern
*pattern
, bool partial
)
199 s_list
*list
= SX_AS_LIST(top
);
204 foreach_in_list(s_expression
, expr
, &list
->subexpressions
) {
206 return partial
; /* More actual items than the pattern expected */
208 if (expr
== NULL
|| !pattern
[i
].match(expr
))
215 return false; /* Less actual items than the pattern expected */