mirror of
https://github.com/ruby/ruby.git
synced 2025-08-15 13:39:04 +02:00
9b1e97b211
This patch is part of universal parser work. ## Summary - Decouple VALUE from members below: - `(struct parser_params *)->debug_lines` - `(rb_ast_t *)->body.script_lines` - Instead, they are now `rb_parser_ary_t *` - They can also be a `(VALUE)FIXNUM` as before to hold line count - `ISEQ_BODY(iseq)->variable.script_lines` remains VALUE - In order to do this, - Add `VALUE script_lines` param to `rb_iseq_new_with_opt()` - Introduce `rb_parser_build_script_lines_from()` to convert `rb_parser_ary_t *` into `VALUE` ## Other details - Extend `rb_parser_ary_t *`. It previously could only store `rb_parser_ast_token *`, now can store script_lines, too - Change tactics of building the top-level `SCRIPT_LINES__` in `yycompile0()` - Before: While parsing, each line of the script is added to `SCRIPT_LINES__[path]` - After: After `yyparse(p)`, `SCRIPT_LINES__[path]` will be built from `p->debug_lines` - Remove the second parameter of `rb_parser_set_script_lines()` to make it simple - Introduce `script_lines_free()` to be called from `rb_ast_free()` because the GC no longer takes care of the script_lines - Introduce `rb_parser_string_deep_copy()` in parse.y to maintain script_lines when `rb_ruby_parser_free()` called - With regard to this, please see *Future tasks* below ## Future tasks - Decouple IMEMO from `rb_ast_t *` - This lifts the five-members-restriction of Ruby object, - So we will be able to move the ownership of the `lex.string_buffer` from parser to AST - Then we remove `rb_parser_string_deep_copy()` to make the whole thing simple
113 lines
3.8 KiB
C
113 lines
3.8 KiB
C
#ifndef RUBY_NODE_H
|
|
#define RUBY_NODE_H 1
|
|
/**********************************************************************
|
|
|
|
node.h -
|
|
|
|
$Author$
|
|
created at: Fri May 28 15:14:02 JST 1993
|
|
|
|
Copyright (C) 1993-2007 Yukihiro Matsumoto
|
|
|
|
**********************************************************************/
|
|
|
|
#include <stdbool.h>
|
|
#include "rubyparser.h"
|
|
#include "ruby/backward/2/attributes.h"
|
|
|
|
typedef void (*bug_report_func)(const char *fmt, ...) RUBYPARSER_ATTRIBUTE_FORMAT(1, 2);
|
|
typedef struct node_buffer_elem_struct {
|
|
struct node_buffer_elem_struct *next;
|
|
long len; /* Length of nodes */
|
|
size_t allocated; /* Total memory size of allocated buf */
|
|
size_t used; /* Current usage of buf */
|
|
NODE **nodes; /* Array of node pointers */
|
|
NODE *buf[FLEX_ARY_LEN];
|
|
} node_buffer_elem_t;
|
|
|
|
typedef struct {
|
|
node_buffer_elem_t *head;
|
|
node_buffer_elem_t *last;
|
|
} node_buffer_list_t;
|
|
|
|
struct node_buffer_struct {
|
|
node_buffer_list_t buffer_list;
|
|
struct rb_ast_local_table_link *local_tables;
|
|
// - id (sequence number)
|
|
// - token_type
|
|
// - text of token
|
|
// - location info
|
|
// Array, whose entry is array
|
|
rb_parser_ary_t *tokens;
|
|
#ifdef UNIVERSAL_PARSER
|
|
const rb_parser_config_t *config;
|
|
#endif
|
|
};
|
|
|
|
RUBY_SYMBOL_EXPORT_BEGIN
|
|
|
|
#ifdef UNIVERSAL_PARSER
|
|
rb_ast_t *rb_ast_new(const rb_parser_config_t *config);
|
|
#else
|
|
rb_ast_t *rb_ast_new(void);
|
|
#endif
|
|
size_t rb_ast_memsize(const rb_ast_t*);
|
|
void rb_ast_dispose(rb_ast_t*);
|
|
const char *ruby_node_name(int node);
|
|
void rb_node_init(NODE *n, enum node_type type);
|
|
|
|
void rb_ast_update_references(rb_ast_t*);
|
|
void rb_ast_free(rb_ast_t*);
|
|
NODE *rb_ast_newnode(rb_ast_t*, enum node_type type, size_t size, size_t alignment);
|
|
void rb_ast_delete_node(rb_ast_t*, NODE *n);
|
|
rb_ast_id_table_t *rb_ast_new_local_table(rb_ast_t*, int);
|
|
rb_ast_id_table_t *rb_ast_resize_latest_local_table(rb_ast_t*, int);
|
|
|
|
VALUE rb_parser_dump_tree(const NODE *node, int comment);
|
|
|
|
const struct kwtable *rb_reserved_word(const char *, unsigned int);
|
|
|
|
struct parser_params;
|
|
PRINTF_ARGS(void rb_parser_printf(struct parser_params *parser, const char *fmt, ...), 2, 3);
|
|
VALUE rb_node_set_type(NODE *n, enum node_type t);
|
|
|
|
RUBY_SYMBOL_EXPORT_END
|
|
|
|
#define NODE_LSHIFT (NODE_TYPESHIFT+7)
|
|
#define NODE_LMASK (((SIGNED_VALUE)1<<(sizeof(VALUE)*CHAR_BIT-NODE_LSHIFT))-1)
|
|
|
|
#define nd_line(n) (int)(((SIGNED_VALUE)(n)->flags)>>NODE_LSHIFT)
|
|
#define nd_set_line(n,l) \
|
|
(n)->flags=(((n)->flags&~((VALUE)(-1)<<NODE_LSHIFT))|((VALUE)((l)&NODE_LMASK)<<NODE_LSHIFT))
|
|
|
|
|
|
#define NODE_SPECIAL_REQUIRED_KEYWORD ((NODE *)-1)
|
|
#define NODE_REQUIRED_KEYWORD_P(node) ((node) == NODE_SPECIAL_REQUIRED_KEYWORD)
|
|
#define NODE_SPECIAL_NO_NAME_REST ((NODE *)-1)
|
|
#define NODE_NAMED_REST_P(node) ((node) != NODE_SPECIAL_NO_NAME_REST)
|
|
#define NODE_SPECIAL_EXCESSIVE_COMMA ((ID)1)
|
|
#define NODE_SPECIAL_NO_REST_KEYWORD ((NODE *)-1)
|
|
|
|
#define nd_first_column(n) ((int)(RNODE(n)->nd_loc.beg_pos.column))
|
|
#define nd_set_first_column(n, v) (RNODE(n)->nd_loc.beg_pos.column = (v))
|
|
#define nd_first_lineno(n) ((int)(RNODE(n)->nd_loc.beg_pos.lineno))
|
|
#define nd_set_first_lineno(n, v) (RNODE(n)->nd_loc.beg_pos.lineno = (v))
|
|
#define nd_first_loc(n) (RNODE(n)->nd_loc.beg_pos)
|
|
#define nd_set_first_loc(n, v) (nd_first_loc(n) = (v))
|
|
|
|
#define nd_last_column(n) ((int)(RNODE(n)->nd_loc.end_pos.column))
|
|
#define nd_set_last_column(n, v) (RNODE(n)->nd_loc.end_pos.column = (v))
|
|
#define nd_last_lineno(n) ((int)(RNODE(n)->nd_loc.end_pos.lineno))
|
|
#define nd_set_last_lineno(n, v) (RNODE(n)->nd_loc.end_pos.lineno = (v))
|
|
#define nd_last_loc(n) (RNODE(n)->nd_loc.end_pos)
|
|
#define nd_set_last_loc(n, v) (nd_last_loc(n) = (v))
|
|
#define nd_node_id(n) (RNODE(n)->node_id)
|
|
#define nd_set_node_id(n,id) (RNODE(n)->node_id = (id))
|
|
|
|
static inline bool
|
|
nd_type_p(const NODE *n, enum node_type t)
|
|
{
|
|
return (enum node_type)nd_type(n) == t;
|
|
}
|
|
|
|
#endif /* RUBY_NODE_H */
|