2 * Copyright (c) 2015 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
15 #include <vlib/vlib.h>
18 vlib_lex_main_t vlib_lex_main;
22 u8 * format_vlib_lex_token (u8 * s, va_list * args)
24 vlib_lex_main_t *lm = va_arg (*args, vlib_lex_main_t *);
25 vlib_lex_token_t *t = va_arg (*args, vlib_lex_token_t *);
27 if (t->token == VLIB_LEX_word)
28 s = format (s, "%s", t->value.as_pointer);
30 s = format (s, "%s", lm->lex_token_names[t->token]);
34 void vlib_lex_get_token (vlib_lex_main_t * lm, vlib_lex_token_t * rv)
38 vlib_lex_table_entry_t *e;
41 if (PREDICT_FALSE (lm->pushback_sp >= 0))
43 rv[0] = lm->pushback_vector [lm->pushback_sp--];
47 rv->value.as_uword = ~0;
51 if (PREDICT_FALSE(lm->current_index >= vec_len (lm->input_vector)))
53 rv->token = VLIB_LEX_eof;
57 t = vec_elt_at_index (lm->lex_tables, lm->current_table_index);
58 c = (lm->input_vector [lm->current_index++]) & 0x7f;
60 lm->current_table_index = e->next_table_index;
67 case VLIB_LEX_START_NUMBER:
68 lm->current_token_value = 0;
71 case VLIB_LEX_ADD_TO_NUMBER:
72 lm->current_number_base = e->token;
73 lm->current_token_value *= lm->current_number_base;
75 if (tv >= lm->current_number_base)
78 if (tv >= lm->current_number_base)
81 lm->current_token_value += tv;
84 case VLIB_LEX_ADD_TO_TOKEN:
85 vec_add1(lm->token_buffer, c);
88 case VLIB_LEX_KEYWORD_CHECK: {
91 vec_add1 (lm->token_buffer, 0);
93 /* It's either a keyword or just a word. */
94 p = hash_get_mem (lm->lex_keywords, lm->token_buffer);
99 clib_warning ("keyword '%s' token %s",
101 lm->lex_token_names[rv->token]);
106 rv->token = VLIB_LEX_word;
107 rv->value.as_pointer = vec_dup (lm->token_buffer);
109 clib_warning ("%s, value '%s'",
110 lm->lex_token_names[VLIB_LEX_word],
111 rv->value.as_pointer);
113 _vec_len (lm->token_buffer) = 0;
115 /* Rescan the character which terminated the keyword/word. */
120 case VLIB_LEX_RETURN_AND_RESCAN:
121 ASSERT(lm->current_index);
123 /* note flow-through */
125 case VLIB_LEX_RETURN:
126 rv->token = e->token;
127 rv->value.as_uword = lm->current_token_value;
128 lm->current_token_value = ~0;
131 clib_warning ("table %s char '%c'(0x%02x) next table %s return %s",
132 t->name, c, c, lm->lex_tables[e->next_table_index].name,
133 lm->lex_token_names[e->token]);
134 if (rv->token == VLIB_LEX_number)
135 clib_warning (" numeric value 0x%x (%d)", rv->value,
143 u16 vlib_lex_add_token (vlib_lex_main_t *lm, char *token_name)
148 p = hash_get_mem (lm->lex_tokens_by_name, token_name);
153 rv = vec_len (lm->lex_token_names);
154 hash_set_mem (lm->lex_tokens_by_name, token_name, rv);
155 vec_add1 (lm->lex_token_names, token_name);
160 static u16 add_keyword (vlib_lex_main_t *lm, char *keyword, char *token_name)
165 p = hash_get_mem (lm->lex_keywords, keyword);
169 token = vlib_lex_add_token (lm, token_name);
171 hash_set_mem (lm->lex_keywords, keyword, token);
175 u16 vlib_lex_find_or_add_keyword (vlib_lex_main_t *lm, char *keyword, char *token_name)
177 uword * p = hash_get_mem (lm->lex_keywords, keyword);
178 return p ? p[0] : add_keyword (lm, keyword, token_name);
181 void vlib_lex_set_action_range (u32 table_index, u8 lo, u8 hi, u16 action,
182 u16 token, u32 next_table_index)
185 vlib_lex_main_t *lm = &vlib_lex_main;
186 vlib_lex_table_t *t = pool_elt_at_index (lm->lex_tables, table_index);
188 for (i = lo; i <= hi; i++)
190 ASSERT (i < ARRAY_LEN (t->entries));
191 t->entries[i].action = action;
192 t->entries[i].token = token;
193 t->entries[i].next_table_index = next_table_index;
197 u16 vlib_lex_add_table (char *name)
199 vlib_lex_main_t *lm = &vlib_lex_main;
203 p = hash_get_mem (lm->lex_tables_by_name, name);
207 pool_get_aligned (lm->lex_tables, t, CLIB_CACHE_LINE_BYTES);
211 hash_set_mem (lm->lex_tables_by_name, name, t - lm->lex_tables);
213 vlib_lex_set_action_range (t - lm->lex_tables, 1, 0x7F, VLIB_LEX_IGNORE, ~0,
216 vlib_lex_set_action_range (t - lm->lex_tables, 0, 0, VLIB_LEX_RETURN, VLIB_LEX_eof,
219 return t - lm->lex_tables;
222 void vlib_lex_reset (vlib_lex_main_t *lm, u8 *input_vector)
224 if (lm->pushback_vector)
225 _vec_len (lm->pushback_vector) = 0;
226 lm->pushback_sp = -1;
228 lm->input_vector = input_vector;
229 lm->current_index = 0;
232 static clib_error_t * lex_onetime_init (vlib_main_t * vm)
234 vlib_lex_main_t *lm = &vlib_lex_main;
236 lm->lex_tables_by_name = hash_create_string (0, sizeof (uword));
237 lm->lex_tokens_by_name = hash_create_string (0, sizeof (uword));
238 lm->lex_keywords = hash_create_string (0, sizeof (uword));
239 lm->pushback_sp = -1;
241 #define _(f) { u16 tmp = vlib_lex_add_token (lm, #f); ASSERT (tmp == VLIB_LEX_##f); }
242 foreach_vlib_lex_global_token;
245 vec_validate (lm->token_buffer, 127);
246 _vec_len (lm->token_buffer) = 0;
251 VLIB_INIT_FUNCTION (lex_onetime_init);