prism 2.0.0-arm64-darwin

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 (233) hide show
  1. checksums.yaml +7 -0
  2. data/BSDmakefile +58 -0
  3. data/CHANGELOG.md +881 -0
  4. data/CODE_OF_CONDUCT.md +76 -0
  5. data/CONTRIBUTING.md +58 -0
  6. data/LICENSE.md +7 -0
  7. data/Makefile +145 -0
  8. data/README.md +81 -0
  9. data/config.yml +4752 -0
  10. data/docs/build_system.md +119 -0
  11. data/docs/configuration.md +69 -0
  12. data/docs/cruby_compilation.md +27 -0
  13. data/docs/design.md +53 -0
  14. data/docs/encoding.md +121 -0
  15. data/docs/fuzzing.md +81 -0
  16. data/docs/heredocs.md +36 -0
  17. data/docs/javascript.md +133 -0
  18. data/docs/local_variable_depth.md +229 -0
  19. data/docs/mapping.md +117 -0
  20. data/docs/parser_translation.md +24 -0
  21. data/docs/parsing_rules.md +22 -0
  22. data/docs/releasing.md +147 -0
  23. data/docs/relocation.md +32 -0
  24. data/docs/ripper_translation.md +63 -0
  25. data/docs/ruby_api.md +45 -0
  26. data/docs/ruby_parser_translation.md +19 -0
  27. data/docs/serialization.md +244 -0
  28. data/docs/testing.md +72 -0
  29. data/ext/prism/api_node.c +7005 -0
  30. data/ext/prism/extconf.rb +126 -0
  31. data/ext/prism/extension.c +1768 -0
  32. data/ext/prism/extension.h +19 -0
  33. data/include/prism/arena.h +45 -0
  34. data/include/prism/arena.hpp +42 -0
  35. data/include/prism/ast.h +10381 -0
  36. data/include/prism/ast.hpp +641 -0
  37. data/include/prism/buffer.h +60 -0
  38. data/include/prism/buffer.hpp +55 -0
  39. data/include/prism/comments.h +72 -0
  40. data/include/prism/compiler/accel.h +26 -0
  41. data/include/prism/compiler/align.h +36 -0
  42. data/include/prism/compiler/assume.h +25 -0
  43. data/include/prism/compiler/branch.h +26 -0
  44. data/include/prism/compiler/bswap.h +46 -0
  45. data/include/prism/compiler/cplusplus.hpp +16 -0
  46. data/include/prism/compiler/endianness.h +34 -0
  47. data/include/prism/compiler/exceptions.hpp +17 -0
  48. data/include/prism/compiler/exported.h +24 -0
  49. data/include/prism/compiler/fallthrough.h +22 -0
  50. data/include/prism/compiler/filesystem.h +32 -0
  51. data/include/prism/compiler/flex_array.h +19 -0
  52. data/include/prism/compiler/force_inline.h +21 -0
  53. data/include/prism/compiler/format.h +27 -0
  54. data/include/prism/compiler/inline.h +17 -0
  55. data/include/prism/compiler/lifetimebound.hpp +25 -0
  56. data/include/prism/compiler/nodiscard.h +22 -0
  57. data/include/prism/compiler/nonnull.h +18 -0
  58. data/include/prism/compiler/unused.h +18 -0
  59. data/include/prism/constant_pool.h +106 -0
  60. data/include/prism/diagnostic.h +111 -0
  61. data/include/prism/errors_format.h +61 -0
  62. data/include/prism/excludes.h +29 -0
  63. data/include/prism/integer.h +41 -0
  64. data/include/prism/internal/allocator.h +68 -0
  65. data/include/prism/internal/allocator_debug.h +88 -0
  66. data/include/prism/internal/arena.h +108 -0
  67. data/include/prism/internal/bit.h +42 -0
  68. data/include/prism/internal/buffer.h +94 -0
  69. data/include/prism/internal/char.h +145 -0
  70. data/include/prism/internal/comments.h +53 -0
  71. data/include/prism/internal/constant_pool.h +152 -0
  72. data/include/prism/internal/diagnostic.h +389 -0
  73. data/include/prism/internal/encoding.h +242 -0
  74. data/include/prism/internal/integer.h +68 -0
  75. data/include/prism/internal/isinf.h +16 -0
  76. data/include/prism/internal/line_offset_list.h +34 -0
  77. data/include/prism/internal/list.h +62 -0
  78. data/include/prism/internal/magic_comments.h +23 -0
  79. data/include/prism/internal/memchr.h +15 -0
  80. data/include/prism/internal/node.h +42 -0
  81. data/include/prism/internal/options.h +232 -0
  82. data/include/prism/internal/parser.h +1004 -0
  83. data/include/prism/internal/regexp.h +26 -0
  84. data/include/prism/internal/serialize.h +39 -0
  85. data/include/prism/internal/source.h +72 -0
  86. data/include/prism/internal/static_literals.h +100 -0
  87. data/include/prism/internal/stringy.h +30 -0
  88. data/include/prism/internal/strncasecmp.h +18 -0
  89. data/include/prism/internal/strpbrk.h +33 -0
  90. data/include/prism/internal/tokens.h +11 -0
  91. data/include/prism/internal/xxh3.h +16 -0
  92. data/include/prism/json.h +40 -0
  93. data/include/prism/line_offset_list.h +69 -0
  94. data/include/prism/magic_comments.h +53 -0
  95. data/include/prism/node.h +139 -0
  96. data/include/prism/node.hpp +272 -0
  97. data/include/prism/node_type.hpp +38 -0
  98. data/include/prism/options.h +363 -0
  99. data/include/prism/options.hpp +43 -0
  100. data/include/prism/parser.h +433 -0
  101. data/include/prism/parser.hpp +274 -0
  102. data/include/prism/prettyprint.h +39 -0
  103. data/include/prism/serialize.h +123 -0
  104. data/include/prism/source.h +163 -0
  105. data/include/prism/stream.h +36 -0
  106. data/include/prism/string_query.h +82 -0
  107. data/include/prism/stringy.h +61 -0
  108. data/include/prism/stringy.hpp +31 -0
  109. data/include/prism/version.h +46 -0
  110. data/include/prism.h +123 -0
  111. data/include/prism.hpp +24 -0
  112. data/lib/prism/3.3/prism.bundle +0 -0
  113. data/lib/prism/3.4/prism.bundle +0 -0
  114. data/lib/prism/4.0/prism.bundle +0 -0
  115. data/lib/prism/compiler.rb +815 -0
  116. data/lib/prism/desugar_compiler.rb +463 -0
  117. data/lib/prism/dispatcher.rb +2383 -0
  118. data/lib/prism/dot_visitor.rb +4848 -0
  119. data/lib/prism/dsl.rb +1369 -0
  120. data/lib/prism/ffi.rb +746 -0
  121. data/lib/prism/inspect_visitor.rb +2425 -0
  122. data/lib/prism/lex_compat.rb +953 -0
  123. data/lib/prism/mutation_compiler.rb +780 -0
  124. data/lib/prism/node.rb +33940 -0
  125. data/lib/prism/node_ext.rb +504 -0
  126. data/lib/prism/node_find.rb +215 -0
  127. data/lib/prism/parse_result/errors.rb +72 -0
  128. data/lib/prism/parse_result/newlines.rb +423 -0
  129. data/lib/prism/parse_result.rb +1236 -0
  130. data/lib/prism/pattern.rb +314 -0
  131. data/lib/prism/polyfill/append_as_bytes.rb +15 -0
  132. data/lib/prism/polyfill/byteindex.rb +13 -0
  133. data/lib/prism/polyfill/scan_byte.rb +14 -0
  134. data/lib/prism/polyfill/unpack1.rb +14 -0
  135. data/lib/prism/polyfill/warn.rb +36 -0
  136. data/lib/prism/reflection.rb +427 -0
  137. data/lib/prism/relocation.rb +567 -0
  138. data/lib/prism/serialize.rb +4589 -0
  139. data/lib/prism/string_query.rb +54 -0
  140. data/lib/prism/translation/parser/builder.rb +70 -0
  141. data/lib/prism/translation/parser/compiler.rb +2226 -0
  142. data/lib/prism/translation/parser/lexer.rb +769 -0
  143. data/lib/prism/translation/parser.rb +376 -0
  144. data/lib/prism/translation/parser_current.rb +26 -0
  145. data/lib/prism/translation/parser_versions.rb +36 -0
  146. data/lib/prism/translation/ripper/filter.rb +53 -0
  147. data/lib/prism/translation/ripper/lexer.rb +133 -0
  148. data/lib/prism/translation/ripper/sexp.rb +118 -0
  149. data/lib/prism/translation/ripper/shim.rb +7 -0
  150. data/lib/prism/translation/ripper.rb +4278 -0
  151. data/lib/prism/translation/ruby_parser.rb +1721 -0
  152. data/lib/prism/translation.rb +20 -0
  153. data/lib/prism/visitor.rb +1440 -0
  154. data/lib/prism.rb +168 -0
  155. data/prism.gemspec +251 -0
  156. data/rbi/generated/prism/compiler.rbi +489 -0
  157. data/rbi/generated/prism/desugar_compiler.rbi +306 -0
  158. data/rbi/generated/prism/dispatcher.rbi +1138 -0
  159. data/rbi/generated/prism/dot_visitor.rbi +618 -0
  160. data/rbi/generated/prism/dsl.rbi +751 -0
  161. data/rbi/generated/prism/inspect_visitor.rbi +503 -0
  162. data/rbi/generated/prism/lex_compat.rbi +162 -0
  163. data/rbi/generated/prism/mutation_compiler.rbi +464 -0
  164. data/rbi/generated/prism/node.rbi +15143 -0
  165. data/rbi/generated/prism/node_ext.rbi +259 -0
  166. data/rbi/generated/prism/node_find.rbi +79 -0
  167. data/rbi/generated/prism/parse_result/errors.rbi +21 -0
  168. data/rbi/generated/prism/parse_result/newlines.rbi +208 -0
  169. data/rbi/generated/prism/parse_result.rbi +776 -0
  170. data/rbi/generated/prism/pattern.rbi +134 -0
  171. data/rbi/generated/prism/reflection.rbi +89 -0
  172. data/rbi/generated/prism/relocation.rbi +329 -0
  173. data/rbi/generated/prism/serialize.rbi +185 -0
  174. data/rbi/generated/prism/string_query.rbi +43 -0
  175. data/rbi/generated/prism/translation.rbi +7 -0
  176. data/rbi/generated/prism/visitor.rbi +650 -0
  177. data/rbi/generated/prism.rbi +86 -0
  178. data/rbi/prism/translation/parser.rbi +11 -0
  179. data/rbi/prism/translation/parser_versions.rbi +28 -0
  180. data/rbi/prism/translation/ripper.rbi +15 -0
  181. data/rbi/rubyvm/node_find.rbi +14 -0
  182. data/sig/generated/prism/compiler.rbs +492 -0
  183. data/sig/generated/prism/desugar_compiler.rbs +305 -0
  184. data/sig/generated/prism/dispatcher.rbs +1292 -0
  185. data/sig/generated/prism/dot_visitor.rbs +635 -0
  186. data/sig/generated/prism/dsl.rbs +928 -0
  187. data/sig/generated/prism/inspect_visitor.rbs +509 -0
  188. data/sig/generated/prism/lex_compat.rbs +166 -0
  189. data/sig/generated/prism/mutation_compiler.rbs +464 -0
  190. data/sig/generated/prism/node.rbs +21632 -0
  191. data/sig/generated/prism/node_ext.rbs +290 -0
  192. data/sig/generated/prism/node_find.rbs +90 -0
  193. data/sig/generated/prism/parse_result/errors.rbs +22 -0
  194. data/sig/generated/prism/parse_result/newlines.rbs +223 -0
  195. data/sig/generated/prism/parse_result.rbs +871 -0
  196. data/sig/generated/prism/pattern.rbs +156 -0
  197. data/sig/generated/prism/reflection.rbs +101 -0
  198. data/sig/generated/prism/relocation.rbs +428 -0
  199. data/sig/generated/prism/serialize.rbs +200 -0
  200. data/sig/generated/prism/string_query.rbs +43 -0
  201. data/sig/generated/prism/translation.rbs +8 -0
  202. data/sig/generated/prism/visitor.rbs +1111 -0
  203. data/sig/generated/prism.rbs +84 -0
  204. data/sig/manifest.yaml +2 -0
  205. data/src/arena.c +117 -0
  206. data/src/buffer.c +389 -0
  207. data/src/char.c +289 -0
  208. data/src/comments.c +454 -0
  209. data/src/constant_pool.c +406 -0
  210. data/src/diagnostic.c +894 -0
  211. data/src/encoding.c +5345 -0
  212. data/src/errors_format.c +519 -0
  213. data/src/integer.c +681 -0
  214. data/src/json.c +5733 -0
  215. data/src/line_offset_list.c +100 -0
  216. data/src/list.c +24 -0
  217. data/src/memchr.c +37 -0
  218. data/src/node.c +4363 -0
  219. data/src/options.c +445 -0
  220. data/src/parser.c +371 -0
  221. data/src/prettyprint.c +9024 -0
  222. data/src/prism.c +23901 -0
  223. data/src/regexp.c +1705 -0
  224. data/src/serialize.c +2660 -0
  225. data/src/source.c +524 -0
  226. data/src/static_literals.c +685 -0
  227. data/src/string_query.c +180 -0
  228. data/src/stringy.c +61 -0
  229. data/src/strncasecmp.c +37 -0
  230. data/src/strpbrk.c +447 -0
  231. data/src/tokens.c +724 -0
  232. data/src/xxh3.c +292 -0
  233. metadata +276 -0
@@ -0,0 +1,180 @@
1
+ #include "prism/string_query.h"
2
+
3
+ #include "prism/internal/char.h"
4
+ #include "prism/internal/encoding.h"
5
+ #include "prism/internal/parser.h"
6
+
7
+ #include <assert.h>
8
+ #include <string.h>
9
+
10
+ /** The category of slice returned from pm_slice_type. */
11
+ typedef enum {
12
+ /** Returned when the given encoding name is invalid. */
13
+ PM_SLICE_TYPE_ERROR = -1,
14
+
15
+ /** Returned when no other types apply to the slice. */
16
+ PM_SLICE_TYPE_NONE,
17
+
18
+ /** Returned when the slice is a valid local variable name. */
19
+ PM_SLICE_TYPE_LOCAL,
20
+
21
+ /** Returned when the slice is a valid constant name. */
22
+ PM_SLICE_TYPE_CONSTANT,
23
+
24
+ /** Returned when the slice is a valid method name. */
25
+ PM_SLICE_TYPE_METHOD_NAME
26
+ } pm_slice_type_t;
27
+
28
+ /**
29
+ * Check that the slice is a valid local variable name or constant.
30
+ */
31
+ static pm_slice_type_t
32
+ pm_slice_type(const uint8_t *source, size_t length, const char *encoding_name) {
33
+ // first, get the right encoding object
34
+ const pm_encoding_t *encoding = pm_encoding_find((const uint8_t *) encoding_name, (const uint8_t *) (encoding_name + strlen(encoding_name)));
35
+ if (encoding == NULL) return PM_SLICE_TYPE_ERROR;
36
+
37
+ // check that there is at least one character
38
+ if (length == 0) return PM_SLICE_TYPE_NONE;
39
+
40
+ size_t width;
41
+ if ((width = encoding->alpha_char(source, (ptrdiff_t) length)) != 0) {
42
+ // valid because alphabetical
43
+ } else if (*source == '_') {
44
+ // valid because underscore
45
+ width = 1;
46
+ } else if ((*source >= 0x80) && ((width = encoding->char_width(source, (ptrdiff_t) length)) > 0)) {
47
+ // valid because multibyte
48
+ } else {
49
+ // invalid because no match
50
+ return PM_SLICE_TYPE_NONE;
51
+ }
52
+
53
+ // determine the type of the slice based on the first character
54
+ const uint8_t *end = source + length;
55
+ pm_slice_type_t result = encoding->isupper_char(source, end - source) ? PM_SLICE_TYPE_CONSTANT : PM_SLICE_TYPE_LOCAL;
56
+
57
+ // next, iterate through all of the bytes of the string to ensure that they
58
+ // are all valid identifier characters
59
+ source += width;
60
+
61
+ while (source < end) {
62
+ if ((width = encoding->alnum_char(source, end - source)) != 0) {
63
+ // valid because alphanumeric
64
+ source += width;
65
+ } else if (*source == '_') {
66
+ // valid because underscore
67
+ source++;
68
+ } else if ((*source >= 0x80) && ((width = encoding->char_width(source, end - source)) > 0)) {
69
+ // valid because multibyte
70
+ source += width;
71
+ } else {
72
+ // invalid because no match
73
+ break;
74
+ }
75
+ }
76
+
77
+ // accept a ! or ? at the end of the slice as a method name
78
+ if (*source == '!' || *source == '?' || *source == '=') {
79
+ source++;
80
+ result = PM_SLICE_TYPE_METHOD_NAME;
81
+ }
82
+
83
+ // valid if we are at the end of the slice
84
+ return source == end ? result : PM_SLICE_TYPE_NONE;
85
+ }
86
+
87
+ /**
88
+ * Check that the slice is a valid local variable name.
89
+ */
90
+ pm_string_query_t
91
+ pm_string_query_local(const uint8_t *source, size_t length, const char *encoding_name) {
92
+ switch (pm_slice_type(source, length, encoding_name)) {
93
+ case PM_SLICE_TYPE_ERROR:
94
+ return PM_STRING_QUERY_ERROR;
95
+ case PM_SLICE_TYPE_NONE:
96
+ case PM_SLICE_TYPE_CONSTANT:
97
+ case PM_SLICE_TYPE_METHOD_NAME:
98
+ return PM_STRING_QUERY_FALSE;
99
+ case PM_SLICE_TYPE_LOCAL:
100
+ return PM_STRING_QUERY_TRUE;
101
+ }
102
+
103
+ assert(false && "unreachable");
104
+ return PM_STRING_QUERY_FALSE;
105
+ }
106
+
107
+ /**
108
+ * Check that the slice is a valid constant name.
109
+ */
110
+ pm_string_query_t
111
+ pm_string_query_constant(const uint8_t *source, size_t length, const char *encoding_name) {
112
+ switch (pm_slice_type(source, length, encoding_name)) {
113
+ case PM_SLICE_TYPE_ERROR:
114
+ return PM_STRING_QUERY_ERROR;
115
+ case PM_SLICE_TYPE_NONE:
116
+ case PM_SLICE_TYPE_LOCAL:
117
+ case PM_SLICE_TYPE_METHOD_NAME:
118
+ return PM_STRING_QUERY_FALSE;
119
+ case PM_SLICE_TYPE_CONSTANT:
120
+ return PM_STRING_QUERY_TRUE;
121
+ }
122
+
123
+ assert(false && "unreachable");
124
+ return PM_STRING_QUERY_FALSE;
125
+ }
126
+
127
+ /**
128
+ * Check that the slice is a valid method name.
129
+ */
130
+ pm_string_query_t
131
+ pm_string_query_method_name(const uint8_t *source, size_t length, const char *encoding_name) {
132
+ #define B(p) ((p) ? PM_STRING_QUERY_TRUE : PM_STRING_QUERY_FALSE)
133
+ #define C1(c) (*source == c)
134
+ #define C2(s) (memcmp(source, s, 2) == 0)
135
+ #define C3(s) (memcmp(source, s, 3) == 0)
136
+
137
+ switch (pm_slice_type(source, length, encoding_name)) {
138
+ case PM_SLICE_TYPE_ERROR:
139
+ return PM_STRING_QUERY_ERROR;
140
+ case PM_SLICE_TYPE_NONE:
141
+ break;
142
+ case PM_SLICE_TYPE_LOCAL:
143
+ // numbered parameters are not valid method names
144
+ return B((length != 2) || (source[0] != '_') || (source[1] == '0') || !pm_char_is_decimal_digit(source[1]));
145
+ case PM_SLICE_TYPE_CONSTANT:
146
+ // all constants are valid method names
147
+ case PM_SLICE_TYPE_METHOD_NAME:
148
+ // all method names are valid method names
149
+ return PM_STRING_QUERY_TRUE;
150
+ }
151
+
152
+ switch (length) {
153
+ case 1:
154
+ return B(C1('&') || C1('`') || C1('!') || C1('^') || C1('>') || C1('<') || C1('-') || C1('%') || C1('|') || C1('+') || C1('/') || C1('*') || C1('~'));
155
+ case 2:
156
+ return B(C2("!=") || C2("!~") || C2("[]") || C2("==") || C2("=~") || C2(">=") || C2(">>") || C2("<=") || C2("<<") || C2("**"));
157
+ case 3:
158
+ return B(C3("===") || C3("<=>") || C3("[]="));
159
+ default:
160
+ return PM_STRING_QUERY_FALSE;
161
+ }
162
+
163
+ #undef B
164
+ #undef C1
165
+ #undef C2
166
+ #undef C3
167
+ }
168
+
169
+ /**
170
+ * Check that the slice is a keyword. Keywords are spelled in ASCII, so any
171
+ * ASCII-compatible encoding spells them with the same bytes.
172
+ */
173
+ pm_string_query_t
174
+ pm_string_query_keyword(const uint8_t *source, size_t length, const char *encoding_name) {
175
+ if (pm_encoding_find((const uint8_t *) encoding_name, (const uint8_t *) (encoding_name + strlen(encoding_name))) == NULL) {
176
+ return PM_STRING_QUERY_ERROR;
177
+ }
178
+
179
+ return pm_keyword_p(source, source + length) ? PM_STRING_QUERY_TRUE : PM_STRING_QUERY_FALSE;
180
+ }
data/src/stringy.c ADDED
@@ -0,0 +1,61 @@
1
+ #include "prism/internal/stringy.h"
2
+
3
+ #include <assert.h>
4
+ #include <string.h>
5
+
6
+ /**
7
+ * Initialize a shared string that is based on initial input.
8
+ */
9
+ void
10
+ pm_string_shared_init(pm_string_t *string, const uint8_t *start, const uint8_t *end) {
11
+ assert(start <= end);
12
+
13
+ *string = (pm_string_t) {
14
+ .source = start,
15
+ .length = (size_t) (end - start)
16
+ };
17
+ }
18
+
19
+ /**
20
+ * Initialize a string that views the given bytes.
21
+ */
22
+ void
23
+ pm_string_init(pm_string_t *string, const uint8_t *source, size_t length) {
24
+ *string = (pm_string_t) { .source = source, .length = length };
25
+ }
26
+
27
+ /**
28
+ * Compare the underlying lengths and bytes of two strings. Returns 0 if the
29
+ * strings are equal, a negative number if the left string is less than the
30
+ * right string, and a positive number if the left string is greater than the
31
+ * right string.
32
+ */
33
+ int
34
+ pm_string_compare(const pm_string_t *left, const pm_string_t *right) {
35
+ size_t left_length = pm_string_length(left);
36
+ size_t right_length = pm_string_length(right);
37
+
38
+ if (left_length < right_length) {
39
+ return -1;
40
+ } else if (left_length > right_length) {
41
+ return 1;
42
+ }
43
+
44
+ return memcmp(pm_string_source(left), pm_string_source(right), left_length);
45
+ }
46
+
47
+ /**
48
+ * Returns the length associated with the string.
49
+ */
50
+ size_t
51
+ pm_string_length(const pm_string_t *string) {
52
+ return string->length;
53
+ }
54
+
55
+ /**
56
+ * Returns the start pointer associated with the string.
57
+ */
58
+ const uint8_t *
59
+ pm_string_source(const pm_string_t *string) {
60
+ return string->source;
61
+ }
data/src/strncasecmp.c ADDED
@@ -0,0 +1,37 @@
1
+ #include "prism/internal/strncasecmp.h"
2
+
3
+ #include "prism/compiler/inline.h"
4
+
5
+ /**
6
+ * A locale-insensitive version of `tolower(3)`
7
+ */
8
+ static PRISM_INLINE int
9
+ pm_tolower(int c) {
10
+ if ('A' <= c && c <= 'Z') {
11
+ return c | 0x20;
12
+ }
13
+ return c;
14
+ }
15
+
16
+ /**
17
+ * Compare two strings, ignoring case, up to the given length. Returns 0 if the
18
+ * strings are equal, a negative number if string1 is less than string2, or a
19
+ * positive number if string1 is greater than string2.
20
+ *
21
+ * Note that this is effectively our own implementation of strncasecmp, but it's
22
+ * not available on all of the platforms we want to support so we're rolling it
23
+ * here.
24
+ */
25
+ int
26
+ pm_strncasecmp(const uint8_t *string1, const uint8_t *string2, size_t length) {
27
+ size_t offset = 0;
28
+ int difference = 0;
29
+
30
+ while (offset < length && string1[offset] != '\0') {
31
+ if (string2[offset] == '\0') return string1[offset];
32
+ if ((difference = pm_tolower(string1[offset]) - pm_tolower(string2[offset])) != 0) return difference;
33
+ offset++;
34
+ }
35
+
36
+ return difference;
37
+ }