… | |
… | |
65 | #define S_T (&SCHEME_V->xT) //TODO: magic ptr value? |
65 | #define S_T (&SCHEME_V->xT) //TODO: magic ptr value? |
66 | #define S_F (&SCHEME_V->xF) //TODO: magic ptr value? |
66 | #define S_F (&SCHEME_V->xF) //TODO: magic ptr value? |
67 | #define S_SINK (&SCHEME_V->xsink) |
67 | #define S_SINK (&SCHEME_V->xsink) |
68 | #define S_EOF (&SCHEME_V->xEOF_OBJ) |
68 | #define S_EOF (&SCHEME_V->xEOF_OBJ) |
69 | |
69 | |
|
|
70 | /* should use libecb */ |
|
|
71 | #if __GNUC__ >= 4 |
|
|
72 | # define ecb_expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
73 | # define ecb_expect_false(expr) ecb_expect (!!(expr), 0) |
|
|
74 | # define ecb_expect_true(expr) ecb_expect (!!(expr), 1) |
|
|
75 | #endif |
|
|
76 | |
70 | #if !USE_MULTIPLICITY |
77 | #if !USE_MULTIPLICITY |
71 | static scheme sc; |
78 | static scheme sc; |
72 | #endif |
79 | #endif |
73 | |
80 | |
74 | static void |
81 | static void |
… | |
… | |
201 | #define T_SYNTAX 0x0010 |
208 | #define T_SYNTAX 0x0010 |
202 | #define T_IMMUTABLE 0x0020 |
209 | #define T_IMMUTABLE 0x0020 |
203 | #define T_ATOM 0x0040 /* only for gc */ |
210 | #define T_ATOM 0x0040 /* only for gc */ |
204 | #define T_MARK 0x0080 /* only for gc */ |
211 | #define T_MARK 0x0080 /* only for gc */ |
205 | |
212 | |
206 | static num num_add (num a, num b); |
213 | enum num_op { NUM_ADD, NUM_SUB, NUM_MUL, NUM_INTDIV }; |
207 | static num num_mul (num a, num b); |
214 | |
208 | static num num_div (num a, num b); |
215 | static num num_op (enum num_op op, num a, num b); |
209 | static num num_intdiv (num a, num b); |
216 | static num num_intdiv (num a, num b); |
210 | static num num_sub (num a, num b); |
|
|
211 | static num num_rem (num a, num b); |
217 | static num num_rem (num a, num b); |
212 | static num num_mod (num a, num b); |
218 | static num num_mod (num a, num b); |
213 | static int num_eq (num a, num b); |
|
|
214 | static int num_gt (num a, num b); |
|
|
215 | static int num_ge (num a, num b); |
|
|
216 | static int num_lt (num a, num b); |
|
|
217 | static int num_le (num a, num b); |
|
|
218 | |
219 | |
219 | #if USE_MATH |
220 | #if USE_MATH |
220 | static double round_per_R5RS (double x); |
221 | static double round_per_R5RS (double x); |
221 | #endif |
222 | #endif |
222 | static int is_zero_rvalue (RVALUE x); |
223 | static int is_zero_rvalue (RVALUE x); |
… | |
… | |
369 | { |
370 | { |
370 | return type (p) == T_PAIR; |
371 | return type (p) == T_PAIR; |
371 | } |
372 | } |
372 | |
373 | |
373 | #define car(p) ((p)->object.cons.car + 0) |
374 | #define car(p) ((p)->object.cons.car + 0) |
374 | #define cdr(p) ((p)->object.cons.cdr) /* find_consecutive_cells uses &cdr */ |
375 | #define cdr(p) ((p)->object.cons.cdr + 0) |
375 | |
376 | |
376 | #define caar(p) car (car (p)) |
377 | static pointer caar (pointer p) { return car (car (p)); } |
377 | #define cadr(p) car (cdr (p)) |
378 | static pointer cadr (pointer p) { return car (cdr (p)); } |
378 | #define cdar(p) cdr (car (p)) |
379 | static pointer cdar (pointer p) { return cdr (car (p)); } |
379 | #define cddr(p) cdr (cdr (p)) |
380 | static pointer cddr (pointer p) { return cdr (cdr (p)); } |
380 | |
381 | |
381 | #define cadar(p) car (cdr (car (p))) |
382 | static pointer cadar (pointer p) { return car (cdr (car (p))); } |
382 | #define caddr(p) car (cdr (cdr (p))) |
383 | static pointer caddr (pointer p) { return car (cdr (cdr (p))); } |
383 | #define cdaar(p) cdr (car (car (p))) |
384 | static pointer cdaar (pointer p) { return cdr (car (car (p))); } |
384 | |
385 | |
385 | INTERFACE void |
386 | INTERFACE void |
386 | set_car (pointer p, pointer q) |
387 | set_car (pointer p, pointer q) |
387 | { |
388 | { |
388 | p->object.cons.car = q; |
389 | p->object.cons.car = q; |
… | |
… | |
664 | static pointer ss_get_cont (SCHEME_P); |
665 | static pointer ss_get_cont (SCHEME_P); |
665 | static void ss_set_cont (SCHEME_P_ pointer cont); |
666 | static void ss_set_cont (SCHEME_P_ pointer cont); |
666 | static void dump_stack_mark (SCHEME_P); |
667 | static void dump_stack_mark (SCHEME_P); |
667 | static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); |
668 | static pointer opexe_0 (SCHEME_P_ enum scheme_opcodes op); |
668 | static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); |
669 | static pointer opexe_2 (SCHEME_P_ enum scheme_opcodes op); |
|
|
670 | static pointer opexe_r (SCHEME_P_ enum scheme_opcodes op); |
669 | static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); |
671 | static pointer opexe_3 (SCHEME_P_ enum scheme_opcodes op); |
670 | static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); |
672 | static pointer opexe_4 (SCHEME_P_ enum scheme_opcodes op); |
671 | static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); |
673 | static pointer opexe_5 (SCHEME_P_ enum scheme_opcodes op); |
672 | static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); |
674 | static pointer opexe_6 (SCHEME_P_ enum scheme_opcodes op); |
673 | static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); |
675 | static void Eval_Cycle (SCHEME_P_ enum scheme_opcodes op); |
674 | static void assign_syntax (SCHEME_P_ const char *name); |
676 | static void assign_syntax (SCHEME_P_ const char *name); |
675 | static int syntaxnum (pointer p); |
677 | static int syntaxnum (pointer p); |
676 | static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); |
678 | static void assign_proc (SCHEME_P_ enum scheme_opcodes, const char *name); |
677 | |
679 | |
678 | static num |
680 | static num |
679 | num_add (num a, num b) |
681 | num_op (enum num_op op, num a, num b) |
680 | { |
682 | { |
681 | num ret; |
683 | num ret; |
682 | |
684 | |
683 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
685 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
684 | |
686 | |
685 | if (num_is_fixnum (ret)) |
687 | if (num_is_fixnum (ret)) |
686 | num_set_ivalue (ret, num_get_ivalue (a) + num_get_ivalue (b)); |
688 | { |
|
|
689 | IVALUE av = num_get_ivalue (a); |
|
|
690 | IVALUE bv = num_get_ivalue (b); |
|
|
691 | |
|
|
692 | switch (op) |
|
|
693 | { |
|
|
694 | case NUM_ADD: av += bv; break; |
|
|
695 | case NUM_SUB: av -= bv; break; |
|
|
696 | case NUM_MUL: av *= bv; break; |
|
|
697 | case NUM_INTDIV: av /= bv; break; |
|
|
698 | } |
|
|
699 | |
|
|
700 | num_set_ivalue (ret, av); |
|
|
701 | } |
687 | else |
702 | else |
688 | num_set_rvalue (ret, num_get_rvalue (a) + num_get_rvalue (b)); |
703 | { |
|
|
704 | RVALUE av = num_get_rvalue (a); |
|
|
705 | RVALUE bv = num_get_rvalue (b); |
689 | |
706 | |
690 | return ret; |
707 | switch (op) |
691 | } |
708 | { |
|
|
709 | case NUM_ADD: av += bv; break; |
|
|
710 | case NUM_SUB: av -= bv; break; |
|
|
711 | case NUM_MUL: av *= bv; break; |
|
|
712 | case NUM_INTDIV: av /= bv; break; |
|
|
713 | } |
692 | |
714 | |
693 | static num |
715 | num_set_rvalue (ret, av); |
694 | num_mul (num a, num b) |
716 | } |
695 | { |
|
|
696 | num ret; |
|
|
697 | |
|
|
698 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
|
|
699 | |
|
|
700 | if (num_is_fixnum (ret)) |
|
|
701 | num_set_ivalue (ret, num_get_ivalue (a) * num_get_ivalue (b)); |
|
|
702 | else |
|
|
703 | num_set_rvalue (ret, num_get_rvalue (a) * num_get_rvalue (b)); |
|
|
704 | |
717 | |
705 | return ret; |
718 | return ret; |
706 | } |
719 | } |
707 | |
720 | |
708 | static num |
721 | static num |
… | |
… | |
719 | |
732 | |
720 | return ret; |
733 | return ret; |
721 | } |
734 | } |
722 | |
735 | |
723 | static num |
736 | static num |
724 | num_intdiv (num a, num b) |
|
|
725 | { |
|
|
726 | num ret; |
|
|
727 | |
|
|
728 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
|
|
729 | |
|
|
730 | if (num_is_fixnum (ret)) |
|
|
731 | num_set_ivalue (ret, num_get_ivalue (a) / num_get_ivalue (b)); |
|
|
732 | else |
|
|
733 | num_set_rvalue (ret, num_get_rvalue (a) / num_get_rvalue (b)); |
|
|
734 | |
|
|
735 | return ret; |
|
|
736 | } |
|
|
737 | |
|
|
738 | static num |
|
|
739 | num_sub (num a, num b) |
|
|
740 | { |
|
|
741 | num ret; |
|
|
742 | |
|
|
743 | num_set_fixnum (ret, num_is_fixnum (a) && num_is_fixnum (b)); |
|
|
744 | |
|
|
745 | if (num_is_fixnum (ret)) |
|
|
746 | num_set_ivalue (ret, num_get_ivalue (a) - num_get_ivalue (b)); |
|
|
747 | else |
|
|
748 | num_set_rvalue (ret, num_get_rvalue (a) - num_get_rvalue (b)); |
|
|
749 | |
|
|
750 | return ret; |
|
|
751 | } |
|
|
752 | |
|
|
753 | static num |
|
|
754 | num_rem (num a, num b) |
737 | num_rem (num a, num b) |
755 | { |
738 | { |
756 | num ret; |
739 | num ret; |
757 | long e1, e2, res; |
740 | long e1, e2, res; |
758 | |
741 | |
… | |
… | |
794 | |
777 | |
795 | num_set_ivalue (ret, res); |
778 | num_set_ivalue (ret, res); |
796 | return ret; |
779 | return ret; |
797 | } |
780 | } |
798 | |
781 | |
|
|
782 | /* this completely disrespects NaNs */ |
799 | static int |
783 | static int |
800 | num_eq (num a, num b) |
784 | num_cmp (num a, num b) |
801 | { |
785 | { |
|
|
786 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
802 | int ret; |
787 | int ret; |
803 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
|
|
804 | |
788 | |
805 | if (is_fixnum) |
789 | if (is_fixnum) |
806 | ret = num_get_ivalue (a) == num_get_ivalue (b); |
790 | { |
|
|
791 | IVALUE av = num_get_ivalue (a); |
|
|
792 | IVALUE bv = num_get_ivalue (b); |
|
|
793 | |
|
|
794 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
|
|
795 | } |
807 | else |
796 | else |
808 | ret = num_get_rvalue (a) == num_get_rvalue (b); |
797 | { |
|
|
798 | RVALUE av = num_get_rvalue (a); |
|
|
799 | RVALUE bv = num_get_rvalue (b); |
|
|
800 | |
|
|
801 | ret = av == bv ? 0 : av < bv ? -1 : +1; |
|
|
802 | } |
809 | |
803 | |
810 | return ret; |
804 | return ret; |
811 | } |
|
|
812 | |
|
|
813 | |
|
|
814 | static int |
|
|
815 | num_gt (num a, num b) |
|
|
816 | { |
|
|
817 | int ret; |
|
|
818 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
|
|
819 | |
|
|
820 | if (is_fixnum) |
|
|
821 | ret = num_get_ivalue (a) > num_get_ivalue (b); |
|
|
822 | else |
|
|
823 | ret = num_get_rvalue (a) > num_get_rvalue (b); |
|
|
824 | |
|
|
825 | return ret; |
|
|
826 | } |
|
|
827 | |
|
|
828 | static int |
|
|
829 | num_ge (num a, num b) |
|
|
830 | { |
|
|
831 | return !num_lt (a, b); |
|
|
832 | } |
|
|
833 | |
|
|
834 | static int |
|
|
835 | num_lt (num a, num b) |
|
|
836 | { |
|
|
837 | int ret; |
|
|
838 | int is_fixnum = num_is_fixnum (a) && num_is_fixnum (b); |
|
|
839 | |
|
|
840 | if (is_fixnum) |
|
|
841 | ret = num_get_ivalue (a) < num_get_ivalue (b); |
|
|
842 | else |
|
|
843 | ret = num_get_rvalue (a) < num_get_rvalue (b); |
|
|
844 | |
|
|
845 | return ret; |
|
|
846 | } |
|
|
847 | |
|
|
848 | static int |
|
|
849 | num_le (num a, num b) |
|
|
850 | { |
|
|
851 | return !num_gt (a, b); |
|
|
852 | } |
805 | } |
853 | |
806 | |
854 | #if USE_MATH |
807 | #if USE_MATH |
855 | |
808 | |
856 | /* Round to nearest. Round to even if midway */ |
809 | /* Round to nearest. Round to even if midway */ |
… | |
… | |
965 | |
918 | |
966 | /* get new cell. parameter a, b is marked by gc. */ |
919 | /* get new cell. parameter a, b is marked by gc. */ |
967 | static INLINE pointer |
920 | static INLINE pointer |
968 | get_cell_x (SCHEME_P_ pointer a, pointer b) |
921 | get_cell_x (SCHEME_P_ pointer a, pointer b) |
969 | { |
922 | { |
970 | if (SCHEME_V->free_cell == NIL) |
923 | if (ecb_expect_false (SCHEME_V->free_cell == NIL)) |
971 | { |
924 | { |
972 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
925 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
973 | return S_SINK; |
926 | return S_SINK; |
974 | |
927 | |
975 | if (SCHEME_V->free_cell == NIL) |
928 | if (SCHEME_V->free_cell == NIL) |
… | |
… | |
1481 | |
1434 | |
1482 | /* make constant */ |
1435 | /* make constant */ |
1483 | static pointer |
1436 | static pointer |
1484 | mk_sharp_const (SCHEME_P_ char *name) |
1437 | mk_sharp_const (SCHEME_P_ char *name) |
1485 | { |
1438 | { |
1486 | long x; |
|
|
1487 | char tmp[STRBUFFSIZE]; |
|
|
1488 | |
|
|
1489 | if (!strcmp (name, "t")) |
1439 | if (!strcmp (name, "t")) |
1490 | return S_T; |
1440 | return S_T; |
1491 | else if (!strcmp (name, "f")) |
1441 | else if (!strcmp (name, "f")) |
1492 | return S_F; |
1442 | return S_F; |
1493 | else if (*name == '\\') /* #\w (character) */ |
1443 | else if (*name == '\\') /* #\w (character) */ |
1494 | { |
1444 | { |
1495 | int c = 0; |
1445 | int c; |
1496 | |
1446 | |
1497 | if (stricmp (name + 1, "space") == 0) |
1447 | if (stricmp (name + 1, "space") == 0) |
1498 | c = ' '; |
1448 | c = ' '; |
1499 | else if (stricmp (name + 1, "newline") == 0) |
1449 | else if (stricmp (name + 1, "newline") == 0) |
1500 | c = '\n'; |
1450 | c = '\n'; |
… | |
… | |
1502 | c = '\r'; |
1452 | c = '\r'; |
1503 | else if (stricmp (name + 1, "tab") == 0) |
1453 | else if (stricmp (name + 1, "tab") == 0) |
1504 | c = '\t'; |
1454 | c = '\t'; |
1505 | else if (name[1] == 'x' && name[2] != 0) |
1455 | else if (name[1] == 'x' && name[2] != 0) |
1506 | { |
1456 | { |
1507 | int c1 = strtol (name + 2, 0, 16); |
1457 | long c1 = strtol (name + 2, 0, 16); |
1508 | |
1458 | |
1509 | if (c1 <= UCHAR_MAX) |
1459 | if (0 <= c1 && c1 <= UCHAR_MAX) |
1510 | c = c1; |
1460 | c = c1; |
1511 | else |
1461 | else |
1512 | return NIL; |
1462 | return NIL; |
1513 | |
1463 | } |
1514 | #if USE_ASCII_NAMES |
1464 | #if USE_ASCII_NAMES |
1515 | } |
|
|
1516 | else if (is_ascii_name (name + 1, &c)) |
1465 | else if (is_ascii_name (name + 1, &c)) |
1517 | { |
|
|
1518 | /* nothing */ |
1466 | /* nothing */; |
1519 | #endif |
1467 | #endif |
1520 | } |
|
|
1521 | else if (name[2] == 0) |
1468 | else if (name[2] == 0) |
1522 | c = name[1]; |
1469 | c = name[1]; |
1523 | else |
1470 | else |
1524 | return NIL; |
1471 | return NIL; |
1525 | |
1472 | |
… | |
… | |
1542 | |
1489 | |
1543 | /*-- |
1490 | /*-- |
1544 | * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, |
1491 | * We use algorithm E (Knuth, The Art of Computer Programming Vol.1, |
1545 | * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, |
1492 | * sec. 2.3.5), the Schorr-Deutsch-Waite link-inversion algorithm, |
1546 | * for marking. |
1493 | * for marking. |
|
|
1494 | * |
|
|
1495 | * The exception is vectors - vectors are currently marked recursively, |
|
|
1496 | * which is inherited form tinyscheme and could be fixed by having another |
|
|
1497 | * word of context in the vector |
1547 | */ |
1498 | */ |
1548 | static void |
1499 | static void |
1549 | mark (pointer a) |
1500 | mark (pointer a) |
1550 | { |
1501 | { |
1551 | pointer t, q, p; |
1502 | pointer t, q, p; |
… | |
… | |
1553 | t = 0; |
1504 | t = 0; |
1554 | p = a; |
1505 | p = a; |
1555 | E2: |
1506 | E2: |
1556 | setmark (p); |
1507 | setmark (p); |
1557 | |
1508 | |
1558 | if (is_vector (p)) |
1509 | if (ecb_expect_false (is_vector (p))) |
1559 | { |
1510 | { |
1560 | int i; |
1511 | int i; |
1561 | |
1512 | |
1562 | for (i = 0; i < p->object.vector.length; i++) |
1513 | for (i = 0; i < p->object.vector.length; i++) |
1563 | mark (vecvalue (p)[i]); |
1514 | mark (vecvalue (p)[i]); |
… | |
… | |
1686 | } |
1637 | } |
1687 | |
1638 | |
1688 | static void |
1639 | static void |
1689 | finalize_cell (SCHEME_P_ pointer a) |
1640 | finalize_cell (SCHEME_P_ pointer a) |
1690 | { |
1641 | { |
|
|
1642 | /* TODO, fast bitmap check? */ |
1691 | if (is_string (a)) |
1643 | if (is_string (a)) |
1692 | free (strvalue (a)); |
1644 | free (strvalue (a)); |
1693 | else if (is_vector (a)) |
1645 | else if (is_vector (a)) |
1694 | free (vecvalue (a)); |
1646 | free (vecvalue (a)); |
1695 | #if USE_PORTS |
1647 | #if USE_PORTS |
… | |
… | |
2790 | } |
2742 | } |
2791 | else if (is_number (a)) |
2743 | else if (is_number (a)) |
2792 | { |
2744 | { |
2793 | if (is_number (b)) |
2745 | if (is_number (b)) |
2794 | if (num_is_integer (a) == num_is_integer (b)) |
2746 | if (num_is_integer (a) == num_is_integer (b)) |
2795 | return num_eq (nvalue (a), nvalue (b)); |
2747 | return num_cmp (nvalue (a), nvalue (b)) == 0; |
2796 | |
2748 | |
2797 | return 0; |
2749 | return 0; |
2798 | } |
2750 | } |
2799 | else if (is_character (a)) |
2751 | else if (is_character (a)) |
2800 | { |
2752 | { |
… | |
… | |
3962 | SCHEME_V->code = car (SCHEME_V->args); |
3914 | SCHEME_V->code = car (SCHEME_V->args); |
3963 | SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); |
3915 | SCHEME_V->args = cons (mk_continuation (SCHEME_A_ ss_get_cont (SCHEME_A)), NIL); |
3964 | s_goto (OP_APPLY); |
3916 | s_goto (OP_APPLY); |
3965 | } |
3917 | } |
3966 | |
3918 | |
3967 | return S_T; |
3919 | abort (); |
3968 | } |
3920 | } |
3969 | |
3921 | |
3970 | static pointer |
3922 | static pointer |
3971 | opexe_2 (SCHEME_P_ enum scheme_opcodes op) |
3923 | opexe_2 (SCHEME_P_ enum scheme_opcodes op) |
3972 | { |
3924 | { |
… | |
… | |
4101 | |
4053 | |
4102 | case OP_ADD: /* + */ |
4054 | case OP_ADD: /* + */ |
4103 | v = num_zero; |
4055 | v = num_zero; |
4104 | |
4056 | |
4105 | for (x = SCHEME_V->args; x != NIL; x = cdr (x)) |
4057 | for (x = SCHEME_V->args; x != NIL; x = cdr (x)) |
4106 | v = num_add (v, nvalue (car (x))); |
4058 | v = num_op ('+', v, nvalue (car (x))); |
4107 | |
4059 | |
4108 | s_return (mk_number (SCHEME_A_ v)); |
4060 | s_return (mk_number (SCHEME_A_ v)); |
4109 | |
4061 | |
4110 | case OP_MUL: /* * */ |
4062 | case OP_MUL: /* * */ |
4111 | v = num_one; |
4063 | v = num_one; |
4112 | |
4064 | |
4113 | for (x = SCHEME_V->args; x != NIL; x = cdr (x)) |
4065 | for (x = SCHEME_V->args; x != NIL; x = cdr (x)) |
4114 | v = num_mul (v, nvalue (car (x))); |
4066 | v = num_op ('+', v, nvalue (car (x))); |
4115 | |
4067 | |
4116 | s_return (mk_number (SCHEME_A_ v)); |
4068 | s_return (mk_number (SCHEME_A_ v)); |
4117 | |
4069 | |
4118 | case OP_SUB: /* - */ |
4070 | case OP_SUB: /* - */ |
4119 | if (cdr (SCHEME_V->args) == NIL) |
4071 | if (cdr (SCHEME_V->args) == NIL) |
… | |
… | |
4126 | x = cdr (SCHEME_V->args); |
4078 | x = cdr (SCHEME_V->args); |
4127 | v = nvalue (car (SCHEME_V->args)); |
4079 | v = nvalue (car (SCHEME_V->args)); |
4128 | } |
4080 | } |
4129 | |
4081 | |
4130 | for (; x != NIL; x = cdr (x)) |
4082 | for (; x != NIL; x = cdr (x)) |
4131 | v = num_sub (v, nvalue (car (x))); |
4083 | v = num_op ('+', v, nvalue (car (x))); |
4132 | |
4084 | |
4133 | s_return (mk_number (SCHEME_A_ v)); |
4085 | s_return (mk_number (SCHEME_A_ v)); |
4134 | |
4086 | |
4135 | case OP_DIV: /* / */ |
4087 | case OP_DIV: /* / */ |
4136 | if (cdr (SCHEME_V->args) == NIL) |
4088 | if (cdr (SCHEME_V->args) == NIL) |
… | |
… | |
4167 | } |
4119 | } |
4168 | |
4120 | |
4169 | for (; x != NIL; x = cdr (x)) |
4121 | for (; x != NIL; x = cdr (x)) |
4170 | { |
4122 | { |
4171 | if (ivalue (car (x)) != 0) |
4123 | if (ivalue (car (x)) != 0) |
4172 | v = num_intdiv (v, nvalue (car (x))); |
4124 | v = num_op ('/', v, nvalue (car (x))); |
4173 | else |
4125 | else |
4174 | Error_0 ("quotient: division by zero"); |
4126 | Error_0 ("quotient: division by zero"); |
4175 | } |
4127 | } |
4176 | |
4128 | |
4177 | s_return (mk_number (SCHEME_A_ v)); |
4129 | s_return (mk_number (SCHEME_A_ v)); |
… | |
… | |
4565 | } |
4517 | } |
4566 | } |
4518 | } |
4567 | } |
4519 | } |
4568 | |
4520 | |
4569 | static pointer |
4521 | static pointer |
|
|
4522 | opexe_r (SCHEME_P_ enum scheme_opcodes op) |
|
|
4523 | { |
|
|
4524 | pointer x = SCHEME_V->args; |
|
|
4525 | |
|
|
4526 | for (;;) |
|
|
4527 | { |
|
|
4528 | num v = nvalue (car (x)); |
|
|
4529 | x = cdr (x); |
|
|
4530 | |
|
|
4531 | if (x == NIL) |
|
|
4532 | break; |
|
|
4533 | |
|
|
4534 | int r = num_cmp (v, nvalue (car (x))); |
|
|
4535 | |
|
|
4536 | switch (op) |
|
|
4537 | { |
|
|
4538 | case OP_NUMEQ: r = r == 0; break; |
|
|
4539 | case OP_LESS: r = r < 0; break; |
|
|
4540 | case OP_GRE: r = r > 0; break; |
|
|
4541 | case OP_LEQ: r = r <= 0; break; |
|
|
4542 | case OP_GEQ: r = r >= 0; break; |
|
|
4543 | } |
|
|
4544 | |
|
|
4545 | if (!r) |
|
|
4546 | s_return (S_F); |
|
|
4547 | } |
|
|
4548 | |
|
|
4549 | s_return (S_T); |
|
|
4550 | } |
|
|
4551 | |
|
|
4552 | static pointer |
4570 | opexe_3 (SCHEME_P_ enum scheme_opcodes op) |
4553 | opexe_3 (SCHEME_P_ enum scheme_opcodes op) |
4571 | { |
4554 | { |
4572 | pointer x; |
4555 | pointer x = SCHEME_V->args; |
4573 | num v; |
4556 | pointer a = car (x); |
4574 | int (*comp_func) (num, num); |
4557 | pointer d = cdr (x); |
|
|
4558 | int r; |
4575 | |
4559 | |
4576 | switch (op) |
4560 | switch (op) |
4577 | { |
4561 | { |
4578 | case OP_NOT: /* not */ |
4562 | case OP_NOT: /* not */ r = is_false (a) ; break; |
4579 | s_retbool (is_false (car (SCHEME_V->args))); |
4563 | case OP_BOOLP: /* boolean? */ r = a == S_F || a == S_T; break; |
|
|
4564 | case OP_EOFOBJP: /* eof-object? */ r = a == S_EOF ; break; |
|
|
4565 | case OP_NULLP: /* null? */ r = a == NIL ; break; |
|
|
4566 | case OP_SYMBOLP: /* symbol? */ r = is_symbol (a) ; break; |
|
|
4567 | case OP_NUMBERP: /* number? */ r = is_number (a) ; break; |
|
|
4568 | case OP_STRINGP: /* string? */ r = is_string (a) ; break; |
|
|
4569 | case OP_INTEGERP: /* integer? */ r = is_integer (a) ; break; |
|
|
4570 | case OP_REALP: /* real? */ r = is_number (a) ; break; /* all numbers are real */ |
|
|
4571 | case OP_CHARP: /* char? */ r = is_character (a) ; break; |
4580 | |
4572 | |
4581 | case OP_BOOLP: /* boolean? */ |
|
|
4582 | s_retbool (car (SCHEME_V->args) == S_F || car (SCHEME_V->args) == S_T); |
|
|
4583 | |
|
|
4584 | case OP_EOFOBJP: /* boolean? */ |
|
|
4585 | s_retbool (car (SCHEME_V->args) == S_EOF); |
|
|
4586 | |
|
|
4587 | case OP_NULLP: /* null? */ |
|
|
4588 | s_retbool (car (SCHEME_V->args) == NIL); |
|
|
4589 | |
|
|
4590 | case OP_NUMEQ: /* = */ |
|
|
4591 | case OP_LESS: /* < */ |
|
|
4592 | case OP_GRE: /* > */ |
|
|
4593 | case OP_LEQ: /* <= */ |
|
|
4594 | case OP_GEQ: /* >= */ |
|
|
4595 | switch (op) |
|
|
4596 | { |
|
|
4597 | case OP_NUMEQ: |
|
|
4598 | comp_func = num_eq; |
|
|
4599 | break; |
|
|
4600 | |
|
|
4601 | case OP_LESS: |
|
|
4602 | comp_func = num_lt; |
|
|
4603 | break; |
|
|
4604 | |
|
|
4605 | case OP_GRE: |
|
|
4606 | comp_func = num_gt; |
|
|
4607 | break; |
|
|
4608 | |
|
|
4609 | case OP_LEQ: |
|
|
4610 | comp_func = num_le; |
|
|
4611 | break; |
|
|
4612 | |
|
|
4613 | case OP_GEQ: |
|
|
4614 | comp_func = num_ge; |
|
|
4615 | break; |
|
|
4616 | } |
|
|
4617 | |
|
|
4618 | x = SCHEME_V->args; |
|
|
4619 | v = nvalue (car (x)); |
|
|
4620 | x = cdr (x); |
|
|
4621 | |
|
|
4622 | for (; x != NIL; x = cdr (x)) |
|
|
4623 | { |
|
|
4624 | if (!comp_func (v, nvalue (car (x)))) |
|
|
4625 | s_retbool (0); |
|
|
4626 | |
|
|
4627 | v = nvalue (car (x)); |
|
|
4628 | } |
|
|
4629 | |
|
|
4630 | s_retbool (1); |
|
|
4631 | |
|
|
4632 | case OP_SYMBOLP: /* symbol? */ |
|
|
4633 | s_retbool (is_symbol (car (SCHEME_V->args))); |
|
|
4634 | |
|
|
4635 | case OP_NUMBERP: /* number? */ |
|
|
4636 | s_retbool (is_number (car (SCHEME_V->args))); |
|
|
4637 | |
|
|
4638 | case OP_STRINGP: /* string? */ |
|
|
4639 | s_retbool (is_string (car (SCHEME_V->args))); |
|
|
4640 | |
|
|
4641 | case OP_INTEGERP: /* integer? */ |
|
|
4642 | s_retbool (is_integer (car (SCHEME_V->args))); |
|
|
4643 | |
|
|
4644 | case OP_REALP: /* real? */ |
|
|
4645 | s_retbool (is_number (car (SCHEME_V->args))); /* All numbers are real */ |
|
|
4646 | |
|
|
4647 | case OP_CHARP: /* char? */ |
|
|
4648 | s_retbool (is_character (car (SCHEME_V->args))); |
|
|
4649 | #if USE_CHAR_CLASSIFIERS |
4573 | #if USE_CHAR_CLASSIFIERS |
4650 | |
|
|
4651 | case OP_CHARAP: /* char-alphabetic? */ |
4574 | case OP_CHARAP: /* char-alphabetic? */ r = Cisalpha (ivalue (a)); break; |
4652 | s_retbool (Cisalpha (ivalue (car (SCHEME_V->args)))); |
4575 | case OP_CHARNP: /* char-numeric? */ r = Cisdigit (ivalue (a)); break; |
4653 | |
|
|
4654 | case OP_CHARNP: /* char-numeric? */ |
|
|
4655 | s_retbool (Cisdigit (ivalue (car (SCHEME_V->args)))); |
|
|
4656 | |
|
|
4657 | case OP_CHARWP: /* char-whitespace? */ |
4576 | case OP_CHARWP: /* char-whitespace? */ r = Cisspace (ivalue (a)); break; |
4658 | s_retbool (Cisspace (ivalue (car (SCHEME_V->args)))); |
|
|
4659 | |
|
|
4660 | case OP_CHARUP: /* char-upper-case? */ |
4577 | case OP_CHARUP: /* char-upper-case? */ r = Cisupper (ivalue (a)); break; |
4661 | s_retbool (Cisupper (ivalue (car (SCHEME_V->args)))); |
|
|
4662 | |
|
|
4663 | case OP_CHARLP: /* char-lower-case? */ |
4578 | case OP_CHARLP: /* char-lower-case? */ r = Cislower (ivalue (a)); break; |
4664 | s_retbool (Cislower (ivalue (car (SCHEME_V->args)))); |
|
|
4665 | #endif |
4579 | #endif |
|
|
4580 | |
4666 | #if USE_PORTS |
4581 | #if USE_PORTS |
4667 | |
4582 | case OP_PORTP: /* port? */ r = is_port (a) ; break; |
4668 | case OP_PORTP: /* port? */ |
|
|
4669 | s_retbool (is_port (car (SCHEME_V->args))); |
|
|
4670 | |
|
|
4671 | case OP_INPORTP: /* input-port? */ |
4583 | case OP_INPORTP: /* input-port? */ r = is_inport (a) ; break; |
4672 | s_retbool (is_inport (car (SCHEME_V->args))); |
|
|
4673 | |
|
|
4674 | case OP_OUTPORTP: /* output-port? */ |
4584 | case OP_OUTPORTP: /* output-port? */ r = is_outport (a); break; |
4675 | s_retbool (is_outport (car (SCHEME_V->args))); |
|
|
4676 | #endif |
4585 | #endif |
4677 | |
4586 | |
4678 | case OP_PROCP: /* procedure? */ |
4587 | case OP_PROCP: /* procedure? */ |
4679 | |
4588 | |
4680 | /*-- |
4589 | /*-- |
4681 | * continuation should be procedure by the example |
4590 | * continuation should be procedure by the example |
4682 | * (call-with-current-continuation procedure?) ==> #t |
4591 | * (call-with-current-continuation procedure?) ==> #t |
4683 | * in R^3 report sec. 6.9 |
4592 | * in R^3 report sec. 6.9 |
4684 | */ |
4593 | */ |
4685 | s_retbool (is_proc (car (SCHEME_V->args)) || is_closure (car (SCHEME_V->args)) |
4594 | r = is_proc (a) || is_closure (a) || is_continuation (a) || is_foreign (a); |
4686 | || is_continuation (car (SCHEME_V->args)) || is_foreign (car (SCHEME_V->args))); |
4595 | break; |
4687 | |
4596 | |
4688 | case OP_PAIRP: /* pair? */ |
4597 | case OP_PAIRP: /* pair? */ r = is_pair (a) ; break; |
4689 | s_retbool (is_pair (car (SCHEME_V->args))); |
4598 | case OP_LISTP: /* list? */ r = list_length (SCHEME_A_ a) >= 0; break; |
4690 | |
4599 | case OP_ENVP: /* environment? */ r = is_environment (a) ; break; |
4691 | case OP_LISTP: /* list? */ |
4600 | case OP_VECTORP: /* vector? */ r = is_vector (a) ; break; |
4692 | s_retbool (list_length (SCHEME_A_ car (SCHEME_V->args)) >= 0); |
4601 | case OP_EQ: /* eq? */ r = a == cadr (x) ; break; |
4693 | |
4602 | case OP_EQV: /* eqv? */ r = eqv (a, cadr (x)) ; break; |
4694 | case OP_ENVP: /* environment? */ |
|
|
4695 | s_retbool (is_environment (car (SCHEME_V->args))); |
|
|
4696 | |
|
|
4697 | case OP_VECTORP: /* vector? */ |
|
|
4698 | s_retbool (is_vector (car (SCHEME_V->args))); |
|
|
4699 | |
|
|
4700 | case OP_EQ: /* eq? */ |
|
|
4701 | s_retbool (car (SCHEME_V->args) == cadr (SCHEME_V->args)); |
|
|
4702 | |
|
|
4703 | case OP_EQV: /* eqv? */ |
|
|
4704 | s_retbool (eqv (car (SCHEME_V->args), cadr (SCHEME_V->args))); |
|
|
4705 | } |
4603 | } |
4706 | |
4604 | |
4707 | return S_T; |
4605 | s_retbool (r); |
4708 | } |
4606 | } |
4709 | |
4607 | |
4710 | static pointer |
4608 | static pointer |
4711 | opexe_4 (SCHEME_P_ enum scheme_opcodes op) |
4609 | opexe_4 (SCHEME_P_ enum scheme_opcodes op) |
4712 | { |
4610 | { |
… | |
… | |
5026 | case OP_CURR_ENV: /* current-environment */ |
4924 | case OP_CURR_ENV: /* current-environment */ |
5027 | s_return (SCHEME_V->envir); |
4925 | s_return (SCHEME_V->envir); |
5028 | |
4926 | |
5029 | } |
4927 | } |
5030 | |
4928 | |
5031 | return S_T; |
4929 | abort (); |
5032 | } |
4930 | } |
5033 | |
4931 | |
5034 | static pointer |
4932 | static pointer |
5035 | opexe_5 (SCHEME_P_ enum scheme_opcodes op) |
4933 | opexe_5 (SCHEME_P_ enum scheme_opcodes op) |
5036 | { |
4934 | { |
… | |
… | |
5375 | s_goto (OP_P0LIST); |
5273 | s_goto (OP_P0LIST); |
5376 | } |
5274 | } |
5377 | } |
5275 | } |
5378 | } |
5276 | } |
5379 | |
5277 | |
5380 | return S_T; |
5278 | abort (); |
5381 | } |
5279 | } |
5382 | |
5280 | |
5383 | static pointer |
5281 | static pointer |
5384 | opexe_6 (SCHEME_P_ enum scheme_opcodes op) |
5282 | opexe_6 (SCHEME_P_ enum scheme_opcodes op) |
5385 | { |
5283 | { |
… | |
… | |
5436 | |
5334 | |
5437 | case OP_MACROP: /* macro? */ |
5335 | case OP_MACROP: /* macro? */ |
5438 | s_retbool (is_macro (car (SCHEME_V->args))); |
5336 | s_retbool (is_macro (car (SCHEME_V->args))); |
5439 | } |
5337 | } |
5440 | |
5338 | |
5441 | return S_T; /* NOTREACHED */ |
5339 | abort (); |
5442 | } |
5340 | } |
5443 | |
5341 | |
5444 | typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); |
5342 | typedef pointer (*dispatch_func) (SCHEME_P_ enum scheme_opcodes); |
5445 | |
5343 | |
5446 | typedef int (*test_predicate) (pointer); |
5344 | typedef int (*test_predicate) (pointer); |
… | |
… | |
5541 | int ok = 1; |
5439 | int ok = 1; |
5542 | char msg[STRBUFFSIZE]; |
5440 | char msg[STRBUFFSIZE]; |
5543 | int n = list_length (SCHEME_A_ SCHEME_V->args); |
5441 | int n = list_length (SCHEME_A_ SCHEME_V->args); |
5544 | |
5442 | |
5545 | /* Check number of arguments */ |
5443 | /* Check number of arguments */ |
5546 | if (n < pcd->min_arity) |
5444 | if (ecb_expect_false (n < pcd->min_arity)) |
5547 | { |
5445 | { |
5548 | ok = 0; |
5446 | ok = 0; |
5549 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5447 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5550 | pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); |
5448 | pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at least", pcd->min_arity); |
5551 | } |
5449 | } |
5552 | |
5450 | else if (ecb_excpect_false (n > pcd->max_arity)) |
5553 | if (ok && n > pcd->max_arity) |
|
|
5554 | { |
5451 | { |
5555 | ok = 0; |
5452 | ok = 0; |
5556 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5453 | snprintf (msg, STRBUFFSIZE, "%s: needs%s %d argument(s)", |
5557 | pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); |
5454 | pcd->name, pcd->min_arity == pcd->max_arity ? "" : " at most", pcd->max_arity); |
5558 | } |
5455 | } |
5559 | |
5456 | |
5560 | if (ok) |
5457 | if (ecb_expect_false (ok)) |
5561 | { |
5458 | { |
5562 | if (pcd->arg_tests_encoding) |
5459 | if (pcd->arg_tests_encoding) |
5563 | { |
5460 | { |
5564 | int i = 0; |
5461 | int i = 0; |
5565 | int j; |
5462 | int j; |
… | |
… | |
5609 | } |
5506 | } |
5610 | #endif |
5507 | #endif |
5611 | |
5508 | |
5612 | ok_to_freely_gc (SCHEME_A); |
5509 | ok_to_freely_gc (SCHEME_A); |
5613 | |
5510 | |
5614 | if (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL) |
5511 | if (ecb_expect_false (pcd->func (SCHEME_A_ SCHEME_V->op) == NIL)) |
5615 | return; |
5512 | return; |
5616 | |
5513 | |
5617 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
5514 | if (SCHEME_V->no_memory && USE_ERROR_CHECKING) |
5618 | { |
5515 | { |
5619 | xwrstr ("No memory!\n"); |
5516 | xwrstr ("No memory!\n"); |
… | |
… | |
5677 | |
5574 | |
5678 | case 'd': |
5575 | case 'd': |
5679 | return OP_COND0; /* cond */ |
5576 | return OP_COND0; /* cond */ |
5680 | |
5577 | |
5681 | case '*': |
5578 | case '*': |
5682 | return OP_LET0AST; /* let* */ |
5579 | return OP_LET0AST;/* let* */ |
5683 | |
5580 | |
5684 | default: |
5581 | default: |
5685 | return OP_SET0; /* set! */ |
5582 | return OP_SET0; /* set! */ |
5686 | } |
5583 | } |
5687 | |
5584 | |
… | |
… | |
5709 | |
5606 | |
5710 | case 'f': |
5607 | case 'f': |
5711 | return OP_DEF0; /* define */ |
5608 | return OP_DEF0; /* define */ |
5712 | |
5609 | |
5713 | default: |
5610 | default: |
5714 | return OP_LET0REC; /* letrec */ |
5611 | return OP_LET0REC;/* letrec */ |
5715 | } |
5612 | } |
5716 | |
5613 | |
5717 | default: |
5614 | default: |
5718 | return OP_C0STREAM; /* cons-stream */ |
5615 | return OP_C0STREAM; /* cons-stream */ |
5719 | } |
5616 | } |