diff options
Diffstat (limited to 'src')
| -rw-r--r-- | src/array.c | 2 | ||||
| -rw-r--r-- | src/codegen.c | 35 | ||||
| -rw-r--r-- | src/object.c | 2 | ||||
| -rw-r--r-- | src/parse.y | 24 | ||||
| -rw-r--r-- | src/state.c | 2 | ||||
| -rw-r--r-- | src/vm.c | 2 |
6 files changed, 5 insertions, 62 deletions
diff --git a/src/array.c b/src/array.c index d4f5d1c5e..a358e1207 100644 --- a/src/array.c +++ b/src/array.c @@ -66,7 +66,7 @@ mrb_ary_new(mrb_state *mrb) static inline void array_copy(mrb_value *dst, const mrb_value *src, size_t size) { - int i; + size_t i; for (i = 0; i < size; i++) { dst[i] = src[i]; diff --git a/src/codegen.c b/src/codegen.c index 5c3614814..5803a9c25 100644 --- a/src/codegen.c +++ b/src/codegen.c @@ -4,7 +4,6 @@ ** See Copyright Notice in mruby.h */ -#undef CODEGEN_TEST #define CODEGEN_DUMP #include "mruby.h" @@ -2538,7 +2537,7 @@ codedump(mrb_state *mrb, int n) void codedump_all(mrb_state *mrb, int start) { - int i; + size_t i; for (i=start; i<mrb->irep_len; i++) { codedump(mrb, i); @@ -2577,35 +2576,3 @@ mrb_generate_code(mrb_state *mrb, parser_state *p) return start; } - -#ifdef CODEGEN_TEST -int -main() -{ - mrb_state *mrb = mrb_open(); - int n; - -#if 1 - n = mrb_compile_string(mrb, "p(__FILE__)\np(__LINE__)"); -#else - n = mrb_compile_string(mrb, "\ -def fib(n)\n\ - if n<2\n\ - n\n\ - else\n\ - fib(n-2)+fib(n-1)\n\ - end\n\ -end\n\ -p(fib(30), \"\\n\")\n\ -"); -#endif - printf("ret: %d\n", n); -#ifdef CODEGEN_DUMP - codedump_all(mrb, n); -#endif - mrb_run(mrb, mrb_proc_new(mrb, mrb->irep[0]), mrb_nil_value()); - mrb_close(mrb); - - return 0; -} -#endif diff --git a/src/object.c b/src/object.c index 99034e3be..f8ebd44bc 100644 --- a/src/object.c +++ b/src/object.c @@ -395,7 +395,7 @@ mrb_check_type(mrb_state *mrb, mrb_value x, enum mrb_vtype t) { const struct types *type = builtin_types; struct RString *s; - int xt; + enum mrb_vtype xt; xt = mrb_type(x); if ((xt != t) || (xt == MRB_TT_DATA)) { diff --git a/src/parse.y b/src/parse.y index 1ca3385f5..9ee9c9bec 100644 --- a/src/parse.y +++ b/src/parse.y @@ -5,7 +5,6 @@ */ %{ -#undef PARSER_TEST #undef PARSER_DEBUG #define YYDEBUG 1 @@ -5648,26 +5647,3 @@ parser_dump(mrb_state *mrb, node *tree, int offset) } #endif } - -#ifdef PARSER_TEST -int -main() -{ - mrb_state *mrb = mrb_open(); - int n; - - n = mrb_compile_string(mrb, "\ -def fib(n)\n\ - if n<2\n\ - n\n\ - else\n\ - fib(n-2)+fib(n-1)\n\ - end\n\ -end\n\ -print(fib(20), \"\\n\")\n\ -"); - printf("ret: %d\n", n); - - return 0; -} -#endif diff --git a/src/state.c b/src/state.c index e30b0cea3..53773ac89 100644 --- a/src/state.c +++ b/src/state.c @@ -85,7 +85,7 @@ void mrb_free_heap(mrb_state *mrb); void mrb_close(mrb_state *mrb) { - int i; + size_t i; mrb_final_core(mrb); @@ -58,7 +58,7 @@ The value below allows about 60000 recursive calls in the simplest case. */ static inline void stack_copy(mrb_value *dst, const mrb_value *src, size_t size) { - int i; + size_t i; for (i = 0; i < size; i++) { dst[i] = src[i]; |
