lisp.h 131 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* Fundamental definitions for GNU Emacs Lisp interpreter.
2
   Copyright (C) 1985-1987, 1993-1995, 1997-2011
Glenn Morris's avatar
Glenn Morris committed
3
                 Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
4 5 6

This file is part of GNU Emacs.

7
GNU Emacs is free software: you can redistribute it and/or modify
Jim Blandy's avatar
Jim Blandy committed
8
it under the terms of the GNU General Public License as published by
9 10
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Jim Blandy's avatar
Jim Blandy committed
11 12 13 14 15 16 17

GNU Emacs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
18
along with GNU Emacs.  If not, see <http://www.gnu.org/licenses/>.  */
Jim Blandy's avatar
Jim Blandy committed
19

Kenichi Handa's avatar
Kenichi Handa committed
20 21 22
#ifndef EMACS_LISP_H
#define EMACS_LISP_H

23
#include <stdarg.h>
24
#include <stddef.h>
25
#include <inttypes.h>
26
#include <limits.h>
27

28 29
#include <intprops.h>

30 31
/* Use the configure flag --enable-checking[=LIST] to enable various
   types of run time checks for Lisp objects.  */
32

33
#ifdef GC_CHECK_CONS_LIST
34 35
extern void check_cons_list (void);
#define CHECK_CONS_LIST() check_cons_list ()
36
#else
37
#define CHECK_CONS_LIST() ((void) 0)
38
#endif
Jim Blandy's avatar
Jim Blandy committed
39

40 41 42 43
/* Temporarily disable wider-than-pointer integers until they're tested more.
   Build with CFLAGS='-DWIDE_EMACS_INT' to try them out.  */
/* #undef WIDE_EMACS_INT */

44
/* These are default choices for the types to use.  */
45
#ifndef EMACS_INT
46
# if BITS_PER_LONG < BITS_PER_LONG_LONG && defined WIDE_EMACS_INT
47 48 49 50 51 52 53 54 55 56 57 58
#  define EMACS_INT long long
#  define BITS_PER_EMACS_INT BITS_PER_LONG_LONG
#  define pI "ll"
# elif BITS_PER_INT < BITS_PER_LONG
#  define EMACS_INT long
#  define BITS_PER_EMACS_INT BITS_PER_LONG
#  define pI "l"
# else
#  define EMACS_INT int
#  define BITS_PER_EMACS_INT BITS_PER_INT
#  define pI ""
# endif
59 60
#endif
#ifndef EMACS_UINT
61
# define EMACS_UINT unsigned EMACS_INT
62
#endif
63

64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80
/* printmax_t and uprintmax_t are types for printing large integers.
   These are the widest integers that are supported for printing.
   pMd etc. are conversions for printing them.
   On C99 hosts, there's no problem, as even the widest integers work.
   Fall back on EMACS_INT on pre-C99 hosts.  */
#ifdef PRIdMAX
typedef intmax_t printmax_t;
typedef uintmax_t uprintmax_t;
# define pMd PRIdMAX
# define pMu PRIuMAX
#else
typedef EMACS_INT printmax_t;
typedef EMACS_UINT uprintmax_t;
# define pMd pI"d"
# define pMu pI"u"
#endif

81 82 83 84 85 86 87 88 89 90 91 92 93 94 95
/* Use pD to format ptrdiff_t values, which suffice for indexes into
   buffers and strings.  Emacs never allocates objects larger than
   PTRDIFF_MAX bytes, as they cause problems with pointer subtraction.
   In C99, pD can always be "t"; configure it here for the sake of
   pre-C99 libraries such as glibc 2.0 and Solaris 8.  */
#if PTRDIFF_MAX == INT_MAX
# define pD ""
#elif PTRDIFF_MAX == LONG_MAX
# define pD "l"
#elif PTRDIFF_MAX == LLONG_MAX
# define pD "ll"
#else
# define pD "t"
#endif

96
/* Extra internal type checking?  */
97 98 99

#ifdef ENABLE_CHECKING

100 101
extern void die (const char *, const char *, int) NO_RETURN;

102 103 104 105 106 107 108 109 110 111 112 113 114 115
/* The suppress_checking variable is initialized to 0 in alloc.c.  Set
   it to 1 using a debugger to temporarily disable aborting on
   detected internal inconsistencies or error conditions.

   Testing suppress_checking after the supplied condition ensures that
   the side effects produced by CHECK will be consistent, independent
   of whether ENABLE_CHECKING is defined, or whether the checks are
   suppressed at run time.

   In some cases, a good compiler may be able to optimize away the
   CHECK macro altogether, e.g., if XSTRING (x) uses CHECK to test
   STRINGP (x), but a particular use of XSTRING is invoked only after
   testing that STRINGP (x) is true, making the test redundant.  */

116 117
extern int suppress_checking EXTERNALLY_VISIBLE;

118
#define CHECK(check,msg) (((check) || suppress_checking		\
119
			   ? (void) 0				\
120
			   : die ((msg), __FILE__, __LINE__)),	\
121
			  0)
122
#else
123

124 125
/* Produce same side effects and result, but don't complain.  */
#define CHECK(check,msg) ((check),0)
126

127
#endif
128

129 130
/* Define an Emacs version of "assert", since some system ones are
   flaky.  */
131
#ifndef ENABLE_CHECKING
132
#define eassert(X) ((void) (0 && (X))) /* Check that X compiles.  */
133
#else /* ENABLE_CHECKING */
134
#if defined (__GNUC__) && __GNUC__ >= 2 && defined (__STDC__)
Juanma Barranquero's avatar
Juanma Barranquero committed
135
#define eassert(cond) CHECK (cond, "assertion failed: " #cond)
136
#else
Juanma Barranquero's avatar
Juanma Barranquero committed
137
#define eassert(cond) CHECK (cond, "assertion failed")
138
#endif
139
#endif /* ENABLE_CHECKING */
140

141 142 143
/* Use the configure flag --enable-use-lisp-union-type to make
   Lisp_Object use a union type instead of the default int.  The flag
   causes USE_LISP_UNION_TYPE to be defined.  */
Eli Zaretskii's avatar
Eli Zaretskii committed
144

145 146
/***** Select the tagging scheme.  *****/
/* There are basically two options that control the tagging scheme:
Eli Zaretskii's avatar
Eli Zaretskii committed
147 148
   - USE_LISP_UNION_TYPE says that Lisp_Object should be a union instead
     of an integer.
149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164
   - USE_LSB_TAG means that we can assume the least 3 bits of pointers are
     always 0, and we can thus use them to hold tag bits, without
     restricting our addressing space.

   If USE_LSB_TAG is not set, then we use the top 3 bits for tagging, thus
   restricting our possible address range.  Currently USE_LSB_TAG is not
   allowed together with a union.  This is not due to any fundamental
   technical (or political ;-) problem: nobody wrote the code to do it yet.

   USE_LSB_TAG not only requires the least 3 bits of pointers returned by
   malloc to be 0 but also needs to be able to impose a mult-of-8 alignment
   on the few static Lisp_Objects used: all the defsubr as well
   as the two special buffers buffer_defaults and buffer_local_symbols.  */

/* First, try and define DECL_ALIGN(type,var) which declares a static
   variable VAR of type TYPE with the added requirement that it be
165
   TYPEBITS-aligned.  */
166 167
#ifndef NO_DECL_ALIGN
# ifndef DECL_ALIGN
168
#  if HAVE_ATTRIBUTE_ALIGNED
169 170
#   define DECL_ALIGN(type, var) \
     type __attribute__ ((__aligned__ (1 << GCTYPEBITS))) var
171 172 173
#  elif defined(_MSC_VER)
#   define DECL_ALIGN(type, var) \
     type __declspec(align(1 << GCTYPEBITS)) var
174 175
#  else
     /* What directives do other compilers use?  */
176 177 178 179 180
#  endif
# endif
#endif

/* Let's USE_LSB_TAG on systems where we know malloc returns mult-of-8.  */
181 182
#if (defined GNU_MALLOC || defined DOUG_LEA_MALLOC || defined __GLIBC__ \
     || defined DARWIN_OS || defined __sun)
183 184
/* We also need to be able to specify mult-of-8 alignment on static vars.  */
# if defined DECL_ALIGN
185
#  define USE_LSB_TAG
186 187 188 189 190 191 192 193 194 195 196
# endif
#endif

/* If we cannot use 8-byte alignment, make DECL_ALIGN a no-op.  */
#ifndef DECL_ALIGN
# ifdef USE_LSB_TAG
#  error "USE_LSB_TAG used without defining DECL_ALIGN"
# endif
# define DECL_ALIGN(type, var) type var
#endif

197

198
/* Define the fundamental Lisp data structures.  */
Jim Blandy's avatar
Jim Blandy committed
199

200 201 202 203 204 205 206 207 208 209
/* If USE_2_TAGBITS_FOR_INTS is defined, then Lisp integers use
   2 tags, to give them one extra bit, thus extending their range from
   e.g -2^28..2^28-1 to -2^29..2^29-1.  */
#define USE_2_TAGS_FOR_INTS

/* Making it work for the union case is too much trouble.  */
#ifdef USE_LISP_UNION_TYPE
# undef USE_2_TAGS_FOR_INTS
#endif

210
/* This is the set of Lisp data types.  */
Jim Blandy's avatar
Jim Blandy committed
211

212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230
#if !defined USE_2_TAGS_FOR_INTS
# define LISP_INT_TAG Lisp_Int
# define case_Lisp_Int case Lisp_Int
# define LISP_STRING_TAG 4
# define LISP_INT_TAG_P(x) ((x) == Lisp_Int)
#else
# define LISP_INT_TAG Lisp_Int0
# define case_Lisp_Int case Lisp_Int0: case Lisp_Int1
# ifdef USE_LSB_TAG
#  define LISP_INT1_TAG 4
#  define LISP_STRING_TAG 1
#  define LISP_INT_TAG_P(x) (((x) & 3) == 0)
# else
#  define LISP_INT1_TAG 1
#  define LISP_STRING_TAG 4
#  define LISP_INT_TAG_P(x) (((x) & 6) == 0)
# endif
#endif

231 232 233 234 235 236 237 238 239
/* Stolen from GDB.  The only known compiler that doesn't support
   enums in bitfields is MSVC.  */
#ifdef _MSC_VER
#define ENUM_BF(TYPE) unsigned int
#else
#define ENUM_BF(TYPE) enum TYPE
#endif


Jim Blandy's avatar
Jim Blandy committed
240 241
enum Lisp_Type
  {
242
    /* Integer.  XINT (obj) is the integer value.  */
243 244 245 246 247 248
#ifdef USE_2_TAGS_FOR_INTS
    Lisp_Int0 = 0,
    Lisp_Int1 = LISP_INT1_TAG,
#else
    Lisp_Int = 0,
#endif
Jim Blandy's avatar
Jim Blandy committed
249

250
    /* Symbol.  XSYMBOL (object) points to a struct Lisp_Symbol.  */
251
    Lisp_Symbol = 2,
Jim Blandy's avatar
Jim Blandy committed
252

253 254
    /* Miscellaneous.  XMISC (object) points to a union Lisp_Misc,
       whose first member indicates the subtype.  */
255
    Lisp_Misc = 3,
Jim Blandy's avatar
Jim Blandy committed
256 257

    /* String.  XSTRING (object) points to a struct Lisp_String.
258
       The length of the string, and its contents, are stored therein.  */
259
    Lisp_String = LISP_STRING_TAG,
Jim Blandy's avatar
Jim Blandy committed
260

261
    /* Vector of Lisp objects, or something resembling it.
262
       XVECTOR (object) points to a struct Lisp_Vector, which contains
263 264
       the size and contents.  The size field also contains the type
       information, if it's not a real vector object.  */
265
    Lisp_Vectorlike = 5,
Jim Blandy's avatar
Jim Blandy committed
266

267
    /* Cons.  XCONS (object) points to a struct Lisp_Cons.  */
268
    Lisp_Cons = 6,
269

270
    Lisp_Float = 7,
Jim Blandy's avatar
Jim Blandy committed
271 272
  };

273
/* This is the set of data types that share a common structure.
274 275 276 277
   The first member of the structure is a type code from this set.
   The enum values are arbitrary, but we'll use large numbers to make it
   more likely that we'll spot the error if a random word in memory is
   mistakenly interpreted as a Lisp_Misc.  */
Karl Heuer's avatar
Karl Heuer committed
278 279
enum Lisp_Misc_Type
  {
280
    Lisp_Misc_Free = 0x5eab,
281
    Lisp_Misc_Marker,
282
    Lisp_Misc_Overlay,
283
    Lisp_Misc_Save_Value,
284 285 286 287 288
    /* Currently floats are not a misc type,
       but let's define this in case we want to change that.  */
    Lisp_Misc_Float,
    /* This is not a type code.  It is for range checking.  */
    Lisp_Misc_Limit
Karl Heuer's avatar
Karl Heuer committed
289 290
  };

291 292 293 294 295 296 297 298 299 300 301 302
/* These are the types of forwarding objects used in the value slot
   of symbols for special built-in variables whose value is stored in
   C variables.  */
enum Lisp_Fwd_Type
  {
    Lisp_Fwd_Int,		/* Fwd to a C `int' variable.  */
    Lisp_Fwd_Bool,		/* Fwd to a C boolean var.  */
    Lisp_Fwd_Obj,		/* Fwd to a C Lisp_Object variable.  */
    Lisp_Fwd_Buffer_Obj,	/* Fwd to a Lisp_Object field of buffers.  */
    Lisp_Fwd_Kboard_Obj,	/* Fwd to a Lisp_Object field of kboards.  */
  };

303 304 305 306
#ifndef GCTYPEBITS
#define GCTYPEBITS 3
#endif

307 308
/* These values are overridden by the m- file on some machines.  */
#ifndef VALBITS
Kenichi Handa's avatar
Kenichi Handa committed
309
#define VALBITS (BITS_PER_EMACS_INT - GCTYPEBITS)
310 311
#endif

Eli Zaretskii's avatar
Eli Zaretskii committed
312
#ifdef USE_LISP_UNION_TYPE
Jim Blandy's avatar
Jim Blandy committed
313

314
#ifndef WORDS_BIGENDIAN
Jim Blandy's avatar
Jim Blandy committed
315 316 317 318 319 320 321

/* Definition of Lisp_Object for little-endian machines.  */

typedef
union Lisp_Object
  {
    /* Used for comparing two Lisp_Objects;
322
       also, positive integers can be accessed fast this way.  */
323
    EMACS_INT i;
Jim Blandy's avatar
Jim Blandy committed
324 325 326

    struct
      {
Andreas Schwab's avatar
Andreas Schwab committed
327 328 329
	/* Use explict signed, the signedness of a bit-field of type
	   int is implementation defined.  */
	signed EMACS_INT val  : VALBITS;
330
	ENUM_BF (Lisp_Type) type : GCTYPEBITS;
Jim Blandy's avatar
Jim Blandy committed
331 332 333
      } s;
    struct
      {
334
	EMACS_UINT val : VALBITS;
335
	ENUM_BF (Lisp_Type) type : GCTYPEBITS;
Jim Blandy's avatar
Jim Blandy committed
336 337 338 339
      } u;
  }
Lisp_Object;

340
#else /* If WORDS_BIGENDIAN */
Jim Blandy's avatar
Jim Blandy committed
341 342 343 344 345

typedef
union Lisp_Object
  {
    /* Used for comparing two Lisp_Objects;
346
       also, positive integers can be accessed fast this way.  */
347
    EMACS_INT i;
Jim Blandy's avatar
Jim Blandy committed
348 349 350

    struct
      {
351
	ENUM_BF (Lisp_Type) type : GCTYPEBITS;
Andreas Schwab's avatar
Andreas Schwab committed
352 353 354
	/* Use explict signed, the signedness of a bit-field of type
	   int is implementation defined.  */
	signed EMACS_INT val  : VALBITS;
Jim Blandy's avatar
Jim Blandy committed
355 356 357
      } s;
    struct
      {
358
	ENUM_BF (Lisp_Type) type : GCTYPEBITS;
359
	EMACS_UINT val : VALBITS;
Jim Blandy's avatar
Jim Blandy committed
360 361 362 363
      } u;
  }
Lisp_Object;

364
#endif /* WORDS_BIGENDIAN */
Jim Blandy's avatar
Jim Blandy committed
365

366
#ifdef __GNUC__
Paul Eggert's avatar
Paul Eggert committed
367
static inline Lisp_Object
368 369 370 371 372
LISP_MAKE_RVALUE (Lisp_Object o)
{
    return o;
}
#else
373 374 375 376
/* This is more portable to pre-C99 non-GCC compilers, but for
   backwards compatibility GCC still accepts an old GNU extension
   which caused this to only generate a warning.  */
#define LISP_MAKE_RVALUE(o) (0 ? (o) : (o))
377 378
#endif

Eli Zaretskii's avatar
Eli Zaretskii committed
379
#else /* USE_LISP_UNION_TYPE */
Jim Blandy's avatar
Jim Blandy committed
380

381
/* If union type is not wanted, define Lisp_Object as just a number.  */
Jim Blandy's avatar
Jim Blandy committed
382

383
typedef EMACS_INT Lisp_Object;
384
#define LISP_MAKE_RVALUE(o) (0+(o))
Eli Zaretskii's avatar
Eli Zaretskii committed
385
#endif /* USE_LISP_UNION_TYPE */
Jim Blandy's avatar
Jim Blandy committed
386

387 388
/* In the size word of a vector, this bit means the vector has been marked.
   (Shift -1 left, not 1, to avoid provoking overflow diagnostics.)  */
389

390
#define ARRAY_MARK_FLAG ((EMACS_INT) -1 << (BITS_PER_EMACS_INT - 1))
391

392 393
/* In the size word of a struct Lisp_Vector, this bit means it's really
   some other vector-like object.  */
394
#define PSEUDOVECTOR_FLAG ((EMACS_INT) 1 << (BITS_PER_EMACS_INT - 2))
395

396
/* In a pseudovector, the size field actually contains a word with one
397
   PSEUDOVECTOR_FLAG bit set, and exactly one of the following bits to
398
   indicate the actual type.
399 400 401 402
   We use a bitset, even tho only one of the bits can be set at any
   particular time just so as to be able to use micro-optimizations such as
   testing membership of a particular subset of pseudovectors in Fequal.
   It is not crucial, but there are plenty of bits here, so why not do it?  */
403 404 405 406 407 408 409 410 411
enum pvec_type
{
  PVEC_NORMAL_VECTOR = 0,
  PVEC_PROCESS = 0x200,
  PVEC_FRAME = 0x400,
  PVEC_COMPILED = 0x800,
  PVEC_WINDOW = 0x1000,
  PVEC_WINDOW_CONFIGURATION = 0x2000,
  PVEC_SUBR = 0x4000,
412 413 414
  PVEC_CHAR_TABLE = 0x8000,
  PVEC_BOOL_VECTOR = 0x10000,
  PVEC_BUFFER = 0x20000,
Gerd Moellmann's avatar
Gerd Moellmann committed
415
  PVEC_HASH_TABLE = 0x40000,
416
  PVEC_TERMINAL = 0x80000,
Miles Bader's avatar
Miles Bader committed
417
  PVEC_SUB_CHAR_TABLE = 0x100000,
418 419 420
  PVEC_FONT = 0x200000,
  PVEC_OTHER = 0x400000,
  PVEC_TYPE_MASK = 0x7ffe00
421

Gerd Moellmann's avatar
Gerd Moellmann committed
422 423 424
#if 0 /* This is used to make the value of PSEUDOVECTOR_FLAG available to
	 GDB.  It doesn't work on OS Alpha.  Moved to a variable in
	 emacs.c.  */
425
  PVEC_FLAG = PSEUDOVECTOR_FLAG
Gerd Moellmann's avatar
Gerd Moellmann committed
426
#endif
427
};
428

429 430 431 432 433
/* For convenience, we also store the number of elements in these bits.
   Note that this size is not necessarily the memory-footprint size, but
   only the number of Lisp_Object fields (that need to be traced by the GC).
   The distinction is used e.g. by Lisp_Process which places extra
   non-Lisp_Object fields at the end of the structure.  */
434
#define PSEUDOVECTOR_SIZE_MASK 0x1ff
435 436 437 438

/* Number of bits to put in each character in the internal representation
   of bool vectors.  This should not vary across implementations.  */
#define BOOL_VECTOR_BITS_PER_CHAR 8
Jim Blandy's avatar
Jim Blandy committed
439 440 441

/* These macros extract various sorts of values from a Lisp_Object.
 For example, if tem is a Lisp_Object whose type is Lisp_Cons,
442
 XCONS (tem) is the struct Lisp_Cons * pointing to the memory for that cons.  */
Jim Blandy's avatar
Jim Blandy committed
443

Eli Zaretskii's avatar
Eli Zaretskii committed
444
#ifndef USE_LISP_UNION_TYPE
Jim Blandy's avatar
Jim Blandy committed
445

446 447 448
/* Return a perfect hash of the Lisp_Object representation.  */
#define XHASH(a) (a)

Kenichi Handa's avatar
Kenichi Handa committed
449 450 451
#ifdef USE_LSB_TAG

#define TYPEMASK ((((EMACS_INT) 1) << GCTYPEBITS) - 1)
452
#define XTYPE(a) ((enum Lisp_Type) ((a) & TYPEMASK))
453 454 455 456 457 458 459 460 461
#ifdef USE_2_TAGS_FOR_INTS
# define XINT(a) (((EMACS_INT) (a)) >> (GCTYPEBITS - 1))
# define XUINT(a) (((EMACS_UINT) (a)) >> (GCTYPEBITS - 1))
# define make_number(N) (((EMACS_INT) (N)) << (GCTYPEBITS - 1))
#else
# define XINT(a) (((EMACS_INT) (a)) >> GCTYPEBITS)
# define XUINT(a) (((EMACS_UINT) (a)) >> GCTYPEBITS)
# define make_number(N) (((EMACS_INT) (N)) << GCTYPEBITS)
#endif
462
#define XSET(var, type, ptr)						\
463 464
    (eassert (XTYPE ((intptr_t) (ptr)) == 0), /* Check alignment.  */ \
     (var) = (type) | (intptr_t) (ptr))
Kenichi Handa's avatar
Kenichi Handa committed
465

466
#define XPNTR(a) ((intptr_t) ((a) & ~TYPEMASK))
Kenichi Handa's avatar
Kenichi Handa committed
467 468 469 470 471

#else  /* not USE_LSB_TAG */

#define VALMASK ((((EMACS_INT) 1) << VALBITS) - 1)

Jim Blandy's avatar
Jim Blandy committed
472 473
/* One need to override this if there must be high bits set in data space
   (doing the result of the below & ((1 << (GCTYPE + 1)) - 1) would work
474
    on all machines, but would penalize machines which don't need it)
Jim Blandy's avatar
Jim Blandy committed
475
 */
Kenichi Handa's avatar
Kenichi Handa committed
476
#define XTYPE(a) ((enum Lisp_Type) (((EMACS_UINT) (a)) >> VALBITS))
Jim Blandy's avatar
Jim Blandy committed
477

Karl Heuer's avatar
Karl Heuer committed
478 479
/* For integers known to be positive, XFASTINT provides fast retrieval
   and XSETFASTINT provides fast storage.  This takes advantage of the
Kenichi Handa's avatar
Kenichi Handa committed
480
   fact that Lisp_Int is 0.  */
481
#define XFASTINT(a) ((a) + 0)
Karl Heuer's avatar
Karl Heuer committed
482
#define XSETFASTINT(a, b) ((a) = (b))
Jim Blandy's avatar
Jim Blandy committed
483

484
/* Extract the value of a Lisp_Object as a (un)signed integer.  */
Jim Blandy's avatar
Jim Blandy committed
485

486 487 488 489 490 491
#ifdef USE_2_TAGS_FOR_INTS
# define XINT(a) ((((EMACS_INT) (a)) << (GCTYPEBITS - 1)) >> (GCTYPEBITS - 1))
# define XUINT(a) ((EMACS_UINT) ((a) & (1 + (VALMASK << 1))))
# define make_number(N) ((((EMACS_INT) (N)) & (1 + (VALMASK << 1))))
#else
# define XINT(a) ((((EMACS_INT) (a)) << (BITS_PER_EMACS_INT - VALBITS))	\
Kenichi Handa's avatar
Kenichi Handa committed
492
		 >> (BITS_PER_EMACS_INT - VALBITS))
493 494 495
# define XUINT(a) ((EMACS_UINT) ((a) & VALMASK))
# define make_number(N)		\
  ((((EMACS_INT) (N)) & VALMASK) | ((EMACS_INT) Lisp_Int) << VALBITS)
Jim Blandy's avatar
Jim Blandy committed
496 497
#endif

498 499
#define XSET(var, type, ptr)				  \
   ((var) = ((EMACS_INT) ((EMACS_UINT) (type) << VALBITS) \
500
	     + ((intptr_t) (ptr) & VALMASK)))
501

502 503 504
#ifdef DATA_SEG_BITS
/* DATA_SEG_BITS forces extra bits to be or'd in with any pointers
   which were stored in a Lisp_Object */
505
#define XPNTR(a) ((uintptr_t) (((a) & VALMASK)) | DATA_SEG_BITS))
506
#else
507
#define XPNTR(a) ((uintptr_t) ((a) & VALMASK))
508
#endif
509

Kenichi Handa's avatar
Kenichi Handa committed
510
#endif /* not USE_LSB_TAG */
Jim Blandy's avatar
Jim Blandy committed
511

Eli Zaretskii's avatar
Eli Zaretskii committed
512
#else /* USE_LISP_UNION_TYPE */
Jim Blandy's avatar
Jim Blandy committed
513

514 515 516 517
#ifdef USE_2_TAGS_FOR_INTS
# error "USE_2_TAGS_FOR_INTS is not supported with USE_LISP_UNION_TYPE"
#endif

518
#define XHASH(a) ((a).i)
Jim Blandy's avatar
Jim Blandy committed
519
#define XTYPE(a) ((enum Lisp_Type) (a).u.type)
520 521
#define XINT(a) ((EMACS_INT) (a).s.val)
#define XUINT(a) ((EMACS_UINT) (a).u.val)
Jim Blandy's avatar
Jim Blandy committed
522

523 524 525
#ifdef USE_LSB_TAG

# define XSET(var, vartype, ptr) \
526 527
  (eassert ((((uintptr_t) (ptr)) & ((1 << GCTYPEBITS) - 1)) == 0),	\
   (var).u.val = ((uintptr_t) (ptr)) >> GCTYPEBITS,			\
528 529
   (var).u.type = ((char) (vartype)))

530 531 532
/* Some versions of gcc seem to consider the bitfield width when issuing
   the "cast to pointer from integer of different size" warning, so the
   cast is here to widen the value back to its natural size.  */
533
# define XPNTR(v) ((intptr_t) (v).s.val << GCTYPEBITS)
534 535 536 537 538 539 540 541 542 543

#else  /* !USE_LSB_TAG */

/* For integers known to be positive, XFASTINT provides fast retrieval
   and XSETFASTINT provides fast storage.  This takes advantage of the
   fact that Lisp_Int is 0.  */
# define XFASTINT(a) ((a).i + 0)
# define XSETFASTINT(a, b) ((a).i = (b))

# define XSET(var, vartype, ptr) \
544
   (((var).s.val = ((intptr_t) (ptr))), ((var).s.type = ((char) (vartype))))
Jim Blandy's avatar
Jim Blandy committed
545

546 547 548
#ifdef DATA_SEG_BITS
/* DATA_SEG_BITS forces extra bits to be or'd in with any pointers
   which were stored in a Lisp_Object */
549
#define XPNTR(a) ((intptr_t) (XUINT (a) | DATA_SEG_BITS))
550
#else
551
#define XPNTR(a) ((intptr_t) XUINT (a))
552 553
#endif

554 555
#endif	/* !USE_LSB_TAG */

556 557 558 559
#if __GNUC__ >= 2 && defined (__OPTIMIZE__)
#define make_number(N) \
  (__extension__ ({ Lisp_Object _l; _l.s.val = (N); _l.s.type = Lisp_Int; _l; }))
#else
Jan D's avatar
Jan D committed
560
extern Lisp_Object make_number (EMACS_INT);
561
#endif
562

Eli Zaretskii's avatar
Eli Zaretskii committed
563
#endif /* USE_LISP_UNION_TYPE */
Kenichi Handa's avatar
Kenichi Handa committed
564

565 566 567 568 569 570 571 572
/* For integers known to be positive, XFASTINT sometimes provides
   faster retrieval and XSETFASTINT provides faster storage.
   If not, fallback on the non-accelerated path.  */
#ifndef XFASTINT
# define XFASTINT(a) (XINT (a))
# define XSETFASTINT(a, b) (XSETINT (a, b))
#endif

573 574
#define EQ(x, y) (XHASH (x) == XHASH (y))

575
/* Number of bits in a fixnum, including the sign bit.  */
576
#ifdef USE_2_TAGS_FOR_INTS
577
# define FIXNUM_BITS (VALBITS + 1)
578
#else
579
# define FIXNUM_BITS VALBITS
580
#endif
581

582 583 584 585 586 587 588 589
/* Mask indicating the significant bits of a fixnum.  */
#define INTMASK (((EMACS_INT) 1 << FIXNUM_BITS) - 1)

/* Largest and smallest representable fixnum values.  These are the C
   values.  */
#define MOST_POSITIVE_FIXNUM (INTMASK / 2)
#define MOST_NEGATIVE_FIXNUM (-1 - MOST_POSITIVE_FIXNUM)

590 591
/* Value is non-zero if I doesn't fit into a Lisp fixnum.  It is
   written this way so that it also works if I is of unsigned
592
   type or if I is a NaN.  */
593 594

#define FIXNUM_OVERFLOW_P(i) \
595
  (! ((0 <= (i) || MOST_NEGATIVE_FIXNUM <= (i)) && (i) <= MOST_POSITIVE_FIXNUM))
596

597
/* Extract a value or address from a Lisp_Object.  */
Jim Blandy's avatar
Jim Blandy committed
598

Juanma Barranquero's avatar
Juanma Barranquero committed
599 600 601 602 603
#define XCONS(a) (eassert (CONSP (a)), (struct Lisp_Cons *) XPNTR (a))
#define XVECTOR(a) (eassert (VECTORLIKEP (a)), (struct Lisp_Vector *) XPNTR (a))
#define XSTRING(a) (eassert (STRINGP (a)), (struct Lisp_String *) XPNTR (a))
#define XSYMBOL(a) (eassert (SYMBOLP (a)), (struct Lisp_Symbol *) XPNTR (a))
#define XFLOAT(a) (eassert (FLOATP (a)), (struct Lisp_Float *) XPNTR (a))
604 605

/* Misc types.  */
606

Juanma Barranquero's avatar
Juanma Barranquero committed
607 608
#define XMISC(a)   ((union Lisp_Misc *) XPNTR (a))
#define XMISCANY(a)	(eassert (MISCP (a)), &(XMISC (a)->u_any))
609
#define XMISCTYPE(a)   (XMISCANY (a)->type)
Juanma Barranquero's avatar
Juanma Barranquero committed
610 611 612
#define XMARKER(a)	(eassert (MARKERP (a)), &(XMISC (a)->u_marker))
#define XOVERLAY(a)	(eassert (OVERLAYP (a)), &(XMISC (a)->u_overlay))
#define XSAVE_VALUE(a)	(eassert (SAVE_VALUEP (a)), &(XMISC (a)->u_save_value))
613 614 615 616 617 618 619

/* Forwarding object types.  */

#define XFWDTYPE(a)     (a->u_intfwd.type)
#define XINTFWD(a)	(eassert (INTFWDP (a)), &((a)->u_intfwd))
#define XBOOLFWD(a)	(eassert (BOOLFWDP (a)), &((a)->u_boolfwd))
#define XOBJFWD(a)	(eassert (OBJFWDP (a)), &((a)->u_objfwd))
620
#define XBUFFER_OBJFWD(a) \
621
  (eassert (BUFFER_OBJFWDP (a)), &((a)->u_buffer_objfwd))
622
#define XKBOARD_OBJFWD(a) \
623
  (eassert (KBOARD_OBJFWDP (a)), &((a)->u_kboard_objfwd))
Jim Blandy's avatar
Jim Blandy committed
624

625
/* Pseudovector types.  */
626

Juanma Barranquero's avatar
Juanma Barranquero committed
627 628 629 630 631 632 633 634
#define XPROCESS(a) (eassert (PROCESSP (a)), (struct Lisp_Process *) XPNTR (a))
#define XWINDOW(a) (eassert (WINDOWP (a)), (struct window *) XPNTR (a))
#define XTERMINAL(a) (eassert (TERMINALP (a)), (struct terminal *) XPNTR (a))
#define XSUBR(a) (eassert (SUBRP (a)), (struct Lisp_Subr *) XPNTR (a))
#define XBUFFER(a) (eassert (BUFFERP (a)), (struct buffer *) XPNTR (a))
#define XCHAR_TABLE(a) (eassert (CHAR_TABLE_P (a)), (struct Lisp_Char_Table *) XPNTR (a))
#define XSUB_CHAR_TABLE(a) (eassert (SUB_CHAR_TABLE_P (a)), (struct Lisp_Sub_Char_Table *) XPNTR (a))
#define XBOOL_VECTOR(a) (eassert (BOOL_VECTOR_P (a)), (struct Lisp_Bool_Vector *) XPNTR (a))
635 636

/* Construct a Lisp_Object from a value or address.  */
637

638
#define XSETINT(a, b) (a) = make_number (b)
639
#define XSETCONS(a, b) XSET (a, Lisp_Cons, b)
640
#define XSETVECTOR(a, b) XSET (a, Lisp_Vectorlike, b)
641 642 643
#define XSETSTRING(a, b) XSET (a, Lisp_String, b)
#define XSETSYMBOL(a, b) XSET (a, Lisp_Symbol, b)
#define XSETFLOAT(a, b) XSET (a, Lisp_Float, b)
644 645

/* Misc types.  */
646

647
#define XSETMISC(a, b) XSET (a, Lisp_Misc, b)
Richard M. Stallman's avatar
Richard M. Stallman committed
648
#define XSETMARKER(a, b) (XSETMISC (a, b), XMISCTYPE (a) = Lisp_Misc_Marker)
649 650

/* Pseudovector types.  */
651

Juanma Barranquero's avatar
Juanma Barranquero committed
652
#define XSETPVECTYPE(v, code) XSETTYPED_PVECTYPE (v, header.size, code)
653 654 655 656
#define XSETTYPED_PVECTYPE(v, size_member, code) \
  ((v)->size_member |= PSEUDOVECTOR_FLAG | (code))
#define XSETPVECTYPESIZE(v, code, sizeval) \
  ((v)->header.size = PSEUDOVECTOR_FLAG | (code) | (sizeval))
657 658

/* The cast to struct vectorlike_header * avoids aliasing issues.  */
659
#define XSETPSEUDOVECTOR(a, b, code) \
660 661 662
  XSETTYPED_PSEUDOVECTOR(a, b,       \
			 ((struct vectorlike_header *) XPNTR (a))->size, \
			 code)
663
#define XSETTYPED_PSEUDOVECTOR(a, b, size, code)			\
664
  (XSETVECTOR (a, b),							\
665
   eassert ((size & (PSEUDOVECTOR_FLAG | PVEC_TYPE_MASK))		\
666
	    == (PSEUDOVECTOR_FLAG | (code))))
667

668 669 670 671
#define XSETWINDOW_CONFIGURATION(a, b) \
  (XSETPSEUDOVECTOR (a, b, PVEC_WINDOW_CONFIGURATION))
#define XSETPROCESS(a, b) (XSETPSEUDOVECTOR (a, b, PVEC_PROCESS))
#define XSETWINDOW(a, b) (XSETPSEUDOVECTOR (a, b, PVEC_WINDOW))
672
#define XSETTERMINAL(a, b) (XSETPSEUDOVECTOR (a, b, PVEC_TERMINAL))
673
/* XSETSUBR is special since Lisp_Subr lacks struct vectorlike_header.  */
674 675
#define XSETSUBR(a, b) \
  XSETTYPED_PSEUDOVECTOR (a, b, XSUBR (a)->size, PVEC_SUBR)
676
#define XSETCOMPILED(a, b) (XSETPSEUDOVECTOR (a, b, PVEC_COMPILED))
677
#define XSETBUFFER(a, b) (XSETPSEUDOVECTOR (a, b, PVEC_BUFFER))
678 679
#define XSETCHAR_TABLE(a, b) (XSETPSEUDOVECTOR (a, b, PVEC_CHAR_TABLE))
#define XSETBOOL_VECTOR(a, b) (XSETPSEUDOVECTOR (a, b, PVEC_BOOL_VECTOR))
680
#define XSETSUB_CHAR_TABLE(a, b) (XSETPSEUDOVECTOR (a, b, PVEC_SUB_CHAR_TABLE))
681 682 683

/* Convenience macros for dealing with Lisp arrays.  */

684
#define AREF(ARRAY, IDX)	XVECTOR ((ARRAY))->contents[IDX]
685
#define ASIZE(ARRAY)		XVECTOR ((ARRAY))->header.size
686
/* The IDX==IDX tries to detect when the macro argument is side-effecting.  */
Stefan Monnier's avatar
Stefan Monnier committed
687 688 689
#define ASET(ARRAY, IDX, VAL)	\
  (eassert ((IDX) == (IDX)),				\
   eassert ((IDX) >= 0 && (IDX) < ASIZE (ARRAY)),	\
690
   AREF ((ARRAY), (IDX)) = (VAL))
691

692 693
/* Convenience macros for dealing with Lisp strings.  */

Ken Raeburn's avatar
Ken Raeburn committed
694
#define SDATA(string)		(XSTRING (string)->data + 0)
695 696
#define SREF(string, index)	(SDATA (string)[index] + 0)
#define SSET(string, index, new) (SDATA (string)[index] = (new))
697 698 699
#define SCHARS(string)		(XSTRING (string)->size + 0)
#define SBYTES(string)		(STRING_BYTES (XSTRING (string)) + 0)

700 701 702
/* Avoid "differ in sign" warnings.  */
#define SSDATA(x)  ((char *) SDATA (x))

703 704
#define STRING_SET_CHARS(string, newsize) \
    (XSTRING (string)->size = (newsize))
705

Ken Raeburn's avatar
Ken Raeburn committed
706
#define STRING_COPYIN(string, index, new, count) \
707
    memcpy (SDATA (string) + index, new, count)
Ken Raeburn's avatar
Ken Raeburn committed
708

709 710 711 712 713 714
/* Type checking.  */

#define CHECK_TYPE(ok, Qxxxp, x) \
  do { if (!(ok)) wrong_type_argument (Qxxxp, (x)); } while (0)


Jim Blandy's avatar
Jim Blandy committed
715

716
/* See the macros in intervals.h.  */
717 718 719 720

typedef struct interval *INTERVAL;

/* Complain if object is not string or buffer type */
721
#define CHECK_STRING_OR_BUFFER(x) \
722 723
  CHECK_TYPE (STRINGP (x) || BUFFERP (x), Qbuffer_or_string_p, x)

724

Jim Blandy's avatar
Jim Blandy committed
725 726 727 728
/* In a cons, the markbit of the car is the gc mark bit */

struct Lisp_Cons
  {
729 730 731
    /* Please do not use the names of these elements in code other
       than the core lisp implementation.  Use XCAR and XCDR below.  */
#ifdef HIDE_LISP_IMPLEMENTATION
732 733 734 735 736 737
    Lisp_Object car_;
    union
    {
      Lisp_Object cdr_;
      struct Lisp_Cons *chain;
    } u;
738
#else
739 740 741 742 743 744
    Lisp_Object car;
    union
    {
      Lisp_Object cdr;
      struct Lisp_Cons *chain;
    } u;
745
#endif
Jim Blandy's avatar
Jim Blandy committed
746 747
  };

748
/* Take the car or cdr of something known to be a cons cell.  */
749 750 751 752 753 754
/* The _AS_LVALUE macros shouldn't be used outside of the minimal set
   of code that has to know what a cons cell looks like.  Other code not
   part of the basic lisp implementation should assume that the car and cdr
   fields are not accessible as lvalues.  (What if we want to switch to
   a copying collector someday?  Cached cons cell field addresses may be
   invalidated at arbitrary points.)  */
755
#ifdef HIDE_LISP_IMPLEMENTATION
756
#define XCAR_AS_LVALUE(c) (XCONS ((c))->car_)
757
#define XCDR_AS_LVALUE(c) (XCONS ((c))->u.cdr_)
758
#else
759
#define XCAR_AS_LVALUE(c) (XCONS ((c))->car)
760
#define XCDR_AS_LVALUE(c) (XCONS ((c))->u.cdr)
761
#endif
762

763
/* Use these from normal code.  */
Juanma Barranquero's avatar
Juanma Barranquero committed
764 765
#define XCAR(c)	LISP_MAKE_RVALUE (XCAR_AS_LVALUE (c))
#define XCDR(c) LISP_MAKE_RVALUE (XCDR_AS_LVALUE (c))
766 767 768 769 770 771 772

/* Use these to set the fields of a cons cell.

   Note that both arguments may refer to the same object, so 'n'
   should not be read after 'c' is first modified.  Also, neither
   argument should be evaluated more than once; side effects are
   especially common in the second argument.  */
Juanma Barranquero's avatar
Juanma Barranquero committed
773 774
#define XSETCAR(c,n) (XCAR_AS_LVALUE (c) = (n))
#define XSETCDR(c,n) (XCDR_AS_LVALUE (c) = (n))
775

776 777 778 779
/* Take the car or cdr of something whose type is not known.  */
#define CAR(c)					\
 (CONSP ((c)) ? XCAR ((c))			\
  : NILP ((c)) ? Qnil				\
780
  : wrong_type_argument (Qlistp, (c)))
781 782 783 784

#define CDR(c)					\
 (CONSP ((c)) ? XCDR ((c))			\
  : NILP ((c)) ? Qnil				\
785
  : wrong_type_argument (Qlistp, (c)))
786

787 788 789 790 791 792 793
/* Take the car or cdr of something whose type is not known.  */
#define CAR_SAFE(c)				\
  (CONSP ((c)) ? XCAR ((c)) : Qnil)

#define CDR_SAFE(c)				\
  (CONSP ((c)) ? XCDR ((c)) : Qnil)

Kenichi Handa's avatar
Kenichi Handa committed
794 795 796 797 798
/* Nonzero if STR is a multibyte string.  */
#define STRING_MULTIBYTE(STR)  \
  (XSTRING (STR)->size_byte >= 0)

/* Return the length in bytes of STR.  */
799 800 801 802

#ifdef GC_CHECK_STRING_BYTES

struct Lisp_String;
803
extern EMACS_INT string_bytes (struct Lisp_String *);
804 805 806 807
#define STRING_BYTES(S) string_bytes ((S))

#else /* not GC_CHECK_STRING_BYTES */

Kenichi Handa's avatar
Kenichi Handa committed
808 809 810
#define STRING_BYTES(STR)  \
  ((STR)->size_byte < 0 ? (STR)->size : (STR)->size_byte)

811 812
#endif /* not GC_CHECK_STRING_BYTES */

813 814 815 816 817 818 819 820 821 822 823 824 825
/* An upper bound on the number of bytes in a Lisp string, not
   counting the terminating null.  This a tight enough bound to
   prevent integer overflow errors that would otherwise occur during
   string size calculations.  A string cannot contain more bytes than
   a fixnum can represent, nor can it be so long that C pointer
   arithmetic stops working on the string plus its terminating null.
   Although the actual size limit (see STRING_BYTES_MAX in alloc.c)
   may be a bit smaller than STRING_BYTES_BOUND, calculating it here
   would expose alloc.c internal details that we'd rather keep
   private.  The cast to ptrdiff_t ensures that STRING_BYTES_BOUND is
   signed.  */
#define STRING_BYTES_BOUND  \
  min (MOST_POSITIVE_FIXNUM, (ptrdiff_t) min (SIZE_MAX, PTRDIFF_MAX) - 1)
826

827
/* Mark STR as a unibyte string.  */
828 829 830 831
#define STRING_SET_UNIBYTE(STR)  \
  do { if (EQ (STR, empty_multibyte_string))  \
      (STR) = empty_unibyte_string;  \
    else XSTRING (STR)->size_byte = -1; } while (0)
832

833 834 835 836 837 838 839
/* Mark STR as a multibyte string.  Assure that STR contains only
   ASCII characters in advance.  */
#define STRING_SET_MULTIBYTE(STR)  \
  do { if (EQ (STR, empty_unibyte_string))  \
      (STR) = empty_multibyte_string;  \
    else XSTRING (STR)->size_byte = XSTRING (STR)->size; } while (0)

840
/* Get text properties.  */
841 842 843 844
#define STRING_INTERVALS(STR)  (XSTRING (STR)->intervals + 0)

/* Set text properties.  */
#define STRING_SET_INTERVALS(STR, INT) (XSTRING (STR)->intervals = (INT))
Kenichi Handa's avatar
Kenichi Handa committed
845

Jim Blandy's avatar
Jim Blandy committed
846 847 848 849
/* In a string or vector, the sign bit of the `size' is the gc mark bit */

struct Lisp_String
  {
850
    EMACS_INT size;
851
    EMACS_INT size_byte;
852
    INTERVAL intervals;		/* text properties in this string */
853
    unsigned char *data;
Jim Blandy's avatar
Jim Blandy committed
854 855
  };

856 857 858 859 860 861 862
/* Header of vector-like objects.  This documents the layout constraints on
   vectors and pseudovectors other than struct Lisp_Subr.  It also prevents
   compilers from being fooled by Emacs's type punning: the XSETPSEUDOVECTOR
   and PSEUDOVECTORP macros cast their pointers to struct vectorlike_header *,
   because when two such pointers potentially alias, a compiler won't
   incorrectly reorder loads and stores to their size fields.  See
   <http://debbugs.gnu.org/cgi/bugreport.cgi?bug=8546>.  */
863
struct vectorlike_header
Jim Blandy's avatar
Jim Blandy committed
864
  {
865
    EMACS_INT size;
866 867 868 869 870

    /* Pointer to the next vector-like object.  It is generally a buffer or a
       Lisp_Vector alias, so for convenience it is a union instead of a
       pointer: this way, one can write P->next.vector instead of ((struct
       Lisp_Vector *) P->next).  */
871 872 873 874 875 876 877 878
    union {
      struct buffer *buffer;
      struct Lisp_Vector *vector;
    } next;
  };

struct Lisp_Vector
  {
879
    struct vectorlike_header header;
Jim Blandy's avatar
Jim Blandy committed
880 881 882
    Lisp_Object contents[1];
  };

Karl Heuer's avatar
Karl Heuer committed
883
/* If a struct is made to look like a vector, this macro returns the length
884
   of the shortest vector that would hold that struct.  */
Andreas Schwab's avatar
Andreas Schwab committed
885
#define VECSIZE(type) ((sizeof (type)					  \
886
			- offsetof (struct Lisp_Vector, contents[0])      \
Juanma Barranquero's avatar
Juanma Barranquero committed
887
                        + sizeof (Lisp_Object) - 1) /* round up */	  \
Karl Heuer's avatar
Karl Heuer committed
888 889
		       / sizeof (Lisp_Object))

890 891 892 893
/* Like VECSIZE, but used when the pseudo-vector has non-Lisp_Object fields
   at the end and we need to compute the number of Lisp_Object fields (the
   ones that the GC needs to trace).  */
#define PSEUDOVECSIZE(type, nonlispfield) \
Juanma Barranquero's avatar
Juanma Barranquero committed
894
  ((offsetof (type, nonlispfield) - offsetof (struct Lisp_Vector, contents[0])) \
895 896
   / sizeof (Lisp_Object))

897
/* A char-table is a kind of vectorlike, with contents are like a
898
   vector but with a few other slots.  For some purposes, it makes
899
   sense to handle a char-table with type struct Lisp_Vector.  An
900 901
   element of a char table can be any Lisp objects, but if it is a sub
   char-table, we treat it a table that contains information of a
902 903 904 905
   specific range of characters.  A sub char-table has the same
   structure as a vector.  A sub char table appears only in an element
   of a char-table, and there's no way to access it directly from
   Emacs Lisp program.  */
906

907 908 909
/* This is the number of slots that every char table must have.  This
   counts the ordinary slots and the top, defalt, parent, and purpose
   slots.  */
910
#define CHAR_TABLE_STANDARD_SLOTS (VECSIZE (struct Lisp_Char_Table) - 1)
911 912 913 914

/* Return the number of "extra" slots in the char table CT.  */

#define CHAR_TABLE_EXTRA_SLOTS(CT)	\
915
  (((CT)->header.size & PSEUDOVECTOR_SIZE_MASK) - CHAR_TABLE_STANDARD_SLOTS)
916

917 918 919 920 921 922 923 924 925 926 927 928 929
#ifdef __GNUC__

#define CHAR_TABLE_REF_ASCII(CT, IDX)					\
  ({struct Lisp_Char_Table *_tbl = NULL;				\
    Lisp_Object _val;							\
    do {								\
      _tbl = _tbl ? XCHAR_TABLE (_tbl->parent) : XCHAR_TABLE (CT);	\
      _val = (! SUB_CHAR_TABLE_P (_tbl->ascii) ? _tbl->ascii		\
	      : XSUB_CHAR_TABLE (_tbl->ascii)->contents[IDX]);		\
      if (NILP (_val))							\
	_val = _tbl->defalt;						\
    } while (NILP (_val) && ! NILP (_tbl->parent));			\
    _val; })
930

931 932 933 934 935 936 937 938 939 940 941 942 943
#else  /* not __GNUC__ */

#define CHAR_TABLE_REF_ASCII(CT, IDX)					  \
  (! NILP (XCHAR_TABLE (CT)->ascii)					  \
   ? (! SUB_CHAR_TABLE_P (XCHAR_TABLE (CT)->ascii)			  \
      ? XCHAR_TABLE (CT)->ascii						  \
      : ! NILP (XSUB_CHAR_TABLE (XCHAR_TABLE (CT)->ascii)->contents[IDX]) \
      ? XSUB_CHAR_TABLE (XCHAR_TABLE (CT)->ascii)->contents[IDX]	  \
      : char_table_ref ((CT), (IDX)))					  \
   :  char_table_ref ((CT), (IDX)))

#endif	/* not __GNUC__ */

944 945 946 947 948 949 950 951 952 953
/* Compute A OP B, using the unsigned comparison operator OP.  A and B
   should be integer expressions.  This is not the same as
   mathemeatical comparison; for example, UNSIGNED_CMP (0, <, -1)
   returns 1.  For efficiency, prefer plain unsigned comparison if A
   and B's sizes both fit (after integer promotion).  */
#define UNSIGNED_CMP(a, op, b)						\
  (max (sizeof ((a) + 0), sizeof ((b) + 0)) <= sizeof (unsigned)	\
   ? ((a) + (unsigned) 0) op ((b) + (unsigned) 0)			\
   : ((a) + (uintmax_t) 0) op ((b) + (uintmax_t) 0))

954
/* Nonzero iff C is an ASCII character.  */
955
#define ASCII_CHAR_P(c) UNSIGNED_CMP (c, <, 0x80)
956

957
/* Almost equivalent to Faref (CT, IDX) with optimization for ASCII
958
   characters.  Do not check validity of CT.  */
959 960
#define CHAR_TABLE_REF(CT, IDX)					\
  (ASCII_CHAR_P (IDX) ? CHAR_TABLE_REF_ASCII ((CT), (IDX))	\
961
   : char_table_ref ((CT), (IDX)))
962

Kenichi Handa's avatar
Kenichi Handa committed
963 964
/* Almost equivalent to Faref (CT, IDX).  However, if the result is
   not a character, return IDX.
965 966 967

   For these characters, do not check validity of CT
   and do not follow parent.  */
968 969
#define CHAR_TABLE_TRANSLATE(CT, IDX)	\
  char_table_translate (CT, IDX)
970

971
/* Equivalent to Faset (CT, IDX, VAL) with optimization for ASCII and
Dave Love's avatar
Dave Love committed
972
   8-bit European characters.  Do not check validity of CT.  */
973
#define CHAR_TABLE_SET(CT, IDX, VAL)					\
974
  (ASCII_CHAR_P (IDX) && SUB_CHAR_TABLE_P (XCHAR_TABLE (CT)->ascii)	\
975 976 977 978 979 980 981 982 983 984 985
   ? XSUB_CHAR_TABLE (XCHAR_TABLE (CT)->ascii)->contents[IDX] = VAL	\
   : char_table_set (CT, IDX, VAL))

#define CHARTAB_SIZE_BITS_0 6
#define CHARTAB_SIZE_BITS_1 4
#define CHARTAB_SIZE_BITS_2 5
#define CHARTAB_SIZE_BITS_3 7

extern const int chartab_size[4];

struct Lisp_Sub_Char_Table;
986

987 988
struct Lisp_Char_Table
  {
989
    /* HEADER.SIZE is the vector's size field, which also holds the
990
       pseudovector type information.  It holds the size, too.
Miles Bader's avatar
Miles Bader committed
991 992
       The size counts the defalt, parent, purpose, ascii,
       contents, and extras slots.  */
993
    struct vectorlike_header header;
994

995 996 997
    /* This holds a default value,
       which is used whenever the value for a specific character is nil.  */
    Lisp_Object defalt;
998

Kenichi Handa's avatar
Kenichi Handa committed
999 1000 1001