[270] | 1 | /*
|
---|
| 2 | ** mrbtest - Test for Embeddable Ruby
|
---|
| 3 | **
|
---|
| 4 | ** This program runs Ruby test programs in test/t directory
|
---|
| 5 | ** against the current mruby implementation.
|
---|
| 6 | */
|
---|
| 7 |
|
---|
| 8 |
|
---|
| 9 | #include <stdio.h>
|
---|
| 10 | #include <stdlib.h>
|
---|
| 11 | #include <string.h>
|
---|
| 12 |
|
---|
[331] | 13 | #include <mruby.h>
|
---|
| 14 | #include <mruby/proc.h>
|
---|
| 15 | #include <mruby/data.h>
|
---|
| 16 | #include <mruby/compile.h>
|
---|
| 17 | #include <mruby/string.h>
|
---|
| 18 | #include <mruby/variable.h>
|
---|
| 19 | #include <mruby/array.h>
|
---|
[270] | 20 |
|
---|
[439] | 21 | extern const uint8_t mrbtest_assert_irep[];
|
---|
[270] | 22 |
|
---|
[439] | 23 | void mrbgemtest_init(mrb_state* mrb);
|
---|
| 24 | void mrb_init_test_vformat(mrb_state* mrb);
|
---|
| 25 |
|
---|
[270] | 26 | /* Print a short remark for the user */
|
---|
| 27 | static void
|
---|
| 28 | print_hint(void)
|
---|
| 29 | {
|
---|
| 30 | printf("mrbtest - Embeddable Ruby Test\n\n");
|
---|
| 31 | }
|
---|
| 32 |
|
---|
| 33 | static int
|
---|
| 34 | eval_test(mrb_state *mrb)
|
---|
| 35 | {
|
---|
| 36 | /* evaluate the test */
|
---|
[439] | 37 | mrb_value result = mrb_funcall(mrb, mrb_top_self(mrb), "report", 0);
|
---|
[270] | 38 | /* did an exception occur? */
|
---|
| 39 | if (mrb->exc) {
|
---|
| 40 | mrb_print_error(mrb);
|
---|
| 41 | mrb->exc = 0;
|
---|
| 42 | return EXIT_FAILURE;
|
---|
| 43 | }
|
---|
[439] | 44 | else {
|
---|
| 45 | return mrb_bool(result) ? EXIT_SUCCESS : EXIT_FAILURE;
|
---|
[270] | 46 | }
|
---|
| 47 | }
|
---|
| 48 |
|
---|
[439] | 49 | /* Implementation of print due to the reason that there might be no print */
|
---|
| 50 | static mrb_value
|
---|
| 51 | t_print(mrb_state *mrb, mrb_value self)
|
---|
[270] | 52 | {
|
---|
[439] | 53 | mrb_value *argv;
|
---|
| 54 | mrb_int argc;
|
---|
| 55 | mrb_int i;
|
---|
[270] | 56 |
|
---|
[439] | 57 | mrb_get_args(mrb, "*!", &argv, &argc);
|
---|
| 58 | for (i = 0; i < argc; ++i) {
|
---|
| 59 | mrb_value s = mrb_obj_as_string(mrb, argv[i]);
|
---|
| 60 | fwrite(RSTRING_PTR(s), RSTRING_LEN(s), 1, stdout);
|
---|
[270] | 61 | }
|
---|
[439] | 62 | fflush(stdout);
|
---|
| 63 |
|
---|
| 64 | return mrb_nil_value();
|
---|
[270] | 65 | }
|
---|
| 66 |
|
---|
[439] | 67 | #define UNESCAPE(p, endp) ((p) != (endp) && *(p) == '\\' ? (p)+1 : (p))
|
---|
| 68 | #define CHAR_CMP(c1, c2) ((unsigned char)(c1) - (unsigned char)(c2))
|
---|
| 69 |
|
---|
| 70 | static const char *
|
---|
| 71 | str_match_bracket(const char *p, const char *pat_end,
|
---|
| 72 | const char *s, const char *str_end)
|
---|
[270] | 73 | {
|
---|
[439] | 74 | mrb_bool ok = FALSE, negated = FALSE;
|
---|
[270] | 75 |
|
---|
[439] | 76 | if (p == pat_end) return NULL;
|
---|
| 77 | if (*p == '!' || *p == '^') {
|
---|
| 78 | negated = TRUE;
|
---|
| 79 | ++p;
|
---|
| 80 | }
|
---|
[270] | 81 |
|
---|
[439] | 82 | while (*p != ']') {
|
---|
| 83 | const char *t1 = p;
|
---|
| 84 | if ((t1 = UNESCAPE(t1, pat_end)) == pat_end) return NULL;
|
---|
| 85 | if ((p = t1 + 1) == pat_end) return NULL;
|
---|
| 86 | if (p[0] == '-' && p[1] != ']') {
|
---|
| 87 | const char *t2 = p + 1;
|
---|
| 88 | if ((t2 = UNESCAPE(t2, pat_end)) == pat_end) return NULL;
|
---|
| 89 | p = t2 + 1;
|
---|
| 90 | if (!ok && CHAR_CMP(*t1, *s) <= 0 && CHAR_CMP(*s, *t2) <= 0) ok = TRUE;
|
---|
| 91 | }
|
---|
| 92 | else {
|
---|
| 93 | if (!ok && CHAR_CMP(*t1, *s) == 0) ok = TRUE;
|
---|
| 94 | }
|
---|
| 95 | }
|
---|
| 96 |
|
---|
| 97 | return ok == negated ? NULL : p + 1;
|
---|
[270] | 98 | }
|
---|
| 99 |
|
---|
[439] | 100 | static mrb_bool
|
---|
| 101 | str_match_no_brace_p(const char *pat, mrb_int pat_len,
|
---|
| 102 | const char *str, mrb_int str_len)
|
---|
| 103 | {
|
---|
| 104 | const char *p = pat, *s = str;
|
---|
| 105 | const char *pat_end = pat + pat_len, *str_end = str + str_len;
|
---|
| 106 | const char *p_tmp = NULL, *s_tmp = NULL;
|
---|
| 107 |
|
---|
| 108 | for (;;) {
|
---|
| 109 | if (p == pat_end) return s == str_end;
|
---|
| 110 | switch (*p) {
|
---|
| 111 | case '*':
|
---|
| 112 | do { ++p; } while (p != pat_end && *p == '*');
|
---|
| 113 | if (UNESCAPE(p, pat_end) == pat_end) return TRUE;
|
---|
| 114 | if (s == str_end) return FALSE;
|
---|
| 115 | p_tmp = p;
|
---|
| 116 | s_tmp = s;
|
---|
| 117 | continue;
|
---|
| 118 | case '?':
|
---|
| 119 | if (s == str_end) return FALSE;
|
---|
| 120 | ++p;
|
---|
| 121 | ++s;
|
---|
| 122 | continue;
|
---|
| 123 | case '[': {
|
---|
| 124 | const char *t;
|
---|
| 125 | if (s == str_end) return FALSE;
|
---|
| 126 | if ((t = str_match_bracket(p+1, pat_end, s, str_end))) {
|
---|
| 127 | p = t;
|
---|
| 128 | ++s;
|
---|
| 129 | continue;
|
---|
| 130 | }
|
---|
| 131 | goto L_failed;
|
---|
| 132 | }
|
---|
| 133 | }
|
---|
| 134 |
|
---|
| 135 | /* ordinary */
|
---|
| 136 | p = UNESCAPE(p, pat_end);
|
---|
| 137 | if (s == str_end) return p == pat_end;
|
---|
| 138 | if (p == pat_end) goto L_failed;
|
---|
| 139 | if (*p++ != *s++) goto L_failed;
|
---|
| 140 | continue;
|
---|
| 141 |
|
---|
| 142 | L_failed:
|
---|
| 143 | if (p_tmp && s_tmp) {
|
---|
| 144 | /* try next '*' position */
|
---|
| 145 | p = p_tmp;
|
---|
| 146 | s = ++s_tmp;
|
---|
| 147 | continue;
|
---|
| 148 | }
|
---|
| 149 |
|
---|
| 150 | return FALSE;
|
---|
| 151 | }
|
---|
| 152 | }
|
---|
| 153 |
|
---|
| 154 | #define COPY_AND_INC(dst, src, len) \
|
---|
| 155 | do { memcpy(dst, src, len); dst += len; } while (0)
|
---|
| 156 |
|
---|
| 157 | static mrb_bool
|
---|
| 158 | str_match_p(mrb_state *mrb,
|
---|
| 159 | const char *pat, mrb_int pat_len,
|
---|
| 160 | const char *str, mrb_int str_len)
|
---|
| 161 | {
|
---|
| 162 | const char *p = pat, *pat_end = pat + pat_len;
|
---|
| 163 | const char *lbrace = NULL, *rbrace = NULL;
|
---|
| 164 | int nest = 0;
|
---|
| 165 | mrb_bool ret = FALSE;
|
---|
| 166 |
|
---|
| 167 | for (; p != pat_end; ++p) {
|
---|
| 168 | if (*p == '{' && nest++ == 0) lbrace = p;
|
---|
| 169 | else if (*p == '}' && lbrace && --nest == 0) { rbrace = p; break; }
|
---|
| 170 | else if (*p == '\\' && ++p == pat_end) break;
|
---|
| 171 | }
|
---|
| 172 |
|
---|
| 173 | if (lbrace && rbrace) {
|
---|
| 174 | /* expand brace */
|
---|
| 175 | char *ex_pat = (char *)mrb_malloc(mrb, pat_len-2); /* expanded pattern */
|
---|
| 176 | char *ex_p = ex_pat;
|
---|
| 177 |
|
---|
| 178 | COPY_AND_INC(ex_p, pat, lbrace-pat);
|
---|
| 179 | p = lbrace;
|
---|
| 180 | while (p < rbrace) {
|
---|
| 181 | char *orig_ex_p = ex_p;
|
---|
| 182 | const char *t = ++p;
|
---|
| 183 | for (nest = 0; p < rbrace && !(*p == ',' && nest == 0); ++p) {
|
---|
| 184 | if (*p == '{') ++nest;
|
---|
| 185 | else if (*p == '}') --nest;
|
---|
| 186 | else if (*p == '\\' && ++p == rbrace) break;
|
---|
| 187 | }
|
---|
| 188 | COPY_AND_INC(ex_p, t, p-t);
|
---|
| 189 | COPY_AND_INC(ex_p, rbrace+1, pat_end-rbrace-1);
|
---|
| 190 | if ((ret = str_match_p(mrb, ex_pat, ex_p-ex_pat, str, str_len))) break;
|
---|
| 191 | ex_p = orig_ex_p;
|
---|
| 192 | }
|
---|
| 193 | mrb_free(mrb, ex_pat);
|
---|
| 194 | }
|
---|
| 195 | else if (!lbrace && !rbrace) {
|
---|
| 196 | ret = str_match_no_brace_p(pat, pat_len, str, str_len);
|
---|
| 197 | }
|
---|
| 198 |
|
---|
| 199 | return ret;
|
---|
| 200 | }
|
---|
| 201 |
|
---|
| 202 | static mrb_value
|
---|
| 203 | m_str_match_p(mrb_state *mrb, mrb_value self)
|
---|
| 204 | {
|
---|
| 205 | const char *pat, *str;
|
---|
| 206 | mrb_int pat_len, str_len;
|
---|
| 207 |
|
---|
| 208 | mrb_get_args(mrb, "ss", &pat, &pat_len, &str, &str_len);
|
---|
| 209 | return mrb_bool_value(str_match_p(mrb, pat, pat_len, str, str_len));
|
---|
| 210 | }
|
---|
| 211 |
|
---|
[270] | 212 | void
|
---|
| 213 | mrb_init_test_driver(mrb_state *mrb, mrb_bool verbose)
|
---|
| 214 | {
|
---|
| 215 | struct RClass *krn, *mrbtest;
|
---|
| 216 |
|
---|
| 217 | krn = mrb->kernel_module;
|
---|
[439] | 218 | mrb_define_method(mrb, krn, "t_print", t_print, MRB_ARGS_ANY());
|
---|
| 219 | mrb_define_method(mrb, krn, "_str_match?", m_str_match_p, MRB_ARGS_REQ(2));
|
---|
[270] | 220 |
|
---|
| 221 | mrbtest = mrb_define_module(mrb, "Mrbtest");
|
---|
| 222 |
|
---|
| 223 | mrb_define_const(mrb, mrbtest, "FIXNUM_MAX", mrb_fixnum_value(MRB_INT_MAX));
|
---|
| 224 | mrb_define_const(mrb, mrbtest, "FIXNUM_MIN", mrb_fixnum_value(MRB_INT_MIN));
|
---|
| 225 | mrb_define_const(mrb, mrbtest, "FIXNUM_BIT", mrb_fixnum_value(MRB_INT_BIT));
|
---|
| 226 |
|
---|
[439] | 227 | #ifndef MRB_WITHOUT_FLOAT
|
---|
[331] | 228 | #ifdef MRB_USE_FLOAT
|
---|
| 229 | mrb_define_const(mrb, mrbtest, "FLOAT_TOLERANCE", mrb_float_value(mrb, 1e-6));
|
---|
| 230 | #else
|
---|
| 231 | mrb_define_const(mrb, mrbtest, "FLOAT_TOLERANCE", mrb_float_value(mrb, 1e-12));
|
---|
| 232 | #endif
|
---|
[439] | 233 | #endif
|
---|
[331] | 234 |
|
---|
[439] | 235 | mrb_init_test_vformat(mrb);
|
---|
| 236 |
|
---|
[270] | 237 | if (verbose) {
|
---|
| 238 | mrb_gv_set(mrb, mrb_intern_lit(mrb, "$mrbtest_verbose"), mrb_true_value());
|
---|
| 239 | }
|
---|
| 240 | }
|
---|
| 241 |
|
---|
| 242 | void
|
---|
| 243 | mrb_t_pass_result(mrb_state *mrb_dst, mrb_state *mrb_src)
|
---|
| 244 | {
|
---|
| 245 | mrb_value res_src;
|
---|
| 246 |
|
---|
| 247 | if (mrb_src->exc) {
|
---|
| 248 | mrb_print_error(mrb_src);
|
---|
| 249 | exit(EXIT_FAILURE);
|
---|
| 250 | }
|
---|
| 251 |
|
---|
| 252 | #define TEST_COUNT_PASS(name) \
|
---|
| 253 | do { \
|
---|
| 254 | res_src = mrb_gv_get(mrb_src, mrb_intern_lit(mrb_src, "$" #name)); \
|
---|
| 255 | if (mrb_fixnum_p(res_src)) { \
|
---|
| 256 | mrb_value res_dst = mrb_gv_get(mrb_dst, mrb_intern_lit(mrb_dst, "$" #name)); \
|
---|
| 257 | mrb_gv_set(mrb_dst, mrb_intern_lit(mrb_dst, "$" #name), mrb_fixnum_value(mrb_fixnum(res_dst) + mrb_fixnum(res_src))); \
|
---|
| 258 | } \
|
---|
| 259 | } while (FALSE) \
|
---|
| 260 |
|
---|
| 261 | TEST_COUNT_PASS(ok_test);
|
---|
| 262 | TEST_COUNT_PASS(ko_test);
|
---|
| 263 | TEST_COUNT_PASS(kill_test);
|
---|
[439] | 264 | TEST_COUNT_PASS(warning_test);
|
---|
| 265 | TEST_COUNT_PASS(skip_test);
|
---|
[270] | 266 |
|
---|
| 267 | #undef TEST_COUNT_PASS
|
---|
| 268 |
|
---|
| 269 | res_src = mrb_gv_get(mrb_src, mrb_intern_lit(mrb_src, "$asserts"));
|
---|
| 270 |
|
---|
| 271 | if (mrb_array_p(res_src)) {
|
---|
| 272 | mrb_int i;
|
---|
| 273 | mrb_value res_dst = mrb_gv_get(mrb_dst, mrb_intern_lit(mrb_dst, "$asserts"));
|
---|
| 274 | for (i = 0; i < RARRAY_LEN(res_src); ++i) {
|
---|
| 275 | mrb_value val_src = RARRAY_PTR(res_src)[i];
|
---|
| 276 | mrb_ary_push(mrb_dst, res_dst, mrb_str_new(mrb_dst, RSTRING_PTR(val_src), RSTRING_LEN(val_src)));
|
---|
| 277 | }
|
---|
| 278 | }
|
---|
| 279 | }
|
---|
| 280 |
|
---|
| 281 | int
|
---|
| 282 | main(int argc, char **argv)
|
---|
| 283 | {
|
---|
| 284 | mrb_state *mrb;
|
---|
| 285 | int ret;
|
---|
| 286 | mrb_bool verbose = FALSE;
|
---|
| 287 |
|
---|
| 288 | print_hint();
|
---|
| 289 |
|
---|
| 290 | /* new interpreter instance */
|
---|
| 291 | mrb = mrb_open();
|
---|
| 292 | if (mrb == NULL) {
|
---|
| 293 | fprintf(stderr, "Invalid mrb_state, exiting test driver");
|
---|
| 294 | return EXIT_FAILURE;
|
---|
| 295 | }
|
---|
| 296 |
|
---|
| 297 | if (argc == 2 && argv[1][0] == '-' && argv[1][1] == 'v') {
|
---|
| 298 | printf("verbose mode: enable\n\n");
|
---|
| 299 | verbose = TRUE;
|
---|
| 300 | }
|
---|
| 301 |
|
---|
| 302 | mrb_init_test_driver(mrb, verbose);
|
---|
[439] | 303 | mrb_load_irep(mrb, mrbtest_assert_irep);
|
---|
| 304 | mrbgemtest_init(mrb);
|
---|
[270] | 305 | ret = eval_test(mrb);
|
---|
| 306 | mrb_close(mrb);
|
---|
| 307 |
|
---|
| 308 | return ret;
|
---|
| 309 | }
|
---|