prism 1.8.1 → 2.0.0.rc1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (241) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGELOG.md +90 -2
  3. data/Makefile +41 -12
  4. data/README.md +35 -97
  5. data/config.yml +174 -163
  6. data/docs/build_system.md +2 -2
  7. data/docs/configuration.md +5 -4
  8. data/docs/encoding.md +2 -2
  9. data/docs/fuzzing.md +4 -11
  10. data/docs/javascript.md +19 -4
  11. data/docs/mapping.md +1 -1
  12. data/docs/releasing.md +77 -5
  13. data/docs/relocation.md +2 -4
  14. data/docs/ripper_translation.md +8 -17
  15. data/docs/serialization.md +21 -24
  16. data/docs/testing.md +46 -29
  17. data/ext/prism/api_node.c +1461 -1401
  18. data/ext/prism/extconf.rb +3 -4
  19. data/ext/prism/extension.c +778 -422
  20. data/ext/prism/extension.h +3 -3
  21. data/include/prism/arena.h +37 -0
  22. data/include/prism/ast.h +2729 -612
  23. data/include/prism/buffer.h +52 -0
  24. data/include/prism/comments.h +55 -0
  25. data/include/prism/compiler/accel.h +24 -0
  26. data/include/prism/compiler/align.h +36 -0
  27. data/include/prism/compiler/assume.h +25 -0
  28. data/include/prism/compiler/exported.h +24 -0
  29. data/include/prism/compiler/fallthrough.h +22 -0
  30. data/include/prism/compiler/filesystem.h +32 -0
  31. data/include/prism/compiler/flex_array.h +19 -0
  32. data/include/prism/compiler/force_inline.h +21 -0
  33. data/include/prism/compiler/format.h +25 -0
  34. data/include/prism/compiler/inline.h +17 -0
  35. data/include/prism/compiler/nodiscard.h +22 -0
  36. data/include/prism/compiler/nonnull.h +18 -0
  37. data/include/prism/compiler/unused.h +18 -0
  38. data/include/prism/constant_pool.h +81 -0
  39. data/include/prism/diagnostic.h +38 -405
  40. data/include/prism/errors_format.h +53 -0
  41. data/include/prism/excludes.h +29 -0
  42. data/include/prism/integer.h +41 -0
  43. data/include/prism/internal/allocator.h +68 -0
  44. data/include/prism/internal/allocator_debug.h +88 -0
  45. data/include/prism/internal/arena.h +108 -0
  46. data/include/prism/internal/bit.h +42 -0
  47. data/include/prism/internal/buffer.h +91 -0
  48. data/include/prism/internal/char.h +145 -0
  49. data/include/prism/internal/comments.h +53 -0
  50. data/include/prism/internal/constant_pool.h +152 -0
  51. data/include/prism/internal/diagnostic.h +389 -0
  52. data/include/prism/{encoding.h → internal/encoding.h} +27 -68
  53. data/include/prism/internal/integer.h +68 -0
  54. data/include/prism/internal/isinf.h +16 -0
  55. data/include/prism/internal/line_offset_list.h +34 -0
  56. data/include/prism/{util/pm_list.h → internal/list.h} +11 -52
  57. data/include/prism/internal/magic_comments.h +23 -0
  58. data/include/prism/internal/memchr.h +15 -0
  59. data/include/prism/internal/node.h +38 -0
  60. data/include/prism/internal/options.h +232 -0
  61. data/include/prism/internal/parser.h +984 -0
  62. data/include/prism/internal/regexp.h +26 -0
  63. data/include/prism/internal/serialize.h +39 -0
  64. data/include/prism/internal/source.h +72 -0
  65. data/include/prism/{static_literals.h → internal/static_literals.h} +26 -47
  66. data/include/prism/internal/stringy.h +35 -0
  67. data/include/prism/{util/pm_strncasecmp.h → internal/strncasecmp.h} +3 -17
  68. data/include/prism/{util/pm_strpbrk.h → internal/strpbrk.h} +7 -20
  69. data/include/prism/internal/tokens.h +11 -0
  70. data/include/prism/json.h +32 -0
  71. data/include/prism/line_offset_list.h +61 -0
  72. data/include/prism/magic_comments.h +35 -0
  73. data/include/prism/node.h +18 -53
  74. data/include/prism/options.h +146 -280
  75. data/include/prism/parser.h +336 -868
  76. data/include/prism/prettyprint.h +6 -9
  77. data/include/prism/serialize.h +115 -0
  78. data/include/prism/source.h +155 -0
  79. data/include/prism/stream.h +28 -0
  80. data/include/prism/string_query.h +63 -0
  81. data/include/prism/stringy.h +72 -0
  82. data/include/prism/version.h +13 -4
  83. data/include/prism.h +43 -320
  84. data/lib/prism/compiler.rb +319 -305
  85. data/lib/prism/desugar_compiler.rb +105 -34
  86. data/lib/prism/dispatcher.rb +646 -473
  87. data/lib/prism/dot_visitor.rb +592 -511
  88. data/lib/prism/dsl.rb +391 -25
  89. data/lib/prism/ffi.rb +252 -90
  90. data/lib/prism/inspect_visitor.rb +357 -325
  91. data/lib/prism/lex_compat.rb +311 -228
  92. data/lib/prism/mutation_compiler.rb +313 -305
  93. data/lib/prism/node.rb +20284 -7038
  94. data/lib/prism/node_ext.rb +180 -187
  95. data/lib/prism/node_find.rb +215 -0
  96. data/lib/prism/parse_result/errors.rb +7 -1
  97. data/lib/prism/parse_result/newlines.rb +276 -8
  98. data/lib/prism/parse_result.rb +462 -139
  99. data/lib/prism/pattern.rb +65 -20
  100. data/lib/prism/reflection.rb +23 -12
  101. data/lib/prism/relocation.rb +149 -87
  102. data/lib/prism/serialize.rb +3442 -536
  103. data/lib/prism/string_query.rb +16 -1
  104. data/lib/prism/translation/parser/builder.rb +10 -2
  105. data/lib/prism/translation/parser/compiler.rb +44 -52
  106. data/lib/prism/translation/parser/lexer.rb +41 -92
  107. data/lib/prism/translation/parser.rb +1 -1
  108. data/lib/prism/translation/parser_current.rb +1 -1
  109. data/lib/prism/translation/ripper/filter.rb +53 -0
  110. data/lib/prism/translation/ripper/lexer.rb +92 -5
  111. data/lib/prism/translation/ripper/sexp.rb +2 -10
  112. data/lib/prism/translation/ripper/shim.rb +2 -0
  113. data/lib/prism/translation/ripper.rb +1005 -224
  114. data/lib/prism/translation/ruby_parser.rb +73 -316
  115. data/lib/prism/translation.rb +2 -0
  116. data/lib/prism/visitor.rb +632 -5
  117. data/lib/prism.rb +79 -22
  118. data/prism.gemspec +123 -61
  119. data/rbi/generated/prism/compiler.rbi +489 -0
  120. data/rbi/generated/prism/desugar_compiler.rbi +306 -0
  121. data/rbi/generated/prism/dispatcher.rbi +1138 -0
  122. data/rbi/generated/prism/dot_visitor.rbi +618 -0
  123. data/rbi/generated/prism/dsl.rbi +751 -0
  124. data/rbi/generated/prism/inspect_visitor.rbi +503 -0
  125. data/rbi/generated/prism/lex_compat.rbi +162 -0
  126. data/rbi/generated/prism/mutation_compiler.rbi +464 -0
  127. data/rbi/generated/prism/node.rbi +13681 -0
  128. data/rbi/generated/prism/node_ext.rbi +259 -0
  129. data/rbi/generated/prism/node_find.rbi +79 -0
  130. data/rbi/generated/prism/parse_result/errors.rbi +21 -0
  131. data/rbi/generated/prism/parse_result/newlines.rbi +208 -0
  132. data/rbi/generated/prism/parse_result.rbi +764 -0
  133. data/rbi/generated/prism/pattern.rbi +134 -0
  134. data/rbi/generated/prism/reflection.rbi +89 -0
  135. data/rbi/generated/prism/relocation.rbi +329 -0
  136. data/rbi/generated/prism/serialize.rbi +181 -0
  137. data/rbi/generated/prism/string_query.rbi +36 -0
  138. data/rbi/generated/prism/translation.rbi +7 -0
  139. data/rbi/generated/prism/visitor.rbi +650 -0
  140. data/rbi/generated/prism.rbi +86 -0
  141. data/rbi/prism/translation/parser_versions.rbi +5 -0
  142. data/rbi/rubyvm/node_find.rbi +14 -0
  143. data/sig/generated/prism/compiler.rbs +492 -0
  144. data/sig/generated/prism/desugar_compiler.rbs +305 -0
  145. data/sig/generated/prism/dispatcher.rbs +1292 -0
  146. data/sig/generated/prism/dot_visitor.rbs +635 -0
  147. data/sig/generated/prism/dsl.rbs +928 -0
  148. data/sig/generated/prism/inspect_visitor.rbs +509 -0
  149. data/sig/generated/prism/lex_compat.rbs +166 -0
  150. data/sig/{prism → generated/prism}/mutation_compiler.rbs +309 -4
  151. data/sig/generated/prism/node.rbs +20160 -0
  152. data/sig/generated/prism/node_ext.rbs +290 -0
  153. data/sig/generated/prism/node_find.rbs +90 -0
  154. data/sig/generated/prism/parse_result/errors.rbs +22 -0
  155. data/sig/generated/prism/parse_result/newlines.rbs +223 -0
  156. data/sig/generated/prism/parse_result.rbs +859 -0
  157. data/sig/generated/prism/pattern.rbs +156 -0
  158. data/sig/generated/prism/reflection.rbs +101 -0
  159. data/sig/generated/prism/relocation.rbs +428 -0
  160. data/sig/generated/prism/serialize.rbs +195 -0
  161. data/sig/generated/prism/string_query.rbs +36 -0
  162. data/sig/generated/prism/translation.rbs +8 -0
  163. data/sig/generated/prism/visitor.rbs +1111 -0
  164. data/sig/generated/prism.rbs +84 -0
  165. data/sig/manifest.yaml +2 -0
  166. data/src/arena.c +117 -0
  167. data/src/{util/pm_buffer.c → buffer.c} +44 -21
  168. data/src/{util/pm_char.c → char.c} +28 -57
  169. data/src/comments.c +454 -0
  170. data/src/constant_pool.c +406 -0
  171. data/src/diagnostic.c +93 -65
  172. data/src/encoding.c +8 -3
  173. data/src/errors_format.c +519 -0
  174. data/src/{util/pm_integer.c → integer.c} +33 -22
  175. data/src/json.c +5733 -0
  176. data/src/line_offset_list.c +100 -0
  177. data/src/list.c +24 -0
  178. data/src/{util/pm_memchr.c → memchr.c} +8 -6
  179. data/src/node.c +3504 -7674
  180. data/src/options.c +162 -49
  181. data/src/parser.c +349 -0
  182. data/src/prettyprint.c +421 -354
  183. data/src/prism.c +8035 -7019
  184. data/src/regexp.c +961 -45
  185. data/src/serialize.c +459 -424
  186. data/src/source.c +518 -0
  187. data/src/static_literals.c +111 -43
  188. data/src/string_query.c +166 -0
  189. data/src/stringy.c +91 -0
  190. data/src/{util/pm_strncasecmp.c → strncasecmp.c} +5 -4
  191. data/src/strpbrk.c +447 -0
  192. data/src/{token_type.c → tokens.c} +39 -18
  193. metadata +123 -62
  194. data/ext/prism/api_pack.c +0 -276
  195. data/include/prism/defines.h +0 -260
  196. data/include/prism/pack.h +0 -163
  197. data/include/prism/regexp.h +0 -43
  198. data/include/prism/util/pm_buffer.h +0 -236
  199. data/include/prism/util/pm_char.h +0 -204
  200. data/include/prism/util/pm_constant_pool.h +0 -218
  201. data/include/prism/util/pm_integer.h +0 -130
  202. data/include/prism/util/pm_memchr.h +0 -29
  203. data/include/prism/util/pm_newline_list.h +0 -113
  204. data/include/prism/util/pm_string.h +0 -200
  205. data/lib/prism/lex_ripper.rb +0 -64
  206. data/lib/prism/pack.rb +0 -230
  207. data/lib/prism/parse_result/comments.rb +0 -188
  208. data/rbi/prism/compiler.rbi +0 -12
  209. data/rbi/prism/dsl.rbi +0 -524
  210. data/rbi/prism/inspect_visitor.rbi +0 -12
  211. data/rbi/prism/node.rbi +0 -8747
  212. data/rbi/prism/node_ext.rbi +0 -107
  213. data/rbi/prism/parse_result.rbi +0 -404
  214. data/rbi/prism/reflection.rbi +0 -58
  215. data/rbi/prism/string_query.rbi +0 -12
  216. data/rbi/prism/visitor.rbi +0 -473
  217. data/rbi/prism.rbi +0 -66
  218. data/sig/prism/compiler.rbs +0 -9
  219. data/sig/prism/dispatcher.rbs +0 -19
  220. data/sig/prism/dot_visitor.rbs +0 -6
  221. data/sig/prism/dsl.rbs +0 -351
  222. data/sig/prism/inspect_visitor.rbs +0 -22
  223. data/sig/prism/lex_compat.rbs +0 -10
  224. data/sig/prism/node.rbs +0 -4039
  225. data/sig/prism/node_ext.rbs +0 -149
  226. data/sig/prism/pack.rbs +0 -43
  227. data/sig/prism/parse_result/comments.rbs +0 -38
  228. data/sig/prism/parse_result.rbs +0 -196
  229. data/sig/prism/pattern.rbs +0 -13
  230. data/sig/prism/reflection.rbs +0 -50
  231. data/sig/prism/relocation.rbs +0 -185
  232. data/sig/prism/serialize.rbs +0 -8
  233. data/sig/prism/string_query.rbs +0 -11
  234. data/sig/prism/visitor.rbs +0 -169
  235. data/sig/prism.rbs +0 -258
  236. data/src/pack.c +0 -509
  237. data/src/util/pm_constant_pool.c +0 -342
  238. data/src/util/pm_list.c +0 -49
  239. data/src/util/pm_newline_list.c +0 -125
  240. data/src/util/pm_string.c +0 -381
  241. data/src/util/pm_strpbrk.c +0 -206
@@ -1,200 +0,0 @@
1
- /**
2
- * @file pm_string.h
3
- *
4
- * A generic string type that can have various ownership semantics.
5
- */
6
- #ifndef PRISM_STRING_H
7
- #define PRISM_STRING_H
8
-
9
- #include "prism/defines.h"
10
-
11
- #include <assert.h>
12
- #include <errno.h>
13
- #include <stdbool.h>
14
- #include <stddef.h>
15
- #include <stdlib.h>
16
- #include <string.h>
17
-
18
- // The following headers are necessary to read files using demand paging.
19
- #ifdef _WIN32
20
- #include <windows.h>
21
- #elif defined(_POSIX_MAPPED_FILES)
22
- #include <fcntl.h>
23
- #include <sys/mman.h>
24
- #include <sys/stat.h>
25
- #elif defined(PRISM_HAS_FILESYSTEM)
26
- #include <fcntl.h>
27
- #include <sys/stat.h>
28
- #endif
29
-
30
- /**
31
- * A generic string type that can have various ownership semantics.
32
- */
33
- typedef struct {
34
- /** A pointer to the start of the string. */
35
- const uint8_t *source;
36
-
37
- /** The length of the string in bytes of memory. */
38
- size_t length;
39
-
40
- /** The type of the string. This field determines how the string should be freed. */
41
- enum {
42
- /** This string is a constant string, and should not be freed. */
43
- PM_STRING_CONSTANT,
44
-
45
- /** This is a slice of another string, and should not be freed. */
46
- PM_STRING_SHARED,
47
-
48
- /** This string owns its memory, and should be freed using `pm_string_free()`. */
49
- PM_STRING_OWNED,
50
-
51
- #ifdef PRISM_HAS_MMAP
52
- /** This string is a memory-mapped file, and should be freed using `pm_string_free()`. */
53
- PM_STRING_MAPPED
54
- #endif
55
- } type;
56
- } pm_string_t;
57
-
58
- /**
59
- * Returns the size of the pm_string_t struct. This is necessary to allocate the
60
- * correct amount of memory in the FFI backend.
61
- *
62
- * @return The size of the pm_string_t struct.
63
- */
64
- PRISM_EXPORTED_FUNCTION size_t pm_string_sizeof(void);
65
-
66
- /**
67
- * Defines an empty string. This is useful for initializing a string that will
68
- * be filled in later.
69
- */
70
- #define PM_STRING_EMPTY ((pm_string_t) { .type = PM_STRING_CONSTANT, .source = NULL, .length = 0 })
71
-
72
- /**
73
- * Initialize a shared string that is based on initial input.
74
- *
75
- * @param string The string to initialize.
76
- * @param start The start of the string.
77
- * @param end The end of the string.
78
- */
79
- void pm_string_shared_init(pm_string_t *string, const uint8_t *start, const uint8_t *end);
80
-
81
- /**
82
- * Initialize an owned string that is responsible for freeing allocated memory.
83
- *
84
- * @param string The string to initialize.
85
- * @param source The source of the string.
86
- * @param length The length of the string.
87
- */
88
- void pm_string_owned_init(pm_string_t *string, uint8_t *source, size_t length);
89
-
90
- /**
91
- * Initialize a constant string that doesn't own its memory source.
92
- *
93
- * @param string The string to initialize.
94
- * @param source The source of the string.
95
- * @param length The length of the string.
96
- */
97
- void pm_string_constant_init(pm_string_t *string, const char *source, size_t length);
98
-
99
- /**
100
- * Represents the result of calling pm_string_mapped_init or
101
- * pm_string_file_init. We need this additional information because there is
102
- * not a platform-agnostic way to indicate that the file that was attempted to
103
- * be opened was a directory.
104
- */
105
- typedef enum {
106
- /** Indicates that the string was successfully initialized. */
107
- PM_STRING_INIT_SUCCESS = 0,
108
- /**
109
- * Indicates a generic error from a string_*_init function, where the type
110
- * of error should be read from `errno` or `GetLastError()`.
111
- */
112
- PM_STRING_INIT_ERROR_GENERIC = 1,
113
- /**
114
- * Indicates that the file that was attempted to be opened was a directory.
115
- */
116
- PM_STRING_INIT_ERROR_DIRECTORY = 2
117
- } pm_string_init_result_t;
118
-
119
- /**
120
- * Read the file indicated by the filepath parameter into source and load its
121
- * contents and size into the given `pm_string_t`. The given `pm_string_t`
122
- * should be freed using `pm_string_free` when it is no longer used.
123
- *
124
- * We want to use demand paging as much as possible in order to avoid having to
125
- * read the entire file into memory (which could be detrimental to performance
126
- * for large files). This means that if we're on windows we'll use
127
- * `MapViewOfFile`, on POSIX systems that have access to `mmap` we'll use
128
- * `mmap`, and on other POSIX systems we'll use `read`.
129
- *
130
- * @param string The string to initialize.
131
- * @param filepath The filepath to read.
132
- * @return The success of the read, indicated by the value of the enum.
133
- *
134
- * \public \memberof pm_string_t
135
- */
136
- PRISM_EXPORTED_FUNCTION pm_string_init_result_t pm_string_mapped_init(pm_string_t *string, const char *filepath);
137
-
138
- /**
139
- * Read the file indicated by the filepath parameter into source and load its
140
- * contents and size into the given `pm_string_t`. The given `pm_string_t`
141
- * should be freed using `pm_string_free` when it is no longer used.
142
- *
143
- * @param string The string to initialize.
144
- * @param filepath The filepath to read.
145
- * @return The success of the read, indicated by the value of the enum.
146
- *
147
- * \public \memberof pm_string_t
148
- */
149
- PRISM_EXPORTED_FUNCTION pm_string_init_result_t pm_string_file_init(pm_string_t *string, const char *filepath);
150
-
151
- /**
152
- * Ensure the string is owned. If it is not, then reinitialize it as owned and
153
- * copy over the previous source.
154
- *
155
- * @param string The string to ensure is owned.
156
- */
157
- void pm_string_ensure_owned(pm_string_t *string);
158
-
159
- /**
160
- * Compare the underlying lengths and bytes of two strings. Returns 0 if the
161
- * strings are equal, a negative number if the left string is less than the
162
- * right string, and a positive number if the left string is greater than the
163
- * right string.
164
- *
165
- * @param left The left string to compare.
166
- * @param right The right string to compare.
167
- * @return The comparison result.
168
- */
169
- int pm_string_compare(const pm_string_t *left, const pm_string_t *right);
170
-
171
- /**
172
- * Returns the length associated with the string.
173
- *
174
- * @param string The string to get the length of.
175
- * @return The length of the string.
176
- *
177
- * \public \memberof pm_string_t
178
- */
179
- PRISM_EXPORTED_FUNCTION size_t pm_string_length(const pm_string_t *string);
180
-
181
- /**
182
- * Returns the start pointer associated with the string.
183
- *
184
- * @param string The string to get the start pointer of.
185
- * @return The start pointer of the string.
186
- *
187
- * \public \memberof pm_string_t
188
- */
189
- PRISM_EXPORTED_FUNCTION const uint8_t * pm_string_source(const pm_string_t *string);
190
-
191
- /**
192
- * Free the associated memory of the given string.
193
- *
194
- * @param string The string to free.
195
- *
196
- * \public \memberof pm_string_t
197
- */
198
- PRISM_EXPORTED_FUNCTION void pm_string_free(pm_string_t *string);
199
-
200
- #endif
@@ -1,64 +0,0 @@
1
- # frozen_string_literal: true
2
- # :markup: markdown
3
-
4
- require "ripper"
5
-
6
- module Prism
7
- # This is a class that wraps the Ripper lexer to produce almost exactly the
8
- # same tokens.
9
- class LexRipper # :nodoc:
10
- attr_reader :source
11
-
12
- def initialize(source)
13
- @source = source
14
- end
15
-
16
- def result
17
- previous = [] #: [[Integer, Integer], Symbol, String, untyped] | []
18
- results = [] #: Array[[[Integer, Integer], Symbol, String, untyped]]
19
-
20
- lex(source).each do |token|
21
- case token[1]
22
- when :on_sp
23
- # skip
24
- when :on_tstring_content
25
- if previous[1] == :on_tstring_content && (token[2].start_with?("\#$") || token[2].start_with?("\#@"))
26
- previous[2] << token[2]
27
- else
28
- results << token
29
- previous = token
30
- end
31
- when :on_words_sep
32
- if previous[1] == :on_words_sep
33
- previous[2] << token[2]
34
- else
35
- results << token
36
- previous = token
37
- end
38
- else
39
- results << token
40
- previous = token
41
- end
42
- end
43
-
44
- results
45
- end
46
-
47
- private
48
-
49
- if Ripper.method(:lex).parameters.assoc(:keyrest)
50
- def lex(source)
51
- Ripper.lex(source, raise_errors: true)
52
- end
53
- else
54
- def lex(source)
55
- ripper = Ripper::Lexer.new(source)
56
- ripper.lex.tap do |result|
57
- raise SyntaxError, ripper.errors.map(&:message).join(' ;') if ripper.errors.any?
58
- end
59
- end
60
- end
61
- end
62
-
63
- private_constant :LexRipper
64
- end
data/lib/prism/pack.rb DELETED
@@ -1,230 +0,0 @@
1
- # frozen_string_literal: true
2
- # :markup: markdown
3
- # typed: ignore
4
-
5
- #
6
- module Prism
7
- # A parser for the pack template language.
8
- module Pack
9
- %i[
10
- SPACE
11
- COMMENT
12
- INTEGER
13
- UTF8
14
- BER
15
- FLOAT
16
- STRING_SPACE_PADDED
17
- STRING_NULL_PADDED
18
- STRING_NULL_TERMINATED
19
- STRING_MSB
20
- STRING_LSB
21
- STRING_HEX_HIGH
22
- STRING_HEX_LOW
23
- STRING_UU
24
- STRING_MIME
25
- STRING_BASE64
26
- STRING_FIXED
27
- STRING_POINTER
28
- MOVE
29
- BACK
30
- NULL
31
-
32
- UNSIGNED
33
- SIGNED
34
- SIGNED_NA
35
-
36
- AGNOSTIC_ENDIAN
37
- LITTLE_ENDIAN
38
- BIG_ENDIAN
39
- NATIVE_ENDIAN
40
- ENDIAN_NA
41
-
42
- SIZE_SHORT
43
- SIZE_INT
44
- SIZE_LONG
45
- SIZE_LONG_LONG
46
- SIZE_8
47
- SIZE_16
48
- SIZE_32
49
- SIZE_64
50
- SIZE_P
51
- SIZE_NA
52
-
53
- LENGTH_FIXED
54
- LENGTH_MAX
55
- LENGTH_RELATIVE
56
- LENGTH_NA
57
- ].each do |const|
58
- const_set(const, const)
59
- end
60
-
61
- # A directive in the pack template language.
62
- class Directive
63
- # A symbol representing the version of Ruby.
64
- attr_reader :version
65
-
66
- # A symbol representing whether or not we are packing or unpacking.
67
- attr_reader :variant
68
-
69
- # A byteslice of the source string that this directive represents.
70
- attr_reader :source
71
-
72
- # The type of the directive.
73
- attr_reader :type
74
-
75
- # The type of signedness of the directive.
76
- attr_reader :signed
77
-
78
- # The type of endianness of the directive.
79
- attr_reader :endian
80
-
81
- # The size of the directive.
82
- attr_reader :size
83
-
84
- # The length type of this directive (used for integers).
85
- attr_reader :length_type
86
-
87
- # The length of this directive (used for integers).
88
- attr_reader :length
89
-
90
- # Initialize a new directive with the given values.
91
- def initialize(version, variant, source, type, signed, endian, size, length_type, length)
92
- @version = version
93
- @variant = variant
94
- @source = source
95
- @type = type
96
- @signed = signed
97
- @endian = endian
98
- @size = size
99
- @length_type = length_type
100
- @length = length
101
- end
102
-
103
- # The descriptions of the various types of endianness.
104
- ENDIAN_DESCRIPTIONS = {
105
- AGNOSTIC_ENDIAN: "agnostic",
106
- LITTLE_ENDIAN: "little-endian (VAX)",
107
- BIG_ENDIAN: "big-endian (network)",
108
- NATIVE_ENDIAN: "native-endian",
109
- ENDIAN_NA: "n/a"
110
- }
111
-
112
- # The descriptions of the various types of signedness.
113
- SIGNED_DESCRIPTIONS = {
114
- UNSIGNED: "unsigned",
115
- SIGNED: "signed",
116
- SIGNED_NA: "n/a"
117
- }
118
-
119
- # The descriptions of the various types of sizes.
120
- SIZE_DESCRIPTIONS = {
121
- SIZE_SHORT: "short",
122
- SIZE_INT: "int-width",
123
- SIZE_LONG: "long",
124
- SIZE_LONG_LONG: "long long",
125
- SIZE_8: "8-bit",
126
- SIZE_16: "16-bit",
127
- SIZE_32: "32-bit",
128
- SIZE_64: "64-bit",
129
- SIZE_P: "pointer-width"
130
- }
131
-
132
- # Provide a human-readable description of the directive.
133
- def describe
134
- case type
135
- when SPACE
136
- "whitespace"
137
- when COMMENT
138
- "comment"
139
- when INTEGER
140
- if size == SIZE_8
141
- base = "#{SIGNED_DESCRIPTIONS[signed]} #{SIZE_DESCRIPTIONS[size]} integer"
142
- else
143
- base = "#{SIGNED_DESCRIPTIONS[signed]} #{SIZE_DESCRIPTIONS[size]} #{ENDIAN_DESCRIPTIONS[endian]} integer"
144
- end
145
- case length_type
146
- when LENGTH_FIXED
147
- if length > 1
148
- base + ", x#{length}"
149
- else
150
- base
151
- end
152
- when LENGTH_MAX
153
- base + ", as many as possible"
154
- else
155
- raise
156
- end
157
- when UTF8
158
- "UTF-8 character"
159
- when BER
160
- "BER-compressed integer"
161
- when FLOAT
162
- "#{SIZE_DESCRIPTIONS[size]} #{ENDIAN_DESCRIPTIONS[endian]} float"
163
- when STRING_SPACE_PADDED
164
- "arbitrary binary string (space padded)"
165
- when STRING_NULL_PADDED
166
- "arbitrary binary string (null padded, count is width)"
167
- when STRING_NULL_TERMINATED
168
- "arbitrary binary string (null padded, count is width), except that null is added with *"
169
- when STRING_MSB
170
- "bit string (MSB first)"
171
- when STRING_LSB
172
- "bit string (LSB first)"
173
- when STRING_HEX_HIGH
174
- "hex string (high nibble first)"
175
- when STRING_HEX_LOW
176
- "hex string (low nibble first)"
177
- when STRING_UU
178
- "UU-encoded string"
179
- when STRING_MIME
180
- "quoted printable, MIME encoding"
181
- when STRING_BASE64
182
- "base64 encoded string"
183
- when STRING_FIXED
184
- "pointer to a structure (fixed-length string)"
185
- when STRING_POINTER
186
- "pointer to a null-terminated string"
187
- when MOVE
188
- "move to absolute position"
189
- when BACK
190
- "back up a byte"
191
- when NULL
192
- "null byte"
193
- else
194
- raise
195
- end
196
- end
197
- end
198
-
199
- # The result of parsing a pack template.
200
- class Format
201
- # A list of the directives in the template.
202
- attr_reader :directives
203
-
204
- # The encoding of the template.
205
- attr_reader :encoding
206
-
207
- # Create a new Format with the given directives and encoding.
208
- def initialize(directives, encoding)
209
- @directives = directives
210
- @encoding = encoding
211
- end
212
-
213
- # Provide a human-readable description of the format.
214
- def describe
215
- source_width = directives.map { |d| d.source.inspect.length }.max
216
- directive_lines = directives.map do |directive|
217
- if directive.type == SPACE
218
- source = directive.source.inspect
219
- else
220
- source = directive.source
221
- end
222
- # @type var source_width: Integer
223
- " #{source.ljust(source_width)} #{directive.describe}"
224
- end
225
-
226
- (["Directives:"] + directive_lines + ["Encoding:", " #{encoding}"]).join("\n")
227
- end
228
- end
229
- end
230
- end
@@ -1,188 +0,0 @@
1
- # frozen_string_literal: true
2
- # :markup: markdown
3
-
4
- module Prism
5
- class ParseResult < Result
6
- # When we've parsed the source, we have both the syntax tree and the list of
7
- # comments that we found in the source. This class is responsible for
8
- # walking the tree and finding the nearest location to attach each comment.
9
- #
10
- # It does this by first finding the nearest locations to each comment.
11
- # Locations can either come from nodes directly or from location fields on
12
- # nodes. For example, a `ClassNode` has an overall location encompassing the
13
- # entire class, but it also has a location for the `class` keyword.
14
- #
15
- # Once the nearest locations are found, it determines which one to attach
16
- # to. If it's a trailing comment (a comment on the same line as other source
17
- # code), it will favor attaching to the nearest location that occurs before
18
- # the comment. Otherwise it will favor attaching to the nearest location
19
- # that is after the comment.
20
- class Comments
21
- # A target for attaching comments that is based on a specific node's
22
- # location.
23
- class NodeTarget # :nodoc:
24
- attr_reader :node
25
-
26
- def initialize(node)
27
- @node = node
28
- end
29
-
30
- def start_offset
31
- node.start_offset
32
- end
33
-
34
- def end_offset
35
- node.end_offset
36
- end
37
-
38
- def encloses?(comment)
39
- start_offset <= comment.location.start_offset &&
40
- comment.location.end_offset <= end_offset
41
- end
42
-
43
- def leading_comment(comment)
44
- node.location.leading_comment(comment)
45
- end
46
-
47
- def trailing_comment(comment)
48
- node.location.trailing_comment(comment)
49
- end
50
- end
51
-
52
- # A target for attaching comments that is based on a location field on a
53
- # node. For example, the `end` token of a ClassNode.
54
- class LocationTarget # :nodoc:
55
- attr_reader :location
56
-
57
- def initialize(location)
58
- @location = location
59
- end
60
-
61
- def start_offset
62
- location.start_offset
63
- end
64
-
65
- def end_offset
66
- location.end_offset
67
- end
68
-
69
- def encloses?(comment)
70
- false
71
- end
72
-
73
- def leading_comment(comment)
74
- location.leading_comment(comment)
75
- end
76
-
77
- def trailing_comment(comment)
78
- location.trailing_comment(comment)
79
- end
80
- end
81
-
82
- # The parse result that we are attaching comments to.
83
- attr_reader :parse_result
84
-
85
- # Create a new Comments object that will attach comments to the given
86
- # parse result.
87
- def initialize(parse_result)
88
- @parse_result = parse_result
89
- end
90
-
91
- # Attach the comments to their respective locations in the tree by
92
- # mutating the parse result.
93
- def attach!
94
- parse_result.comments.each do |comment|
95
- preceding, enclosing, following = nearest_targets(parse_result.value, comment)
96
-
97
- if comment.trailing?
98
- if preceding
99
- preceding.trailing_comment(comment)
100
- else
101
- (following || enclosing || NodeTarget.new(parse_result.value)).leading_comment(comment)
102
- end
103
- else
104
- # If a comment exists on its own line, prefer a leading comment.
105
- if following
106
- following.leading_comment(comment)
107
- elsif preceding
108
- preceding.trailing_comment(comment)
109
- else
110
- (enclosing || NodeTarget.new(parse_result.value)).leading_comment(comment)
111
- end
112
- end
113
- end
114
- end
115
-
116
- private
117
-
118
- # Responsible for finding the nearest targets to the given comment within
119
- # the context of the given encapsulating node.
120
- def nearest_targets(node, comment)
121
- comment_start = comment.location.start_offset
122
- comment_end = comment.location.end_offset
123
-
124
- targets = [] #: Array[_Target]
125
- node.comment_targets.map do |value|
126
- case value
127
- when StatementsNode
128
- targets.concat(value.body.map { |node| NodeTarget.new(node) })
129
- when Node
130
- targets << NodeTarget.new(value)
131
- when Location
132
- targets << LocationTarget.new(value)
133
- end
134
- end
135
-
136
- targets.sort_by!(&:start_offset)
137
- preceding = nil #: _Target?
138
- following = nil #: _Target?
139
-
140
- left = 0
141
- right = targets.length
142
-
143
- # This is a custom binary search that finds the nearest nodes to the
144
- # given comment. When it finds a node that completely encapsulates the
145
- # comment, it recurses downward into the tree.
146
- while left < right
147
- middle = (left + right) / 2
148
- target = targets[middle]
149
-
150
- target_start = target.start_offset
151
- target_end = target.end_offset
152
-
153
- if target.encloses?(comment)
154
- # @type var target: NodeTarget
155
- # The comment is completely contained by this target. Abandon the
156
- # binary search at this level.
157
- return nearest_targets(target.node, comment)
158
- end
159
-
160
- if target_end <= comment_start
161
- # This target falls completely before the comment. Because we will
162
- # never consider this target or any targets before it again, this
163
- # target must be the closest preceding target we have encountered so
164
- # far.
165
- preceding = target
166
- left = middle + 1
167
- next
168
- end
169
-
170
- if comment_end <= target_start
171
- # This target falls completely after the comment. Because we will
172
- # never consider this target or any targets after it again, this
173
- # target must be the closest following target we have encountered so
174
- # far.
175
- following = target
176
- right = middle
177
- next
178
- end
179
-
180
- # This should only happen if there is a bug in this parser.
181
- raise "Comment location overlaps with a target location"
182
- end
183
-
184
- [preceding, NodeTarget.new(node), following]
185
- end
186
- end
187
- end
188
- end
@@ -1,12 +0,0 @@
1
- # typed: strict
2
-
3
- class Prism::Compiler
4
- sig { params(node: T.nilable(Prism::Node)).returns(T.untyped) }
5
- def visit(node); end
6
-
7
- sig { params(nodes: T::Array[T.nilable(Prism::Node)]).returns(T::Array[T.untyped]) }
8
- def visit_all(nodes); end
9
-
10
- sig { params(node: Prism::Node).returns(T::Array[T.untyped]) }
11
- def visit_child_nodes(node); end
12
- end