maug
Quick and dirty C mini-augmentation library.
Loading...
Searching...
No Matches
mlisps.h
Go to the documentation of this file.
1
2#ifndef MLISPS_H
3#define MLISPS_H
4
12
13#ifndef MLISP_TRACE_LVL
14# define MLISP_TRACE_LVL 0
15#endif /* !MLISP_TRACE_LVL */
16
17#ifndef MLISP_TRACE_SIGIL
18# define MLISP_TRACE_SIGIL "TRACE"
19#endif /* !MLISP_TRACE_SIGIL */
20
21#ifndef MLISP_AST_IDX_CHILDREN_MAX
22# define MLISP_AST_IDX_CHILDREN_MAX 10
23#endif /* !MLISP_AST_IDX_CHILDREN_MAX */
24
30#define MLISP_EXEC_FLAG_TRANSIENT_MASK 0x0f
31
37#define MLISP_EXEC_FLAG_DEF_TERM 0x20
38
47#define MLISP_EXEC_FLAG_SHARED_ENV 0x40
48
49#define MLISP_EXEC_FLAG_INITIALIZED 0x08
50
55
56typedef ssize_t mlisp_lambda_t;
57
58typedef mlisp_lambda_t mlisp_args_t;
59typedef mlisp_lambda_t mlisp_arge_t;
60typedef mlisp_lambda_t mlisp_if_t;
61typedef mlisp_lambda_t mlisp_begin_t;
62
63typedef uint8_t mlisp_bool_t;
64
70#define MLISP_NUM_TYPE_TABLE( f ) \
71 f( 1, int16_t, integer, INT, "%d" ) \
72 f( 2, float, floating, FLOAT, "%f" ) \
73 f( 3, mlisp_bool_t, boolean, BOOLEAN, "%u" )
74
80#define MLISP_TYPE_TABLE( f ) \
81 MLISP_NUM_TYPE_TABLE( f ) \
82 f( 4, mdata_strpool_idx_t, strpool_idx, STR, SSIZE_T_FMT ) \
83 f( 5, mlisp_env_cb_t, cb, CB, "%p" ) \
84 f( 6, mlisp_lambda_t, lambda, LAMBDA, SSIZE_T_FMT ) \
85 f( 7, mlisp_args_t, args_start, ARGS_S, SSIZE_T_FMT ) \
86 f( 8, mlisp_arge_t, args_end, ARGS_E, SSIZE_T_FMT ) \
87 f(10, mlisp_begin_t, begin, BEGIN, SSIZE_T_FMT )
88 /* mlisp_types */
90
91struct MLISP_PARSER;
92struct MLISP_EXEC_STATE;
93
94typedef MERROR_RETVAL (*mlisp_env_cb_t)(
95 struct MLISP_PARSER* parser, struct MLISP_EXEC_STATE* exec, size_t n_idx,
96 size_t args_c, void* cb_data, uint8_t flags );
97
98#define _MLISP_TYPE_TABLE_FIELDS( idx, ctype, name, const_name, fmt ) \
99 ctype name;
100
102 MLISP_TYPE_TABLE( _MLISP_TYPE_TABLE_FIELDS )
103};
104
106 uint8_t flags;
107 uint8_t type;
108 mdata_strpool_idx_t name_strpool_idx;
109 union MLISP_VAL value;
110 void* cb_data;
111};
112
114 uint8_t type;
115 union MLISP_VAL value;
116};
117
119 uint8_t flags;
120 mdata_strpool_idx_t token_idx;
121 size_t token_sz;
122 ssize_t ast_idx_parent;
123 ssize_t env_idx_op;
124 ssize_t ast_idx_children[MLISP_AST_IDX_CHILDREN_MAX];
127};
128
138 uint8_t flags;
162 void* cb_attachment;
163#ifdef MLISP_DEBUG_TRACE
164 size_t trace[MLISP_DEBUG_TRACE];
165 size_t trace_depth;
166#endif /* MLISP_DEBUG_TRACE */
167};
168
170 struct MPARSER base;
171 struct MDATA_STRPOOL strpool;
172 struct MDATA_VECTOR ast;
178 ssize_t ast_node_iter;
179};
180 /* mlisp */
182
183#endif /* !MLISPS_H */
184
int MERROR_RETVAL
Return type indicating function returns a value from this list.
Definition merror.h:19
#define MLISP_TYPE_TABLE(f)
Table of other types.
Definition mlisps.h:80
A pool of immutable text strings. Deduplicates strings to save memory.
Definition mdata.h:66
A vector of uniformly-sized objects, stored contiguously.
Definition mdata.h:89
Definition mlisps.h:118
size_t ast_idx_children_sz
Number of children in MLISP_AST_NODE::ast_idx_children.
Definition mlisps.h:126
Definition mlisps.h:105
Current execution state to associate with a MLISP_PARSER.
Definition mlisps.h:136
struct MDATA_VECTOR lambda_trace
Path through any lambdas the execution has entered during this heartbeat cycle. Used to detect tail c...
Definition mlisps.h:161
struct MDATA_VECTOR per_node_child_idx
The hild index that will be visited on next visit of each node.
Definition mlisps.h:147
struct MDATA_VECTOR per_node_visit_ct
The number of times each node has been visited ever.
Definition mlisps.h:140
struct MDATA_VECTOR stack
A stack of data values resulting from evaluating statements.
Definition mlisps.h:149
uint8_t flags
Flags which dictate the behavior of this object.
Definition mlisps.h:138
struct MDATA_VECTOR env
Environment in which statements are defined if ::MLISP_.
Definition mlisps.h:156
Definition mlisps.h:169
struct MDATA_VECTOR env
Definitions to use if ::MLISP_EXEC_FLAG_DEF_TERM is defined on the accompanying MLISP_EXEC_STATE::fla...
Definition mlisps.h:177
Definition mlisps.h:113
Definition mlisps.h:101