15#include "rubyparser.h"
16#include "ruby/backward/2/attributes.h"
18typedef void (*bug_report_func)(
const char *fmt, ...);
26 NODE *buf[FLEX_ARY_LEN];
30 node_buffer_elem_t *head;
31 node_buffer_elem_t *last;
45#ifdef UNIVERSAL_PARSER
46 rb_parser_config_t *config;
50RUBY_SYMBOL_EXPORT_BEGIN
52#ifdef UNIVERSAL_PARSER
53rb_ast_t *rb_ast_new(rb_parser_config_t *config);
55rb_ast_t *rb_ast_new(
void);
57size_t rb_ast_memsize(
const rb_ast_t*);
58void rb_ast_dispose(rb_ast_t*);
59VALUE rb_ast_tokens(rb_ast_t *ast);
61void rb_ast_node_type_change(NODE *n,
enum node_type
type);
63const char *ruby_node_name(
int node);
64void rb_node_init(NODE *n,
enum node_type
type);
66void rb_ast_mark(rb_ast_t*);
67void rb_ast_update_references(rb_ast_t*);
68void rb_ast_free(rb_ast_t*);
69void rb_ast_add_mark_object(rb_ast_t*,
VALUE);
70void rb_ast_delete_mark_object(rb_ast_t*,
VALUE);
71void rb_ast_set_tokens(rb_ast_t*,
VALUE);
72NODE *rb_ast_newnode(rb_ast_t*,
enum node_type
type,
size_t size,
size_t alignment);
73void rb_ast_delete_node(rb_ast_t*, NODE *n);
74rb_ast_id_table_t *rb_ast_new_local_table(rb_ast_t*,
int);
75rb_ast_id_table_t *rb_ast_resize_latest_local_table(rb_ast_t*,
int);
77VALUE rb_parser_dump_tree(
const NODE *node,
int comment);
79const struct kwtable *rb_reserved_word(
const char *,
unsigned int);
83void *rb_parser_realloc(
struct parser_params *,
void *,
size_t);
84void *rb_parser_calloc(
struct parser_params *,
size_t,
size_t);
86PRINTF_ARGS(
void rb_parser_printf(
struct parser_params *parser,
const char *fmt, ...), 2, 3);
87VALUE rb_node_set_type(NODE *n,
enum node_type t);
91#define NODE_LSHIFT (NODE_TYPESHIFT+7)
92#define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1)
94#define nd_line(n) (int)(((SIGNED_VALUE)(n)->flags)>>NODE_LSHIFT)
95#define nd_set_line(n,l) \
96 (n)->flags=(((n)->flags&~((VALUE)(-1)<<NODE_LSHIFT))|((VALUE)((l)&NODE_LMASK)<<NODE_LSHIFT))
99#define NODE_SPECIAL_REQUIRED_KEYWORD ((NODE *)-1)
100#define NODE_REQUIRED_KEYWORD_P(node) ((node) == NODE_SPECIAL_REQUIRED_KEYWORD)
101#define NODE_SPECIAL_NO_NAME_REST ((NODE *)-1)
102#define NODE_NAMED_REST_P(node) ((node) != NODE_SPECIAL_NO_NAME_REST)
103#define NODE_SPECIAL_EXCESSIVE_COMMA ((ID)1)
104#define NODE_SPECIAL_NO_REST_KEYWORD ((NODE *)-1)
106#define nd_first_column(n) ((int)(RNODE(n)->nd_loc.beg_pos.column))
107#define nd_set_first_column(n, v) (RNODE(n)->nd_loc.beg_pos.column = (v))
108#define nd_first_lineno(n) ((int)(RNODE(n)->nd_loc.beg_pos.lineno))
109#define nd_set_first_lineno(n, v) (RNODE(n)->nd_loc.beg_pos.lineno = (v))
110#define nd_first_loc(n) (RNODE(n)->nd_loc.beg_pos)
111#define nd_set_first_loc(n, v) (nd_first_loc(n) = (v))
113#define nd_last_column(n) ((int)(RNODE(n)->nd_loc.end_pos.column))
114#define nd_set_last_column(n, v) (RNODE(n)->nd_loc.end_pos.column = (v))
115#define nd_last_lineno(n) ((int)(RNODE(n)->nd_loc.end_pos.lineno))
116#define nd_set_last_lineno(n, v) (RNODE(n)->nd_loc.end_pos.lineno = (v))
117#define nd_last_loc(n) (RNODE(n)->nd_loc.end_pos)
118#define nd_set_last_loc(n, v) (nd_last_loc(n) = (v))
119#define nd_node_id(n) (RNODE(n)->node_id)
120#define nd_set_node_id(n,id) (RNODE(n)->node_id = (id))
123nd_type_p(
const NODE *n,
enum node_type t)
125 return (
enum node_type)nd_type(n) == t;
VALUE type(ANYARGS)
ANYARGS-ed function type.
uintptr_t VALUE
Type that represents a Ruby object.