| 1 | /* Copyright (C) 1995,1996,1997,1998 Free Software Foundation, Inc. |
| 2 | * |
| 3 | * This program is free software; you can redistribute it and/or modify |
| 4 | * it under the terms of the GNU General Public License as published by |
| 5 | * the Free Software Foundation; either version 2, or (at your option) |
| 6 | * any later version. |
| 7 | * |
| 8 | * This program is distributed in the hope that it will be useful, |
| 9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 11 | * GNU General Public License for more details. |
| 12 | * |
| 13 | * You should have received a copy of the GNU General Public License |
| 14 | * along with this software; see the file COPYING. If not, write to |
| 15 | * the Free Software Foundation, Inc., 59 Temple Place, Suite 330, |
| 16 | * Boston, MA 02111-1307 USA |
| 17 | * |
| 18 | * As a special exception, the Free Software Foundation gives permission |
| 19 | * for additional uses of the text contained in its release of GUILE. |
| 20 | * |
| 21 | * The exception is that, if you link the GUILE library with other files |
| 22 | * to produce an executable, this does not by itself cause the |
| 23 | * resulting executable to be covered by the GNU General Public License. |
| 24 | * Your use of that executable is in no way restricted on account of |
| 25 | * linking the GUILE library code into it. |
| 26 | * |
| 27 | * This exception does not however invalidate any other reasons why |
| 28 | * the executable file might be covered by the GNU General Public License. |
| 29 | * |
| 30 | * This exception applies only to the code released by the |
| 31 | * Free Software Foundation under the name GUILE. If you copy |
| 32 | * code from other Free Software Foundation releases into a copy of |
| 33 | * GUILE, as the General Public License permits, the exception does |
| 34 | * not apply to the code that you add in this way. To avoid misleading |
| 35 | * anyone as to the status of such modified files, you must delete |
| 36 | * this exception notice from them. |
| 37 | * |
| 38 | * If you write modifications of your own for GUILE, it is your choice |
| 39 | * whether to permit this exception to apply to your modifications. |
| 40 | * If you do not wish that, delete this exception notice. */ |
| 41 | \f |
| 42 | #include <stdio.h> |
| 43 | #include "_scm.h" |
| 44 | #include "ramap.h" |
| 45 | #include "stackchk.h" |
| 46 | #include "strorder.h" |
| 47 | #include "smob.h" |
| 48 | #include "unif.h" |
| 49 | |
| 50 | #include "eq.h" |
| 51 | \f |
| 52 | SCM_PROC1 (s_eq_p, "eq?", scm_tc7_rpsubr, scm_eq_p); |
| 53 | |
| 54 | SCM |
| 55 | scm_eq_p (x, y) |
| 56 | SCM x; |
| 57 | SCM y; |
| 58 | { |
| 59 | return ((x==y) |
| 60 | ? SCM_BOOL_T |
| 61 | : SCM_BOOL_F); |
| 62 | } |
| 63 | |
| 64 | |
| 65 | SCM_PROC1 (s_eqv_p, "eqv?", scm_tc7_rpsubr, scm_eqv_p); |
| 66 | |
| 67 | SCM |
| 68 | scm_eqv_p (x, y) |
| 69 | SCM x; |
| 70 | SCM y; |
| 71 | { |
| 72 | if (x==y) return SCM_BOOL_T; |
| 73 | if (SCM_IMP(x)) return SCM_BOOL_F; |
| 74 | if (SCM_IMP(y)) return SCM_BOOL_F; |
| 75 | /* this ensures that types and scm_length are the same. */ |
| 76 | if (SCM_CAR(x) != SCM_CAR(y)) return SCM_BOOL_F; |
| 77 | if (SCM_NUMP(x)) { |
| 78 | # ifdef SCM_BIGDIG |
| 79 | if (SCM_BIGP(x)) return (0==scm_bigcomp(x, y)) ? SCM_BOOL_T : SCM_BOOL_F; |
| 80 | # endif |
| 81 | #ifdef SCM_FLOATS |
| 82 | if (SCM_REALPART(x) != SCM_REALPART(y)) return SCM_BOOL_F; |
| 83 | if (SCM_CPLXP(x) && (SCM_IMAG(x) != SCM_IMAG(y))) return SCM_BOOL_F; |
| 84 | #endif |
| 85 | return SCM_BOOL_T; |
| 86 | } |
| 87 | return SCM_BOOL_F; |
| 88 | } |
| 89 | |
| 90 | |
| 91 | SCM_PROC1 (s_equal_p, "equal?", scm_tc7_rpsubr, scm_equal_p); |
| 92 | |
| 93 | SCM |
| 94 | scm_equal_p (x, y) |
| 95 | SCM x; |
| 96 | SCM y; |
| 97 | { |
| 98 | SCM_CHECK_STACK; |
| 99 | tailrecurse: SCM_TICK; |
| 100 | if (x==y) return SCM_BOOL_T; |
| 101 | if (SCM_IMP(x)) return SCM_BOOL_F; |
| 102 | if (SCM_IMP(y)) return SCM_BOOL_F; |
| 103 | if (SCM_CONSP(x) && SCM_CONSP(y)) { |
| 104 | if SCM_FALSEP(scm_equal_p(SCM_CAR(x), SCM_CAR(y))) return SCM_BOOL_F; |
| 105 | x = SCM_CDR(x); |
| 106 | y = SCM_CDR(y); |
| 107 | goto tailrecurse; |
| 108 | } |
| 109 | if (SCM_TYP7S (x) == scm_tc7_string |
| 110 | && SCM_TYP7S (y) == scm_tc7_string) |
| 111 | return scm_string_equal_p (x, y); |
| 112 | /* This ensures that types and scm_length are the same. */ |
| 113 | if (SCM_CAR(x) != SCM_CAR(y)) return SCM_BOOL_F; |
| 114 | switch (SCM_TYP7(x)) { |
| 115 | default: return SCM_BOOL_F; |
| 116 | case scm_tc7_vector: |
| 117 | case scm_tc7_wvect: |
| 118 | return scm_vector_equal_p(x, y); |
| 119 | case scm_tc7_smob: { |
| 120 | int i = SCM_SMOBNUM(x); |
| 121 | if (!(i < scm_numsmob)) return SCM_BOOL_F; |
| 122 | if (scm_smobs[i].equalp) |
| 123 | return (scm_smobs[i].equalp)(x, y); |
| 124 | else |
| 125 | return SCM_BOOL_F; |
| 126 | } |
| 127 | #ifdef HAVE_ARRAYS |
| 128 | case scm_tc7_bvect: case scm_tc7_uvect: case scm_tc7_ivect: |
| 129 | case scm_tc7_fvect: case scm_tc7_cvect: case scm_tc7_dvect: |
| 130 | case scm_tc7_svect: |
| 131 | #ifdef HAVE_LONG_LONGS |
| 132 | case scm_tc7_llvect: |
| 133 | #endif |
| 134 | case scm_tc7_byvect: |
| 135 | if ( scm_tc16_array |
| 136 | && scm_smobs[0x0ff & (scm_tc16_array >> 8)].equalp) |
| 137 | return scm_array_equal_p(x, y); |
| 138 | #endif |
| 139 | } |
| 140 | return SCM_BOOL_F; |
| 141 | } |
| 142 | |
| 143 | |
| 144 | \f |
| 145 | |
| 146 | |
| 147 | |
| 148 | void |
| 149 | scm_init_eq () |
| 150 | { |
| 151 | #include "eq.x" |
| 152 | } |
| 153 | |