chartab.c 27.4 KB
Newer Older
1
/* chartab.c -- char-table support
2
   Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
3 4 5 6 7
     National Institute of Advanced Industrial Science and Technology (AIST)
     Registration Number H13PRO009

This file is part of GNU Emacs.

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

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
19
along with GNU Emacs.  If not, see <http://www.gnu.org/licenses/>.  */
20 21

#include <config.h>
22
#include <setjmp.h>
23 24 25 26
#include "lisp.h"
#include "character.h"
#include "charset.h"
#include "ccl.h"
27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57

/* 64/16/32/128 */

/* Number of elements in Nth level char-table.  */
const int chartab_size[4] =
  { (1 << CHARTAB_SIZE_BITS_0),
    (1 << CHARTAB_SIZE_BITS_1),
    (1 << CHARTAB_SIZE_BITS_2),
    (1 << CHARTAB_SIZE_BITS_3) };

/* Number of characters each element of Nth level char-table
   covers.  */
const int chartab_chars[4] =
  { (1 << (CHARTAB_SIZE_BITS_1 + CHARTAB_SIZE_BITS_2 + CHARTAB_SIZE_BITS_3)),
    (1 << (CHARTAB_SIZE_BITS_2 + CHARTAB_SIZE_BITS_3)),
    (1 << CHARTAB_SIZE_BITS_3),
    1 };

/* Number of characters (in bits) each element of Nth level char-table
   covers.  */
const int chartab_bits[4] =
  { (CHARTAB_SIZE_BITS_1 + CHARTAB_SIZE_BITS_2 + CHARTAB_SIZE_BITS_3),
    (CHARTAB_SIZE_BITS_2 + CHARTAB_SIZE_BITS_3),
    CHARTAB_SIZE_BITS_3,
    0 };

#define CHARTAB_IDX(c, depth, min_char)		\
  (((c) - (min_char)) >> chartab_bits[(depth)])


DEFUN ("make-char-table", Fmake_char_table, Smake_char_table, 1, 2, 0,
58
       doc: /* Return a newly created char-table, with purpose PURPOSE.
59 60
Each element is initialized to INIT, which defaults to nil.

61 62 63 64
PURPOSE should be a symbol.  If it has a `char-table-extra-slots'
property, the property's value should be an integer between 0 and 10
that specifies how many extra slots the char-table has.  Otherwise,
the char-table has no extra slot.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
65
  (register Lisp_Object purpose, Lisp_Object init)
66 67 68
{
  Lisp_Object vector;
  Lisp_Object n;
69
  int n_extras;
70 71 72
  int size;

  CHECK_SYMBOL (purpose);
73 74 75 76
  n = Fget (purpose, Qchar_table_extra_slots);
  if (NILP (n))
    n_extras = 0;
  else
77
    {
78 79 80 81
      CHECK_NATNUM (n);
      n_extras = XINT (n);
      if (n_extras > 10)
	args_out_of_range (n, Qnil);
82 83 84 85
    }

  size = VECSIZE (struct Lisp_Char_Table) - 1 + n_extras;
  vector = Fmake_vector (make_number (size), init);
Miles Bader's avatar
Miles Bader committed
86
  XSETPVECTYPE (XVECTOR (vector), PVEC_CHAR_TABLE);
87 88 89 90 91 92 93
  XCHAR_TABLE (vector)->parent = Qnil;
  XCHAR_TABLE (vector)->purpose = purpose;
  XSETCHAR_TABLE (vector, XCHAR_TABLE (vector));
  return vector;
}

static Lisp_Object
94
make_sub_char_table (int depth, int min_char, Lisp_Object defalt)
95 96 97 98 99
{
  Lisp_Object table;
  int size = VECSIZE (struct Lisp_Sub_Char_Table) - 1 + chartab_size[depth];

  table = Fmake_vector (make_number (size), defalt);
Miles Bader's avatar
Miles Bader committed
100
  XSETPVECTYPE (XVECTOR (table), PVEC_SUB_CHAR_TABLE);
101 102 103 104 105 106 107
  XSUB_CHAR_TABLE (table)->depth = make_number (depth);
  XSUB_CHAR_TABLE (table)->min_char = make_number (min_char);

  return table;
}

static Lisp_Object
108
char_table_ascii (Lisp_Object table)
109 110 111 112
{
  Lisp_Object sub;

  sub = XCHAR_TABLE (table)->contents[0];
113 114
  if (! SUB_CHAR_TABLE_P (sub))
    return sub;
115
  sub = XSUB_CHAR_TABLE (sub)->contents[0];
116 117
  if (! SUB_CHAR_TABLE_P (sub))
    return sub;
118 119 120
  return XSUB_CHAR_TABLE (sub)->contents[0];
}

121
static Lisp_Object
122
copy_sub_char_table (Lisp_Object table)
123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145
{
  Lisp_Object copy;
  int depth = XINT (XSUB_CHAR_TABLE (table)->depth);
  int min_char = XINT (XSUB_CHAR_TABLE (table)->min_char);
  Lisp_Object val;
  int i;

  copy = make_sub_char_table (depth, min_char, Qnil);
  /* Recursively copy any sub char-tables.  */
  for (i = 0; i < chartab_size[depth]; i++)
    {
      val = XSUB_CHAR_TABLE (table)->contents[i];
      if (SUB_CHAR_TABLE_P (val))
	XSUB_CHAR_TABLE (copy)->contents[i] = copy_sub_char_table (val);
      else
	XSUB_CHAR_TABLE (copy)->contents[i] = val;
    }

  return copy;
}


Lisp_Object
146
copy_char_table (Lisp_Object table)
147 148 149 150 151 152
{
  Lisp_Object copy;
  int size = XCHAR_TABLE (table)->size & PSEUDOVECTOR_SIZE_MASK;
  int i;

  copy = Fmake_vector (make_number (size), Qnil);
Miles Bader's avatar
Miles Bader committed
153
  XSETPVECTYPE (XVECTOR (copy), PVEC_CHAR_TABLE);
154 155 156 157 158 159 160 161
  XCHAR_TABLE (copy)->defalt = XCHAR_TABLE (table)->defalt;
  XCHAR_TABLE (copy)->parent = XCHAR_TABLE (table)->parent;
  XCHAR_TABLE (copy)->purpose = XCHAR_TABLE (table)->purpose;
  for (i = 0; i < chartab_size[0]; i++)
    XCHAR_TABLE (copy)->contents[i]
      = (SUB_CHAR_TABLE_P (XCHAR_TABLE (table)->contents[i])
	 ? copy_sub_char_table (XCHAR_TABLE (table)->contents[i])
	 : XCHAR_TABLE (table)->contents[i]);
162
  XCHAR_TABLE (copy)->ascii = char_table_ascii (copy);
163 164 165 166 167 168 169 170
  size -= VECSIZE (struct Lisp_Char_Table) - 1;
  for (i = 0; i < size; i++)
    XCHAR_TABLE (copy)->extras[i] = XCHAR_TABLE (table)->extras[i];

  XSETCHAR_TABLE (copy, XCHAR_TABLE (copy));
  return copy;
}

Andreas Schwab's avatar
Andreas Schwab committed
171
static Lisp_Object
172
sub_char_table_ref (Lisp_Object table, int c)
173 174 175 176 177 178 179 180 181 182 183 184 185
{
  struct Lisp_Sub_Char_Table *tbl = XSUB_CHAR_TABLE (table);
  int depth = XINT (tbl->depth);
  int min_char = XINT (tbl->min_char);
  Lisp_Object val;

  val = tbl->contents[CHARTAB_IDX (c, depth, min_char)];
  if (SUB_CHAR_TABLE_P (val))
    val = sub_char_table_ref (val, c);
  return val;
}

Lisp_Object
186
char_table_ref (Lisp_Object table, int c)
187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209
{
  struct Lisp_Char_Table *tbl = XCHAR_TABLE (table);
  Lisp_Object val;

  if (ASCII_CHAR_P (c))
    {
      val = tbl->ascii;
      if (SUB_CHAR_TABLE_P (val))
	val = XSUB_CHAR_TABLE (val)->contents[c];
    }
  else
    {
      val = tbl->contents[CHARTAB_IDX (c, 0, 0)];
      if (SUB_CHAR_TABLE_P (val))
	val = sub_char_table_ref (val, c);
    }
  if (NILP (val))
    {
      val = tbl->defalt;
      if (NILP (val) && CHAR_TABLE_P (tbl->parent))
	val = char_table_ref (tbl->parent, c);
    }
  return val;
Kenichi Handa's avatar
Kenichi Handa committed
210
}
211 212

static Lisp_Object
213
sub_char_table_ref_and_range (Lisp_Object table, int c, int *from, int *to, Lisp_Object defalt)
214 215 216 217
{
  struct Lisp_Sub_Char_Table *tbl = XSUB_CHAR_TABLE (table);
  int depth = XINT (tbl->depth);
  int min_char = XINT (tbl->min_char);
218
  int max_char = min_char + chartab_chars[depth - 1] - 1;
219
  int chartab_idx = CHARTAB_IDX (c, depth, min_char), idx;
220
  Lisp_Object val;
Kenichi Handa's avatar
Kenichi Handa committed
221

222
  val = tbl->contents[chartab_idx];
223 224 225 226 227
  if (SUB_CHAR_TABLE_P (val))
    val = sub_char_table_ref_and_range (val, c, from, to, defalt);
  else if (NILP (val))
    val = defalt;

228
  idx = chartab_idx;
229
  while (idx > 0 && *from < min_char + idx * chartab_chars[depth])
230
    {
231 232
      Lisp_Object this_val;

233 234 235
      c = min_char + idx * chartab_chars[depth] - 1;
      idx--;
      this_val = tbl->contents[idx];
236
      if (SUB_CHAR_TABLE_P (this_val))
237
	this_val = sub_char_table_ref_and_range (this_val, c, from, to, defalt);
238 239 240 241
      else if (NILP (this_val))
	this_val = defalt;

      if (! EQ (this_val, val))
242 243 244 245
	{
	  *from = c + 1;
	  break;
	}
246
    }
247
  while ((c = min_char + (chartab_idx + 1) * chartab_chars[depth]) <= max_char
248
	 && *to >= c)
249
    {
250 251
      Lisp_Object this_val;

252 253
      chartab_idx++;
      this_val = tbl->contents[chartab_idx];
254
      if (SUB_CHAR_TABLE_P (this_val))
255
	this_val = sub_char_table_ref_and_range (this_val, c, from, to, defalt);
256 257 258
      else if (NILP (this_val))
	this_val = defalt;
      if (! EQ (this_val, val))
259 260 261 262
	{
	  *to = c - 1;
	  break;
	}
263
    }
264

265 266 267 268
  return val;
}


269 270 271 272
/* Return the value for C in char-table TABLE.  Shrink the range *FROM
   and *TO to cover characters (containing C) that have the same value
   as C.  It is not assured that the values of (*FROM - 1) and (*TO +
   1) are different from that of C.  */
273

274
Lisp_Object
275
char_table_ref_and_range (Lisp_Object table, int c, int *from, int *to)
276 277
{
  struct Lisp_Char_Table *tbl = XCHAR_TABLE (table);
278
  int chartab_idx = CHARTAB_IDX (c, 0, 0), idx;
279 280
  Lisp_Object val;

281
  val = tbl->contents[chartab_idx];
282 283 284 285
  if (*from < 0)
    *from = 0;
  if (*to < 0)
    *to = MAX_CHAR;
286 287 288 289 290
  if (SUB_CHAR_TABLE_P (val))
    val = sub_char_table_ref_and_range (val, c, from, to, tbl->defalt);
  else if (NILP (val))
    val = tbl->defalt;

291
  idx = chartab_idx;
292
  while (*from < idx * chartab_chars[0])
293
    {
294 295
      Lisp_Object this_val;

296 297 298
      c = idx * chartab_chars[0] - 1;
      idx--;
      this_val = tbl->contents[idx];
299
      if (SUB_CHAR_TABLE_P (this_val))
300
	this_val = sub_char_table_ref_and_range (this_val, c, from, to,
301 302 303 304 305
						 tbl->defalt);
      else if (NILP (this_val))
	this_val = tbl->defalt;

      if (! EQ (this_val, val))
306 307 308 309
	{
	  *from = c + 1;
	  break;
	}
310
    }
311
  while (*to >= (chartab_idx + 1) * chartab_chars[0])
312
    {
313 314
      Lisp_Object this_val;

315 316 317
      chartab_idx++;
      c = chartab_idx * chartab_chars[0];
      this_val = tbl->contents[chartab_idx];
318
      if (SUB_CHAR_TABLE_P (this_val))
319
	this_val = sub_char_table_ref_and_range (this_val, c, from, to,
320 321 322 323
						 tbl->defalt);
      else if (NILP (this_val))
	this_val = tbl->defalt;
      if (! EQ (this_val, val))
324 325 326 327
	{
	  *to = c - 1;
	  break;
	}
328 329 330
    }

  return val;
331
}
332 333 334


static void
335
sub_char_table_set (Lisp_Object table, int c, Lisp_Object val)
336 337 338 339 340 341
{
  struct Lisp_Sub_Char_Table *tbl = XSUB_CHAR_TABLE (table);
  int depth = XINT ((tbl)->depth);
  int min_char = XINT ((tbl)->min_char);
  int i = CHARTAB_IDX (c, depth, min_char);
  Lisp_Object sub;
Kenichi Handa's avatar
Kenichi Handa committed
342

343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358
  if (depth == 3)
    tbl->contents[i] = val;
  else
    {
      sub = tbl->contents[i];
      if (! SUB_CHAR_TABLE_P (sub))
	{
	  sub = make_sub_char_table (depth + 1,
				     min_char + i * chartab_chars[depth], sub);
	  tbl->contents[i] = sub;
	}
      sub_char_table_set (sub, c, val);
    }
}

Lisp_Object
359
char_table_set (Lisp_Object table, int c, Lisp_Object val)
360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380
{
  struct Lisp_Char_Table *tbl = XCHAR_TABLE (table);

  if (ASCII_CHAR_P (c)
      && SUB_CHAR_TABLE_P (tbl->ascii))
    {
      XSUB_CHAR_TABLE (tbl->ascii)->contents[c] = val;
    }
  else
    {
      int i = CHARTAB_IDX (c, 0, 0);
      Lisp_Object sub;

      sub = tbl->contents[i];
      if (! SUB_CHAR_TABLE_P (sub))
	{
	  sub = make_sub_char_table (1, i * chartab_chars[0], sub);
	  tbl->contents[i] = sub;
	}
      sub_char_table_set (sub, c, val);
      if (ASCII_CHAR_P (c))
381
	tbl->ascii = char_table_ascii (table);
382 383 384 385 386
    }
  return val;
}

static void
387
sub_char_table_set_range (Lisp_Object *table, int depth, int min_char, int from, int to, Lisp_Object val)
388 389 390
{
  int max_char = min_char + chartab_chars[depth] - 1;

Kenichi Handa's avatar
Kenichi Handa committed
391
  if (depth == 3 || (from <= min_char && to >= max_char))
392 393 394 395 396 397 398 399 400 401 402 403
    *table = val;
  else
    {
      int i, j;

      depth++;
      if (! SUB_CHAR_TABLE_P (*table))
	*table = make_sub_char_table (depth, min_char, *table);
      if (from < min_char)
	from = min_char;
      if (to > max_char)
	to = max_char;
404
      i = CHARTAB_IDX (from, depth, min_char);
405
      j = CHARTAB_IDX (to, depth, min_char);
406 407
      min_char += chartab_chars[depth] * i;
      for (; i <= j; i++, min_char += chartab_chars[depth])
408
	sub_char_table_set_range (XSUB_CHAR_TABLE (*table)->contents + i,
409
				  depth, min_char, from, to, val);
410 411 412 413 414
    }
}


Lisp_Object
415
char_table_set_range (Lisp_Object table, int from, int to, Lisp_Object val)
416 417 418 419 420 421 422 423 424 425 426 427 428 429
{
  struct Lisp_Char_Table *tbl = XCHAR_TABLE (table);
  Lisp_Object *contents = tbl->contents;
  int i, min_char;

  if (from == to)
    char_table_set (table, from, val);
  else
    {
      for (i = CHARTAB_IDX (from, 0, 0), min_char = i * chartab_chars[0];
	   min_char <= to;
	   i++, min_char += chartab_chars[0])
	sub_char_table_set_range (contents + i, 0, min_char, from, to, val);
      if (ASCII_CHAR_P (from))
430
	tbl->ascii = char_table_ascii (table);
431 432 433 434 435 436 437 438 439
    }
  return val;
}


DEFUN ("char-table-subtype", Fchar_table_subtype, Schar_table_subtype,
       1, 1, 0,
       doc: /*
Return the subtype of char-table CHAR-TABLE.  The value is a symbol.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
440
  (Lisp_Object char_table)
441 442 443 444 445 446 447 448 449 450 451 452 453
{
  CHECK_CHAR_TABLE (char_table);

  return XCHAR_TABLE (char_table)->purpose;
}

DEFUN ("char-table-parent", Fchar_table_parent, Schar_table_parent,
       1, 1, 0,
       doc: /* Return the parent char-table of CHAR-TABLE.
The value is either nil or another char-table.
If CHAR-TABLE holds nil for a given character,
then the actual applicable value is inherited from the parent char-table
\(or from its parents, if necessary).  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
454
  (Lisp_Object char_table)
455 456 457 458 459 460 461 462 463
{
  CHECK_CHAR_TABLE (char_table);

  return XCHAR_TABLE (char_table)->parent;
}

DEFUN ("set-char-table-parent", Fset_char_table_parent, Sset_char_table_parent,
       2, 2, 0,
       doc: /* Set the parent char-table of CHAR-TABLE to PARENT.
Kenichi Handa's avatar
Kenichi Handa committed
464
Return PARENT.  PARENT must be either nil or another char-table.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
465
  (Lisp_Object char_table, Lisp_Object parent)
466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487
{
  Lisp_Object temp;

  CHECK_CHAR_TABLE (char_table);

  if (!NILP (parent))
    {
      CHECK_CHAR_TABLE (parent);

      for (temp = parent; !NILP (temp); temp = XCHAR_TABLE (temp)->parent)
	if (EQ (temp, char_table))
	  error ("Attempt to make a chartable be its own parent");
    }

  XCHAR_TABLE (char_table)->parent = parent;

  return parent;
}

DEFUN ("char-table-extra-slot", Fchar_table_extra_slot, Schar_table_extra_slot,
       2, 2, 0,
       doc: /* Return the value of CHAR-TABLE's extra-slot number N.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
488
  (Lisp_Object char_table, Lisp_Object n)
489 490 491 492 493 494 495 496 497 498 499 500 501 502
{
  CHECK_CHAR_TABLE (char_table);
  CHECK_NUMBER (n);
  if (XINT (n) < 0
      || XINT (n) >= CHAR_TABLE_EXTRA_SLOTS (XCHAR_TABLE (char_table)))
    args_out_of_range (char_table, n);

  return XCHAR_TABLE (char_table)->extras[XINT (n)];
}

DEFUN ("set-char-table-extra-slot", Fset_char_table_extra_slot,
       Sset_char_table_extra_slot,
       3, 3, 0,
       doc: /* Set CHAR-TABLE's extra-slot number N to VALUE.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
503
  (Lisp_Object char_table, Lisp_Object n, Lisp_Object value)
504 505 506 507 508 509 510 511 512 513 514 515 516 517 518
{
  CHECK_CHAR_TABLE (char_table);
  CHECK_NUMBER (n);
  if (XINT (n) < 0
      || XINT (n) >= CHAR_TABLE_EXTRA_SLOTS (XCHAR_TABLE (char_table)))
    args_out_of_range (char_table, n);

  return XCHAR_TABLE (char_table)->extras[XINT (n)] = value;
}

DEFUN ("char-table-range", Fchar_table_range, Schar_table_range,
       2, 2, 0,
       doc: /* Return the value in CHAR-TABLE for a range of characters RANGE.
RANGE should be nil (for the default value),
a cons of character codes (for characters in the range), or a character code.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
519
  (Lisp_Object char_table, Lisp_Object range)
520 521 522 523 524 525 526 527 528 529 530 531
{
  Lisp_Object val;
  CHECK_CHAR_TABLE (char_table);

  if (EQ (range, Qnil))
    val = XCHAR_TABLE (char_table)->defalt;
  else if (INTEGERP (range))
    val = CHAR_TABLE_REF (char_table, XINT (range));
  else if (CONSP (range))
    {
      int from, to;

Kenichi Handa's avatar
Kenichi Handa committed
532 533
      CHECK_CHARACTER_CAR (range);
      CHECK_CHARACTER_CDR (range);
534 535 536 537 538 539 540 541 542 543 544
      val = char_table_ref_and_range (char_table, XINT (XCAR (range)),
				      &from, &to);
      /* Not yet implemented. */
    }
  else
    error ("Invalid RANGE argument to `char-table-range'");
  return val;
}

DEFUN ("set-char-table-range", Fset_char_table_range, Sset_char_table_range,
       3, 3, 0,
Kenichi Handa's avatar
Kenichi Handa committed
545
       doc: /* Set the value in CHAR-TABLE for a range of characters RANGE to VALUE.
546
RANGE should be t (for all characters), nil (for the default value),
Kenichi Handa's avatar
Kenichi Handa committed
547 548
a cons of character codes (for characters in the range),
or a character code.  Return VALUE.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
549
  (Lisp_Object char_table, Lisp_Object range, Lisp_Object value)
550 551 552 553 554 555
{
  CHECK_CHAR_TABLE (char_table);
  if (EQ (range, Qt))
    {
      int i;

556
      XCHAR_TABLE (char_table)->ascii = value;
557
      for (i = 0; i < chartab_size[0]; i++)
558
	XCHAR_TABLE (char_table)->contents[i] = value;
559 560 561 562 563 564 565
    }
  else if (EQ (range, Qnil))
    XCHAR_TABLE (char_table)->defalt = value;
  else if (INTEGERP (range))
    char_table_set (char_table, XINT (range), value);
  else if (CONSP (range))
    {
Kenichi Handa's avatar
Kenichi Handa committed
566 567
      CHECK_CHARACTER_CAR (range);
      CHECK_CHARACTER_CDR (range);
568 569 570 571 572 573 574 575 576 577 578 579
      char_table_set_range (char_table,
			    XINT (XCAR (range)), XINT (XCDR (range)), value);
    }
  else
    error ("Invalid RANGE argument to `set-char-table-range'");

  return value;
}

DEFUN ("set-char-table-default", Fset_char_table_default,
       Sset_char_table_default, 3, 3, 0,
       doc: /*
580
This function is obsolete and has no effect.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
581
  (Lisp_Object char_table, Lisp_Object ch, Lisp_Object value)
582 583 584 585 586
{
  return Qnil;
}

/* Look up the element in TABLE at index CH, and return it as an
587
   integer.  If the element is not a character, return CH itself.  */
588 589

int
590
char_table_translate (Lisp_Object table, int ch)
591 592 593
{
  Lisp_Object value;
  value = Faref (table, make_number (ch));
594
  if (! CHARACTERP (value))
595 596 597 598 599
    return ch;
  return XINT (value);
}

static Lisp_Object
600
optimize_sub_char_table (Lisp_Object table, Lisp_Object test)
601 602 603 604
{
  struct Lisp_Sub_Char_Table *tbl = XSUB_CHAR_TABLE (table);
  int depth = XINT (tbl->depth);
  Lisp_Object elt, this;
605
  int i, optimizable;
606 607 608

  elt = XSUB_CHAR_TABLE (table)->contents[0];
  if (SUB_CHAR_TABLE_P (elt))
609 610
    elt = XSUB_CHAR_TABLE (table)->contents[0]
      = optimize_sub_char_table (elt, test);
611
  optimizable = SUB_CHAR_TABLE_P (elt) ? 0 : 1;
612 613 614 615 616
  for (i = 1; i < chartab_size[depth]; i++)
    {
      this = XSUB_CHAR_TABLE (table)->contents[i];
      if (SUB_CHAR_TABLE_P (this))
	this = XSUB_CHAR_TABLE (table)->contents[i]
617
	  = optimize_sub_char_table (this, test);
618 619
      if (optimizable
	  && (NILP (test) ? NILP (Fequal (this, elt)) /* defaults to `equal'. */
620 621
	      : EQ (test, Qeq) ? !EQ (this, elt)      /* Optimize `eq' case.  */
	      : NILP (call2 (test, this, elt))))
622
	optimizable = 0;
623 624
    }

625
  return (optimizable ? elt : table);
626 627 628
}

DEFUN ("optimize-char-table", Foptimize_char_table, Soptimize_char_table,
629 630 631 632
       1, 2, 0,
       doc: /* Optimize CHAR-TABLE.
TEST is the comparison function used to decide whether two entries are
equivalent and can be merged.  It defaults to `equal'.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
633
  (Lisp_Object char_table, Lisp_Object test)
634 635 636 637 638 639 640 641 642 643
{
  Lisp_Object elt;
  int i;

  CHECK_CHAR_TABLE (char_table);

  for (i = 0; i < chartab_size[0]; i++)
    {
      elt = XCHAR_TABLE (char_table)->contents[i];
      if (SUB_CHAR_TABLE_P (elt))
644 645
	XCHAR_TABLE (char_table)->contents[i]
	  = optimize_sub_char_table (elt, test);
646
    }
647 648 649
  /* Reset the `ascii' cache, in case it got optimized away.  */
  XCHAR_TABLE (char_table)->ascii = char_table_ascii (char_table);

650 651 652 653
  return Qnil;
}


654 655 656 657 658 659 660 661 662 663 664 665 666 667
/* Map C_FUNCTION or FUNCTION over TABLE (top or sub char-table),
   calling it for each character or group of characters that share a
   value.  RANGE is a cons (FROM . TO) specifying the range of target
   characters, VAL is a value of FROM in TABLE, DEFAULT_VAL is the
   default value of the char-table, PARENT is the parent of the
   char-table.

   ARG is passed to C_FUNCTION when that is called.

   It returns the value of last character covered by TABLE (not the
   value inheritted from the parent), and by side-effect, the car part
   of RANGE is updated to the minimum character C where C and all the
   following characters in TABLE have the same value.  */

668
static Lisp_Object
669 670 671
map_sub_char_table (void (*c_function) (Lisp_Object, Lisp_Object, Lisp_Object),
		    Lisp_Object function, Lisp_Object table, Lisp_Object arg, Lisp_Object val,
		    Lisp_Object range, Lisp_Object default_val, Lisp_Object parent)
672
{
673 674 675 676 677 678 679 680 681
  /* Pointer to the elements of TABLE. */
  Lisp_Object *contents;
  /* Depth of TABLE.  */
  int depth;
  /* Minimum and maxinum characters covered by TABLE. */
  int min_char, max_char;
  /* Number of characters covered by one element of TABLE.  */
  int chars_in_block;
  int from = XINT (XCAR (range)), to = XINT (XCDR (range));
682 683
  int i, c;

684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710
  if (SUB_CHAR_TABLE_P (table))
    {
      struct Lisp_Sub_Char_Table *tbl = XSUB_CHAR_TABLE (table);

      depth = XINT (tbl->depth);
      contents = tbl->contents;
      min_char = XINT (tbl->min_char);
      max_char = min_char + chartab_chars[depth - 1] - 1;
    }
  else
    {
      depth = 0;
      contents = XCHAR_TABLE (table)->contents;
      min_char = 0;
      max_char = MAX_CHAR;
    }
  chars_in_block = chartab_chars[depth];

  if (to < max_char)
    max_char = to;
  /* Set I to the index of the first element to check.  */
  if (from <= min_char)
    i = 0;
  else
    i = (from - min_char) / chars_in_block;
  for (c = min_char + chars_in_block * i; c <= max_char;
       i++, c += chars_in_block)
711
    {
712 713
      Lisp_Object this = contents[i];
      int nextc = c + chars_in_block;
714 715

      if (SUB_CHAR_TABLE_P (this))
716 717 718 719 720 721
	{
	  if (to >= nextc)
	    XSETCDR (range, make_number (nextc - 1));
	  val = map_sub_char_table (c_function, function, this, arg,
				    val, range, default_val, parent);
	}
722
      else
723
	{
724 725
	  if (NILP (this))
	    this = default_val;
726
	  if (!EQ (val, this))
727
	    {
728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745
	      int different_value = 1;

	      if (NILP (val))
		{
		  if (! NILP (parent))
		    {
		      Lisp_Object temp = XCHAR_TABLE (parent)->parent;

		      /* This is to get a value of FROM in PARENT
			 without checking the parent of PARENT.  */
		      XCHAR_TABLE (parent)->parent = Qnil;
		      val = CHAR_TABLE_REF (parent, from);
		      XCHAR_TABLE (parent)->parent = temp;
		      XSETCDR (range, make_number (c - 1));
		      val = map_sub_char_table (c_function, function,
						parent, arg, val, range,
						XCHAR_TABLE (parent)->defalt,
						XCHAR_TABLE (parent)->parent);
746
		      if (EQ (val, this))
747 748 749 750
			different_value = 0;
		    }
		}
	      if (! NILP (val) && different_value)
751
		{
Kenichi Handa's avatar
Kenichi Handa committed
752
		  XSETCDR (range, make_number (c - 1));
753
		  if (EQ (XCAR (range), XCDR (range)))
754 755 756 757 758 759
		    {
		      if (c_function)
			(*c_function) (arg, XCAR (range), val);
		      else
			call2 (function, XCAR (range), val);
		    }
760
		  else
761 762 763 764 765 766
		    {
		      if (c_function)
			(*c_function) (arg, range, val);
		      else
			call2 (function, range, val);
		    }
767
		}
768
	      val = this;
769
	      from = c;
Kenichi Handa's avatar
Kenichi Handa committed
770
	      XSETCAR (range, make_number (c));
771 772
	    }
	}
773
      XSETCDR (range, make_number (to));
774 775 776 777 778 779 780 781
    }
  return val;
}


/* Map C_FUNCTION or FUNCTION over TABLE, calling it for each
   character or group of characters that share a value.

Kenichi Handa's avatar
Kenichi Handa committed
782
   ARG is passed to C_FUNCTION when that is called.  */
783 784

void
785
map_char_table (void (*c_function) (Lisp_Object, Lisp_Object, Lisp_Object), Lisp_Object function, Lisp_Object table, Lisp_Object arg)
786 787
{
  Lisp_Object range, val;
788
  struct gcpro gcpro1, gcpro2, gcpro3;
789

790
  range = Fcons (make_number (0), make_number (MAX_CHAR));
791
  GCPRO3 (table, arg, range);
792 793 794
  val = XCHAR_TABLE (table)->ascii;
  if (SUB_CHAR_TABLE_P (val))
    val = XSUB_CHAR_TABLE (val)->contents[0];
795 796 797 798 799 800
  val = map_sub_char_table (c_function, function, table, arg, val, range,
			    XCHAR_TABLE (table)->defalt,
			    XCHAR_TABLE (table)->parent);
  /* If VAL is nil and TABLE has a parent, we must consult the parent
     recursively.  */
  while (NILP (val) && ! NILP (XCHAR_TABLE (table)->parent))
801
    {
802 803 804 805 806 807 808 809 810 811 812 813 814
      Lisp_Object parent = XCHAR_TABLE (table)->parent;
      Lisp_Object temp = XCHAR_TABLE (parent)->parent;
      int from = XINT (XCAR (range));

      /* This is to get a value of FROM in PARENT without checking the
	 parent of PARENT.  */
      XCHAR_TABLE (parent)->parent = Qnil;
      val = CHAR_TABLE_REF (parent, from);
      XCHAR_TABLE (parent)->parent = temp;
      val = map_sub_char_table (c_function, function, parent, arg, val, range,
				XCHAR_TABLE (parent)->defalt,
				XCHAR_TABLE (parent)->parent);
      table = parent;
815
    }
816 817 818

  if (! NILP (val))
    {
819 820 821 822 823 824 825
      if (EQ (XCAR (range), XCDR (range)))
	{
	  if (c_function)
	    (*c_function) (arg, XCAR (range), val);
	  else
	    call2 (function, XCAR (range), val);
	}
826
      else
827 828 829 830 831 832
	{
	  if (c_function)
	    (*c_function) (arg, range, val);
	  else
	    call2 (function, range, val);
	}
833
    }
834 835

  UNGCPRO;
836 837 838 839 840
}

DEFUN ("map-char-table", Fmap_char_table, Smap_char_table,
  2, 2, 0,
       doc: /*
Kenichi Handa's avatar
Kenichi Handa committed
841
Call FUNCTION for each character in CHAR-TABLE that has non-nil value.
842
FUNCTION is called with two arguments--a key and a value.
843 844
The key is a character code or a cons of character codes specifying a
range of characters that have the same value.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
845
  (Lisp_Object function, Lisp_Object char_table)
846 847 848
{
  CHECK_CHAR_TABLE (char_table);

Kenichi Handa's avatar
Kenichi Handa committed
849
  map_char_table (NULL, function, char_table, char_table);
850 851 852
  return Qnil;
}

853 854

static void
855 856 857 858
map_sub_char_table_for_charset (void (*c_function) (Lisp_Object, Lisp_Object),
				Lisp_Object function, Lisp_Object table, Lisp_Object arg,
				Lisp_Object range, struct charset *charset,
				unsigned from, unsigned to)
859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902
{
  struct Lisp_Sub_Char_Table *tbl = XSUB_CHAR_TABLE (table);
  int depth = XINT (tbl->depth);
  int c, i;

  if (depth < 3)
    for (i = 0, c = XINT (tbl->min_char); i < chartab_size[depth];
	 i++, c += chartab_chars[depth])
      {
	Lisp_Object this;

	this = tbl->contents[i];
	if (SUB_CHAR_TABLE_P (this))
	  map_sub_char_table_for_charset (c_function, function, this, arg,
					  range, charset, from, to);
	else
	  {
	    if (! NILP (XCAR (range)))
	      {
		XSETCDR (range, make_number (c - 1));
		if (c_function)
		  (*c_function) (arg, range);
		else
		  call2 (function, range, arg);
	      }
	    XSETCAR (range, Qnil);
	  }
      }
  else
    for (i = 0, c = XINT (tbl->min_char); i < chartab_size[depth]; i++, c ++)
      {
	Lisp_Object this;
	unsigned code;

	this = tbl->contents[i];
	if (NILP (this)
	    || (charset
		&& (code = ENCODE_CHAR (charset, c),
		    (code < from || code > to))))
	  {
	    if (! NILP (XCAR (range)))
	      {
		XSETCDR (range, make_number (c - 1));
		if (c_function)
903
		  (*c_function) (arg, range);
904 905 906 907 908 909 910 911 912 913 914 915 916 917
		else
		  call2 (function, range, arg);
		XSETCAR (range, Qnil);
	      }
	  }
	else
	  {
	    if (NILP (XCAR (range)))
	      XSETCAR (range, make_number (c));
	  }
      }
}


918
/* Support function for `map-charset-chars'.  Map C_FUNCTION or
Juanma Barranquero's avatar
Juanma Barranquero committed
919
   FUNCTION over TABLE, calling it for each character or a group of
920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938
   succeeding characters that have non-nil value in TABLE.  TABLE is a
   "mapping table" or a "deunifier table" of a certain charset.

   If CHARSET is not NULL (this is the case that `map-charset-chars'
   is called with non-nil FROM-CODE and TO-CODE), it is a charset who
   owns TABLE, and the function is called only on a character in the
   range FROM and TO.  FROM and TO are not character codes, but code
   points of a character in CHARSET.

   This function is called in these two cases:

   (1) A charset has a mapping file name in :map property.

   (2) A charset has an upper code space in :offset property and a
   mapping file name in :unify-map property.  In this case, this
   function is called only for characters in the Unicode code space.
   Characters in upper code space are handled directly in
   map_charset_chars.  */

939
void
940
map_char_table_for_charset (void (*c_function) (Lisp_Object, Lisp_Object),
941 942 943
			    Lisp_Object function, Lisp_Object table, Lisp_Object arg,
			    struct charset *charset,
			    unsigned from, unsigned to)
944 945 946
{
  Lisp_Object range;
  int c, i;
947
  struct gcpro gcpro1;
948

Kenichi Handa's avatar
Kenichi Handa committed
949
  range = Fcons (Qnil, Qnil);
950
  GCPRO1 (range);
951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980

  for (i = 0, c = 0; i < chartab_size[0]; i++, c += chartab_chars[0])
    {
      Lisp_Object this;

      this = XCHAR_TABLE (table)->contents[i];
      if (SUB_CHAR_TABLE_P (this))
	map_sub_char_table_for_charset (c_function, function, this, arg,
					range, charset, from, to);
      else
	{
	  if (! NILP (XCAR (range)))
	    {
	      XSETCDR (range, make_number (c - 1));
	      if (c_function)
		(*c_function) (arg, range);
	      else
		call2 (function, range, arg);
	    }
	  XSETCAR (range, Qnil);
	}
    }
  if (! NILP (XCAR (range)))
    {
      XSETCDR (range, make_number (c - 1));
      if (c_function)
	(*c_function) (arg, range);
      else
	call2 (function, range, arg);
    }
981 982

  UNGCPRO;
983 984
}

985 986

void
987
syms_of_chartab (void)
988 989 990 991 992 993 994 995 996 997 998 999 1000
{
  defsubr (&Smake_char_table);
  defsubr (&Schar_table_parent);
  defsubr (&Schar_table_subtype);
  defsubr (&Sset_char_table_parent);
  defsubr (&Schar_table_extra_slot);
  defsubr (&Sset_char_table_extra_slot);
  defsubr (&Schar_table_range);
  defsubr (&Sset_char_table_range);
  defsubr (&Sset_char_table_default);
  defsubr (&Soptimize_char_table);
  defsubr (&Smap_char_table);
}