tags.h 19 KB

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