| 1 | /* classes: h_files */ |
| 2 | |
| 3 | #ifndef TAGSH |
| 4 | #define TAGSH |
| 5 | /* Copyright (C) 1995, 96, 97, 98, 99, 2000 Free Software Foundation, Inc. |
| 6 | * |
| 7 | * This program is free software; you can redistribute it and/or modify |
| 8 | * it under the terms of the GNU General Public License as published by |
| 9 | * the Free Software Foundation; either version 2, or (at your option) |
| 10 | * any later version. |
| 11 | * |
| 12 | * This program is distributed in the hope that it will be useful, |
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 15 | * GNU General Public License for more details. |
| 16 | * |
| 17 | * You should have received a copy of the GNU General Public License |
| 18 | * along with this software; see the file COPYING. If not, write to |
| 19 | * the Free Software Foundation, Inc., 59 Temple Place, Suite 330, |
| 20 | * Boston, MA 02111-1307 USA |
| 21 | * |
| 22 | * As a special exception, the Free Software Foundation gives permission |
| 23 | * for additional uses of the text contained in its release of GUILE. |
| 24 | * |
| 25 | * The exception is that, if you link the GUILE library with other files |
| 26 | * to produce an executable, this does not by itself cause the |
| 27 | * resulting executable to be covered by the GNU General Public License. |
| 28 | * Your use of that executable is in no way restricted on account of |
| 29 | * linking the GUILE library code into it. |
| 30 | * |
| 31 | * This exception does not however invalidate any other reasons why |
| 32 | * the executable file might be covered by the GNU General Public License. |
| 33 | * |
| 34 | * This exception applies only to the code released by the |
| 35 | * Free Software Foundation under the name GUILE. If you copy |
| 36 | * code from other Free Software Foundation releases into a copy of |
| 37 | * GUILE, as the General Public License permits, the exception does |
| 38 | * not apply to the code that you add in this way. To avoid misleading |
| 39 | * anyone as to the status of such modified files, you must delete |
| 40 | * this exception notice from them. |
| 41 | * |
| 42 | * If you write modifications of your own for GUILE, it is your choice |
| 43 | * whether to permit this exception to apply to your modifications. |
| 44 | * If you do not wish that, delete this exception notice. */ |
| 45 | |
| 46 | /* Software engineering face-lift by Greg J. Badros, 11-Dec-1999, |
| 47 | gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */ |
| 48 | |
| 49 | \f |
| 50 | |
| 51 | /** This file defines the format of SCM values and cons pairs. |
| 52 | ** It is here that tag bits are assigned for various purposes. |
| 53 | **/ |
| 54 | |
| 55 | \f |
| 56 | |
| 57 | /* #define SCM_VOIDP_TEST */ |
| 58 | |
| 59 | /* In the beginning was the Word: |
| 60 | */ |
| 61 | typedef long scm_bits_t; |
| 62 | |
| 63 | /* But as external interface, we use SCM, which may, according to the desired |
| 64 | * level of type checking, be defined in several ways: |
| 65 | */ |
| 66 | #if (SCM_DEBUG_TYPING_STRICTNESS == 1) |
| 67 | typedef union { struct { scm_bits_t n; } n; } SCM; |
| 68 | static SCM scm_pack(scm_bits_t b) { SCM s; s.n.n = b; return s; } |
| 69 | # define SCM_UNPACK(x) ((x).n.n) |
| 70 | # define SCM_PACK(x) (scm_pack ((scm_bits_t) (x))) |
| 71 | #elif defined (SCM_VOIDP_TEST) |
| 72 | /* This is the default, which provides an intermediate level of compile time |
| 73 | * type checking while still resulting in very efficient code. |
| 74 | */ |
| 75 | typedef void * SCM; |
| 76 | # define SCM_UNPACK(x) ((scm_bits_t) (x)) |
| 77 | # define SCM_PACK(x) ((SCM) (x)) |
| 78 | #else |
| 79 | /* This should be used as a fall back solution for machines on which casting |
| 80 | * to a pointer may lead to loss of bit information, e. g. in the three least |
| 81 | * significant bits. |
| 82 | */ |
| 83 | typedef scm_bits_t SCM; |
| 84 | # define SCM_UNPACK(x) (x) |
| 85 | # define SCM_PACK(x) ((scm_bits_t) (x)) |
| 86 | #endif |
| 87 | |
| 88 | |
| 89 | /* SCM values can not be compared by using the operator ==. Use the following |
| 90 | * macro instead, which is the equivalent of the scheme predicate 'eq?'. |
| 91 | */ |
| 92 | #define SCM_EQ_P(x, y) (SCM_UNPACK (x) == SCM_UNPACK (y)) |
| 93 | |
| 94 | \f |
| 95 | |
| 96 | /* SCM variables can contain: |
| 97 | * |
| 98 | * Non-objects -- meaning that the tag-related macros don't apply to them |
| 99 | * in the usual way. |
| 100 | * |
| 101 | * Immediates -- meaning that the variable contains an entire Scheme object. |
| 102 | * |
| 103 | * Non-immediates -- meaning that the variable holds a (possibly |
| 104 | * tagged) pointer into the cons pair heap. |
| 105 | * |
| 106 | * Non-objects are distinguished from other values by careful coding |
| 107 | * only (i.e., programmers must keep track of any SCM variables they |
| 108 | * create that don't contain ordinary scheme values). |
| 109 | * |
| 110 | * All immediates and non-immediates must have a 0 in bit 0. Only |
| 111 | * non-object values can have a 1 in bit 0. In some cases, bit 0 of a |
| 112 | * word in the heap is used for the GC tag so during garbage |
| 113 | * collection, that bit might be 1 even in an immediate or |
| 114 | * non-immediate value. In other cases, bit 0 of a word in the heap |
| 115 | * is used to tag a pointer to a GLOC (VM global variable address) or |
| 116 | * the header of a struct. But whenever an SCM variable holds a |
| 117 | * normal Scheme value, bit 0 is 0. |
| 118 | * |
| 119 | * Immediates and non-immediates are distinguished by bits two and four. |
| 120 | * Immediate values must have a 1 in at least one of those bits. Does |
| 121 | * this (or any other detail of tagging) seem arbitrary? Try changing it! |
| 122 | * (Not always impossible but it is fair to say that many details of tags |
| 123 | * are mutually dependent). */ |
| 124 | |
| 125 | #define SCM_IMP(x) (6 & SCM_UNPACK (x)) |
| 126 | #define SCM_NIMP(x) (!SCM_IMP (x)) |
| 127 | |
| 128 | /* Here is a summary of tagging in SCM values as they might occur in |
| 129 | * SCM variables or in the heap. |
| 130 | * |
| 131 | * low bits meaning |
| 132 | * |
| 133 | * |
| 134 | * 0 Most objects except... |
| 135 | * 1 ...glocs and structs (this tag valid only in a SCM_CAR or |
| 136 | * in the header of a struct's data). |
| 137 | * |
| 138 | * 00 heap addresses and many immediates (not integers) |
| 139 | * 01 glocs/structs, some tc7_ codes |
| 140 | * 10 immediate integers |
| 141 | * 11 various tc7_ codes including, tc16_ codes. |
| 142 | * |
| 143 | * |
| 144 | * 000 heap address |
| 145 | * 001 glocs/structs |
| 146 | * 010 integer |
| 147 | * 011 closure |
| 148 | * 100 immediates |
| 149 | * 101 tc7_ |
| 150 | * 110 integer |
| 151 | * 111 tc7_ |
| 152 | * |
| 153 | * |
| 154 | * 100 --- IMMEDIATES |
| 155 | * |
| 156 | * Looking at the seven final bits of an immediate: |
| 157 | * |
| 158 | * 0000-100 short instruction |
| 159 | * 0001-100 short instruction |
| 160 | * 0010-100 short instruction |
| 161 | * 0011-100 short instruction |
| 162 | * 0100-100 short instruction |
| 163 | * 0101-100 short instruction |
| 164 | * 0110-100 various immediates and long instructions |
| 165 | * 0111-100 short instruction |
| 166 | * 1000-100 short instruction |
| 167 | * 1001-100 short instruction |
| 168 | * 1010-100 short instruction |
| 169 | * 1011-100 short instruction |
| 170 | * 1100-100 short instruction |
| 171 | * 1101-100 short instruction |
| 172 | * 1110-100 immediate characters |
| 173 | * 1111-100 ilocs |
| 174 | * |
| 175 | * Some of the 0110100 immediates are long instructions (they dispatch |
| 176 | * in two steps compared to one step for a short instruction). |
| 177 | * The two steps are, (1) dispatch on 7 bits to the long instruction |
| 178 | * handler, (2) dispatch on 7 additional bits. |
| 179 | * |
| 180 | * One way to think of it is that there are 128 short instructions, |
| 181 | * with the 13 immediates above being some of the most interesting. |
| 182 | * |
| 183 | * Also noteworthy are the groups of 16 7-bit instructions implied by |
| 184 | * some of the 3-bit tags. For example, closure references consist |
| 185 | * of an 8-bit aligned address tagged with 011. There are 16 identical 7-bit |
| 186 | * instructions, all ending 011, which are invoked by evaluating closures. |
| 187 | * |
| 188 | * In other words, if you hand the evaluator a closure, the evaluator |
| 189 | * treats the closure as a graph of virtual machine instructions. |
| 190 | * A closure is a pair with a pointer to the body of the procedure |
| 191 | * in the CDR and a pointer to the environment of the closure in the CAR. |
| 192 | * The environment pointer is tagged 011 which implies that the least |
| 193 | * significant 7 bits of the environment pointer also happen to be |
| 194 | * a virtual machine instruction we could call "SELF" (for self-evaluating |
| 195 | * object). |
| 196 | * |
| 197 | * A less trivial example are the 16 instructions ending 000. If those |
| 198 | * bits tag the CAR of a pair, then evidently the pair is an ordinary |
| 199 | * cons pair and should be evaluated as a procedure application. The sixteen, |
| 200 | * 7-bit 000 instructions are all "NORMAL-APPLY" (Things get trickier. |
| 201 | * For example, if the CAR of a procedure application is a symbol, the NORMAL-APPLY |
| 202 | * instruction will, as a side effect, overwrite that CAR with a new instruction |
| 203 | * that contains a cached address for the variable named by the symbol.) |
| 204 | * |
| 205 | * Here is a summary of tags in the CAR of a non-immediate: |
| 206 | * |
| 207 | * HEAP CELL: G=gc_mark; 1 during mark, 0 other times. |
| 208 | * |
| 209 | * cons ..........SCM car..............0 ...........SCM cdr.............G |
| 210 | * gloc ..........SCM vcell..........001 ...........SCM cdr.............G |
| 211 | * struct ..........void * type........001 ...........void * data.........G |
| 212 | * closure ..........SCM code...........011 ...........SCM env.............G |
| 213 | * tc7 .........long length....Gxxxx1S1 ..........void *data............ |
| 214 | * |
| 215 | * |
| 216 | * |
| 217 | * 101 & 111 --- tc7_ types |
| 218 | * |
| 219 | * tc7_tags are 7 bit tags ending in 1x1. These tags |
| 220 | * occur only in the CAR of heap cells, and have the |
| 221 | * handy property that all bits of the CAR above the |
| 222 | * bottom eight can be used to store a length, thus |
| 223 | * saving a word in the body itself. Thus, we use them |
| 224 | * for strings and vectors (among other things). |
| 225 | * |
| 226 | * SCM_LENGTH returns the bits in "length" (see the diagram). |
| 227 | * SCM_CHARS returns the data cast to "char *" |
| 228 | * SCM_CDR returns the data cast to "SCM" |
| 229 | * TYP7(X) returns bits 0...6 of SCM_CAR (X) |
| 230 | * |
| 231 | * For the interpretation of SCM_LENGTH and SCM_CHARS |
| 232 | * that applies to a particular type, see the header file |
| 233 | * for that type. |
| 234 | * |
| 235 | * Sometimes we choose the bottom seven bits carefully, |
| 236 | * so that the 2-valued bit (called S bit) can be masked |
| 237 | * off to reveal a common type. |
| 238 | * |
| 239 | * TYP7S(X) returns TYP7, but masking out the option bit S. |
| 240 | * |
| 241 | * For example, all strings have 0010 in the 'xxxx' bits |
| 242 | * in the diagram above, the S bit says whether it's a |
| 243 | * substring. |
| 244 | * |
| 245 | * for example: |
| 246 | * S |
| 247 | * scm_tc7_string = G0010101 |
| 248 | * scm_tc7_substring = G0010111 |
| 249 | * |
| 250 | * TYP7S turns both string tags into tc7_string; thus, |
| 251 | * testing TYP7S against tc7_string is a quick way to |
| 252 | * test for any kind of string, shared or unshared. |
| 253 | * |
| 254 | * Some TC7 types are subdivided into 256 subtypes giving |
| 255 | * rise to the macros: |
| 256 | * |
| 257 | * TYP16 |
| 258 | * TYP16S |
| 259 | * GCTYP16 |
| 260 | * |
| 261 | * TYP16S functions similarly wrt to TYP16 as TYP7S to TYP7, |
| 262 | * but a different option bit is used (bit 2 for TYP7S, |
| 263 | * bit 8 for TYP16S). |
| 264 | * */ |
| 265 | |
| 266 | |
| 267 | |
| 268 | \f |
| 269 | /* {Non-immediate values.} |
| 270 | * |
| 271 | * If X is non-immediate, it is necessary to look at SCM_CAR (X) to |
| 272 | * figure out Xs type. X may be a cons pair, in which case the value |
| 273 | * SCM_CAR (x) will be either an immediate or non-immediate value. X |
| 274 | * may be something other than a cons pair, in which case the value |
| 275 | * SCM_CAR (x) will be a non-object value. |
| 276 | * |
| 277 | * All immediates and non-immediates have a 0 in bit 0. We |
| 278 | * additionally preserve the invariant that all non-object values |
| 279 | * stored in the SCM_CAR of a non-immediate object have a 1 in bit 1: |
| 280 | */ |
| 281 | |
| 282 | #define SCM_SLOPPY_CONSP(x) ((1 & SCM_CELL_TYPE (x)) == 0) |
| 283 | #define SCM_SLOPPY_NCONSP(x) (!SCM_SLOPPY_CONSP(x)) |
| 284 | |
| 285 | #define SCM_CONSP(x) (!SCM_IMP (x) && SCM_SLOPPY_CONSP (x)) |
| 286 | #define SCM_NCONSP(x) (!SCM_CONSP (x)) |
| 287 | |
| 288 | |
| 289 | /* SCM_ECONSP should be used instead of SCM_CONSP at places where GLOCS |
| 290 | * can be expected to occur. |
| 291 | */ |
| 292 | #define SCM_ECONSP(x) \ |
| 293 | (!SCM_IMP (x) \ |
| 294 | && (SCM_SLOPPY_CONSP (x) \ |
| 295 | || (SCM_TYP3 (x) == 1 \ |
| 296 | && (SCM_STRUCT_VTABLE_DATA (x)[scm_vtable_index_vcell] != 0)))) |
| 297 | #define SCM_NECONSP(x) (!SCM_ECONSP (x)) |
| 298 | |
| 299 | \f |
| 300 | |
| 301 | #define SCM_CELLP(x) (((sizeof (scm_cell) - 1) & SCM_UNPACK (x)) == 0) |
| 302 | #define SCM_NCELLP(x) (!SCM_CELLP (x)) |
| 303 | |
| 304 | #define SCM_DOUBLE_CELLP(x) (((2 * sizeof (scm_cell) - 1) & SCM_UNPACK (x)) == 0) |
| 305 | |
| 306 | /* See numbers.h for macros relating to immediate integers. |
| 307 | */ |
| 308 | |
| 309 | #define SCM_ITAG3(x) (7 & SCM_UNPACK (x)) |
| 310 | #define SCM_TYP3(x) (7 & SCM_CELL_TYPE (x)) |
| 311 | #define scm_tc3_cons 0 |
| 312 | #define scm_tc3_cons_gloc 1 |
| 313 | #define scm_tc3_int_1 2 |
| 314 | #define scm_tc3_closure 3 |
| 315 | #define scm_tc3_imm24 4 |
| 316 | #define scm_tc3_tc7_1 5 |
| 317 | #define scm_tc3_int_2 6 |
| 318 | #define scm_tc3_tc7_2 7 |
| 319 | |
| 320 | |
| 321 | /* |
| 322 | * Do not change the three bit tags. |
| 323 | */ |
| 324 | |
| 325 | |
| 326 | #define SCM_TYP7(x) (0x7f & SCM_CELL_TYPE (x)) |
| 327 | #define SCM_TYP7S(x) ((0x7f & ~2) & SCM_CELL_TYPE (x)) |
| 328 | |
| 329 | |
| 330 | #define SCM_TYP16(x) (0xffff & SCM_CELL_TYPE (x)) |
| 331 | #define SCM_TYP16S(x) (0xfeff & SCM_CELL_TYPE (x)) |
| 332 | |
| 333 | \f |
| 334 | |
| 335 | #define scm_tc7_symbol 5 |
| 336 | /* free 7 */ |
| 337 | |
| 338 | /* couple */ |
| 339 | #define scm_tc7_vector 13 |
| 340 | #define scm_tc7_wvect 15 |
| 341 | |
| 342 | /* couple */ |
| 343 | #define scm_tc7_string 21 |
| 344 | #define scm_tc7_substring 23 |
| 345 | |
| 346 | /* Many of the following should be turned |
| 347 | * into structs or smobs. We need back some |
| 348 | * of these 7 bit tags! |
| 349 | */ |
| 350 | #define scm_tc7_pws 31 |
| 351 | #define scm_tc7_lvector 39 |
| 352 | |
| 353 | #ifdef HAVE_ARRAYS |
| 354 | #define scm_tc7_llvect 29 |
| 355 | #define scm_tc7_uvect 37 |
| 356 | #define scm_tc7_fvect 45 |
| 357 | #define scm_tc7_dvect 47 |
| 358 | #define scm_tc7_cvect 53 |
| 359 | #define scm_tc7_svect 55 |
| 360 | #define scm_tc7_bvect 71 |
| 361 | #define scm_tc7_byvect 77 |
| 362 | #define scm_tc7_ivect 79 |
| 363 | #endif |
| 364 | |
| 365 | #define scm_tc7_contin 61 |
| 366 | #define scm_tc7_cclo 63 |
| 367 | #define scm_tc7_rpsubr 69 |
| 368 | #define scm_tc7_subr_0 85 |
| 369 | #define scm_tc7_subr_1 87 |
| 370 | #define scm_tc7_cxr 93 |
| 371 | #define scm_tc7_subr_3 95 |
| 372 | #define scm_tc7_subr_2 101 |
| 373 | #define scm_tc7_asubr 103 |
| 374 | #define scm_tc7_subr_1o 109 |
| 375 | #define scm_tc7_subr_2o 111 |
| 376 | #define scm_tc7_lsubr_2 117 |
| 377 | #define scm_tc7_lsubr 119 |
| 378 | |
| 379 | |
| 380 | /* There are 256 port subtypes. Here are the first few. |
| 381 | * These must agree with the init function in ports.c |
| 382 | */ |
| 383 | #define scm_tc7_port 125 |
| 384 | |
| 385 | #define scm_tc16_fport (scm_tc7_port + 0 * 256L) |
| 386 | /* scm_tc16_pipe was here. */ |
| 387 | #define scm_tc16_strport (scm_tc7_port + 2 * 256L) |
| 388 | #define scm_tc16_sfport (scm_tc7_port + 3 * 256L) |
| 389 | |
| 390 | |
| 391 | /* There are 256 smob subtypes. Here are the first four. |
| 392 | */ |
| 393 | |
| 394 | #define scm_tc7_smob 127 /* DO NOT CHANGE [**] */ |
| 395 | |
| 396 | /* [**] If you change scm_tc7_smob, you must also change |
| 397 | * the places it is hard coded in this file and possibly others. |
| 398 | */ |
| 399 | |
| 400 | |
| 401 | /* scm_tc_free_cell is also the 0th smob type. We place this |
| 402 | * in free cells to tell the conservative marker not to trace it. |
| 403 | */ |
| 404 | #define scm_tc_free_cell 0x007f |
| 405 | |
| 406 | /* Smob type 1 (note the dependency on the predicate SCM_NUMP) |
| 407 | */ |
| 408 | #define scm_tc16_big 0x017f |
| 409 | |
| 410 | /* Smob types 2 and 3: |
| 411 | */ |
| 412 | #define scm_tc16_real 0x027f |
| 413 | #define scm_tc16_complex 0x037f |
| 414 | |
| 415 | \f |
| 416 | /* {Immediate Values} |
| 417 | */ |
| 418 | |
| 419 | enum scm_tags |
| 420 | { |
| 421 | scm_tc8_char = 0xf4, |
| 422 | scm_tc8_iloc = 0xfc |
| 423 | }; |
| 424 | |
| 425 | #define SCM_ITAG8(X) (SCM_UNPACK (X) & 0xff) |
| 426 | #define SCM_MAKE_ITAG8(X, TAG) SCM_PACK (((X) << 8) + TAG) |
| 427 | #define SCM_ITAG8_DATA(X) (SCM_UNPACK (X) >> 8) |
| 428 | |
| 429 | |
| 430 | \f |
| 431 | /* Immediate Symbols, Special Symbols, Flags (various constants). |
| 432 | */ |
| 433 | |
| 434 | /* SCM_ISYMP tests for ISPCSYM and ISYM */ |
| 435 | #define SCM_ISYMP(n) ((0x187 & SCM_UNPACK (n)) == 4) |
| 436 | |
| 437 | /* SCM_IFLAGP tests for ISPCSYM, ISYM and IFLAG */ |
| 438 | #define SCM_IFLAGP(n) ((0x87 & SCM_UNPACK (n)) == 4) |
| 439 | #define SCM_ISYMNUM(n) (SCM_UNPACK (n) >> 9) |
| 440 | #define SCM_ISYMCHARS(n) (scm_isymnames[SCM_ISYMNUM (n)]) |
| 441 | #define SCM_MAKSPCSYM(n) SCM_PACK (((n) << 9) + ((n) << 3) + 4L) |
| 442 | #define SCM_MAKISYM(n) SCM_PACK (((n) << 9) + 0x74L) |
| 443 | #define SCM_MAKIFLAG(n) SCM_PACK (((n) << 9) + 0x174L) |
| 444 | |
| 445 | extern char *scm_isymnames[]; /* defined in print.c */ |
| 446 | |
| 447 | /* This table must agree with the declarations |
| 448 | * in repl.c: {Names of immediate symbols}. |
| 449 | * |
| 450 | * These are used only in eval but their values |
| 451 | * have to be allocated here. |
| 452 | * |
| 453 | */ |
| 454 | |
| 455 | #define SCM_IM_AND SCM_MAKSPCSYM (0) |
| 456 | #define SCM_IM_BEGIN SCM_MAKSPCSYM (1) |
| 457 | #define SCM_IM_CASE SCM_MAKSPCSYM (2) |
| 458 | #define SCM_IM_COND SCM_MAKSPCSYM (3) |
| 459 | #define SCM_IM_DO SCM_MAKSPCSYM (4) |
| 460 | #define SCM_IM_IF SCM_MAKSPCSYM (5) |
| 461 | #define SCM_IM_LAMBDA SCM_MAKSPCSYM (6) |
| 462 | #define SCM_IM_LET SCM_MAKSPCSYM (7) |
| 463 | #define SCM_IM_LETSTAR SCM_MAKSPCSYM (8) |
| 464 | #define SCM_IM_LETREC SCM_MAKSPCSYM (9) |
| 465 | #define SCM_IM_OR SCM_MAKSPCSYM (10) |
| 466 | #define SCM_IM_QUOTE SCM_MAKSPCSYM (11) |
| 467 | #define SCM_IM_SET_X SCM_MAKSPCSYM (12) |
| 468 | #define SCM_IM_DEFINE SCM_MAKSPCSYM (13) |
| 469 | #define SCM_IM_APPLY SCM_MAKISYM (14) |
| 470 | #define SCM_IM_CONT SCM_MAKISYM (15) |
| 471 | #define SCM_BOOL_F SCM_MAKIFLAG (16) |
| 472 | #define SCM_BOOL_T SCM_MAKIFLAG (17) |
| 473 | #define SCM_UNDEFINED SCM_MAKIFLAG (18) |
| 474 | #define SCM_EOF_VAL SCM_MAKIFLAG (19) |
| 475 | #define SCM_EOL SCM_MAKIFLAG (20) |
| 476 | #define SCM_UNSPECIFIED SCM_MAKIFLAG (21) |
| 477 | #define SCM_IM_DISPATCH SCM_MAKISYM (22) |
| 478 | #define SCM_IM_SLOT_REF SCM_MAKISYM (23) |
| 479 | #define SCM_IM_SLOT_SET_X SCM_MAKISYM (24) |
| 480 | |
| 481 | /* Multi-language support */ |
| 482 | |
| 483 | #define SCM_IM_NIL_COND SCM_MAKISYM (25) |
| 484 | #define SCM_IM_NIL_IFY SCM_MAKISYM (26) |
| 485 | #define SCM_IM_T_IFY SCM_MAKISYM (27) |
| 486 | #define SCM_IM_0_COND SCM_MAKISYM (28) |
| 487 | #define SCM_IM_0_IFY SCM_MAKISYM (29) |
| 488 | #define SCM_IM_1_IFY SCM_MAKISYM (30) |
| 489 | #define SCM_IM_BIND SCM_MAKISYM (31) |
| 490 | |
| 491 | #define SCM_IM_DELAY SCM_MAKISYM (32) |
| 492 | |
| 493 | /* When a variable is unbound this is marked by the SCM_UNDEFINED |
| 494 | * value. The following is an unbound value which can be handled on |
| 495 | * the Scheme level, i.e., it can be stored in and retrieved from a |
| 496 | * Scheme variable. This value is only intended to mark an unbound |
| 497 | * slot in GOOPS. It is needed now, but we should probably rewrite |
| 498 | * the code which handles this value in C so that SCM_UNDEFINED can be |
| 499 | * used instead. It is not ideal to let this kind of unique and |
| 500 | * strange values loose on the Scheme level. |
| 501 | */ |
| 502 | #define SCM_UNBOUND SCM_MAKIFLAG (33) |
| 503 | |
| 504 | #define SCM_UNBNDP(x) (SCM_EQ_P ((x), SCM_UNDEFINED)) |
| 505 | |
| 506 | \f |
| 507 | |
| 508 | /* Dispatching aids: */ |
| 509 | |
| 510 | |
| 511 | /* For cons pairs with immediate values in the CAR |
| 512 | */ |
| 513 | |
| 514 | #define scm_tcs_cons_imcar 2:case 4:case 6:case 10:\ |
| 515 | case 12:case 14:case 18:case 20:\ |
| 516 | case 22:case 26:case 28:case 30:\ |
| 517 | case 34:case 36:case 38:case 42:\ |
| 518 | case 44:case 46:case 50:case 52:\ |
| 519 | case 54:case 58:case 60:case 62:\ |
| 520 | case 66:case 68:case 70:case 74:\ |
| 521 | case 76:case 78:case 82:case 84:\ |
| 522 | case 86:case 90:case 92:case 94:\ |
| 523 | case 98:case 100:case 102:case 106:\ |
| 524 | case 108:case 110:case 114:case 116:\ |
| 525 | case 118:case 122:case 124:case 126 |
| 526 | |
| 527 | /* For cons pairs with non-immediate values in the SCM_CAR |
| 528 | */ |
| 529 | #define scm_tcs_cons_nimcar 0:case 8:case 16:case 24:\ |
| 530 | case 32:case 40:case 48:case 56:\ |
| 531 | case 64:case 72:case 80:case 88:\ |
| 532 | case 96:case 104:case 112:case 120 |
| 533 | |
| 534 | /* A CONS_GLOC occurs in code. It's CAR is a pointer to the |
| 535 | * CDR of a variable. The low order bits of the CAR are 001. |
| 536 | * The CDR of the gloc is the code continuation. |
| 537 | */ |
| 538 | #define scm_tcs_cons_gloc 1:case 9:case 17:case 25:\ |
| 539 | case 33:case 41:case 49:case 57:\ |
| 540 | case 65:case 73:case 81:case 89:\ |
| 541 | case 97:case 105:case 113:case 121 |
| 542 | |
| 543 | #define scm_tcs_closures 3:case 11:case 19:case 27:\ |
| 544 | case 35:case 43:case 51:case 59:\ |
| 545 | case 67:case 75:case 83:case 91:\ |
| 546 | case 99:case 107:case 115:case 123 |
| 547 | |
| 548 | #define scm_tcs_subrs scm_tc7_asubr:case scm_tc7_subr_0:case scm_tc7_subr_1:case scm_tc7_cxr:\ |
| 549 | case scm_tc7_subr_3:case scm_tc7_subr_2:case scm_tc7_rpsubr:case scm_tc7_subr_1o:\ |
| 550 | case scm_tc7_subr_2o:case scm_tc7_lsubr_2:case scm_tc7_lsubr |
| 551 | |
| 552 | \f |
| 553 | |
| 554 | #if (SCM_DEBUG_DEPRECATED == 0) |
| 555 | |
| 556 | #define scm_tc7_ssymbol scm_tc7_symbol |
| 557 | #define scm_tc7_msymbol scm_tc7_symbol |
| 558 | #define scm_tcs_symbols scm_tc7_symbol |
| 559 | |
| 560 | #define scm_tc16_flo scm_tc16_real |
| 561 | #define scm_tc_flo 0x017fL |
| 562 | #define scm_tc_dblr scm_tc16_real |
| 563 | #define scm_tc_dblc scm_tc16_complex |
| 564 | |
| 565 | #endif /* SCM_DEBUG_DEPRECATED == 0 */ |
| 566 | |
| 567 | #endif /* TAGSH */ |
| 568 | |
| 569 | /* |
| 570 | Local Variables: |
| 571 | c-file-style: "gnu" |
| 572 | End: |
| 573 | */ |