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.
27 #include "s_expression.h"
29 s_symbol::s_symbol(const char *str
, size_t n
)
31 /* Assume the given string is already nul-terminated and in memory that
32 * will live as long as this node.
34 assert(str
[n
] == '\0');
43 skip_whitespace(const char *&src
, char *&symbol_buffer
)
45 size_t n
= strspn(src
, " \v\t\r\n");
48 /* Also skip Scheme-style comments: semi-colon 'til end of line */
50 n
= strcspn(src
, "\n");
53 skip_whitespace(src
, symbol_buffer
);
58 read_atom(void *ctx
, const char *&src
, char *&symbol_buffer
)
60 s_expression
*expr
= NULL
;
62 skip_whitespace(src
, symbol_buffer
);
64 size_t n
= strcspn(src
, "( \v\t\r\n);");
66 return NULL
; // no atom
68 // Check for the special symbol '+INF', which means +Infinity. Note: C99
69 // requires strtof to parse '+INF' as +Infinity, but we still support some
70 // non-C99-compliant compilers (e.g. MSVC).
71 if (n
== 4 && strncmp(src
, "+INF", 4) == 0) {
72 expr
= new(ctx
) s_float(std::numeric_limits
<float>::infinity());
74 // Check if the atom is a number.
75 char *float_end
= NULL
;
76 float f
= _mesa_strtof(src
, &float_end
);
77 if (float_end
!= src
) {
79 int i
= strtol(src
, &int_end
, 10);
80 // If strtof matched more characters, it must have a decimal part
81 if (float_end
> int_end
)
82 expr
= new(ctx
) s_float(f
);
84 expr
= new(ctx
) s_int(i
);
86 // Not a number; return a symbol.
87 symbol_buffer
[n
] = '\0';
88 expr
= new(ctx
) s_symbol(symbol_buffer
, n
);
99 __read_expression(void *ctx
, const char *&src
, char *&symbol_buffer
)
101 s_expression
*atom
= read_atom(ctx
, src
, symbol_buffer
);
105 skip_whitespace(src
, symbol_buffer
);
110 s_list
*list
= new(ctx
) s_list
;
113 while ((expr
= __read_expression(ctx
, src
, symbol_buffer
)) != NULL
) {
114 list
->subexpressions
.push_tail(expr
);
116 skip_whitespace(src
, symbol_buffer
);
118 printf("Unclosed expression (check your parenthesis).\n");
129 s_expression::read_expression(void *ctx
, const char *&src
)
133 /* When we encounter a Symbol, we need to save a nul-terminated copy of
134 * the string. However, ralloc_strndup'ing every individual Symbol is
135 * extremely expensive. We could avoid this by simply overwriting the
136 * next character (guaranteed to be whitespace, parens, or semicolon) with
137 * a nul-byte. But overwriting non-whitespace would mess up parsing.
139 * So, just copy the whole buffer ahead of time. Walk both, leaving the
140 * original source string unmodified, and altering the copy to contain the
141 * necessary nul-bytes whenever we encounter a symbol.
143 char *symbol_buffer
= ralloc_strdup(ctx
, src
);
144 return __read_expression(ctx
, src
, symbol_buffer
);
149 printf("%d", this->val
);
152 void s_float::print()
154 printf("%f", this->val
);
157 void s_symbol::print()
159 printf("%s", this->str
);
165 foreach_in_list(s_expression
, expr
, &this->subexpressions
) {
167 if (!expr
->next
->is_tail_sentinel())
173 // --------------------------------------------------
176 s_pattern::match(s_expression
*expr
)
180 case EXPR
: *p_expr
= expr
; break;
181 case LIST
: if (expr
->is_list()) *p_list
= (s_list
*) expr
; break;
182 case SYMBOL
: if (expr
->is_symbol()) *p_symbol
= (s_symbol
*) expr
; break;
183 case NUMBER
: if (expr
->is_number()) *p_number
= (s_number
*) expr
; break;
184 case INT
: if (expr
->is_int()) *p_int
= (s_int
*) expr
; break;
186 s_symbol
*sym
= SX_AS_SYMBOL(expr
);
187 if (sym
!= NULL
&& strcmp(sym
->value(), literal
) == 0)
192 return *p_expr
== expr
;
196 s_match(s_expression
*top
, unsigned n
, s_pattern
*pattern
, bool partial
)
198 s_list
*list
= SX_AS_LIST(top
);
203 foreach_in_list(s_expression
, expr
, &list
->subexpressions
) {
205 return partial
; /* More actual items than the pattern expected */
207 if (expr
== NULL
|| !pattern
[i
].match(expr
))
214 return false; /* Less actual items than the pattern expected */