composite.c 62.5 KB
Newer Older
Kenichi Handa's avatar
Kenichi Handa committed
1
/* Composite sequence support.
2
   Copyright (C) 2001-2012 Free Software Foundation, Inc.
3
   Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
Kenichi Handa's avatar
Kenichi Handa committed
4 5
     National Institute of Advanced Industrial Science and Technology (AIST)
     Registration Number H14PRO021
6
   Copyright (C) 2003, 2006
7 8
     National Institute of Advanced Industrial Science and Technology (AIST)
     Registration Number H13PRO009
Kenichi Handa's avatar
Kenichi Handa committed
9 10 11

This file is part of GNU Emacs.

12
GNU Emacs is free software: you can redistribute it and/or modify
Kenichi Handa's avatar
Kenichi Handa committed
13
it under the terms of the GNU General Public License as published by
14 15
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Kenichi Handa's avatar
Kenichi Handa committed
16 17 18 19 20 21 22

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
23
along with GNU Emacs.  If not, see <http://www.gnu.org/licenses/>.  */
Kenichi Handa's avatar
Kenichi Handa committed
24 25

#include <config.h>
26
#include <setjmp.h>
Kenichi Handa's avatar
Kenichi Handa committed
27 28
#include "lisp.h"
#include "buffer.h"
29
#include "character.h"
30
#include "coding.h"
Kenichi Handa's avatar
Kenichi Handa committed
31
#include "intervals.h"
32 33 34 35
#include "window.h"
#include "frame.h"
#include "dispextern.h"
#include "font.h"
36 37
#include "termhooks.h"

Kenichi Handa's avatar
Kenichi Handa committed
38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75

/* Emacs uses special text property `composition' to support character
   composition.  A sequence of characters that have the same (i.e. eq)
   `composition' property value is treated as a single composite
   sequence (we call it just `composition' here after).  Characters in
   a composition are all composed somehow on the screen.

   The property value has this form when the composition is made:
	((LENGTH . COMPONENTS) . MODIFICATION-FUNC)
   then turns to this form:
	(COMPOSITION-ID . (LENGTH COMPONENTS-VEC . MODIFICATION-FUNC))
   when the composition is registered in composition_hash_table and
   composition_table.  These rather peculiar structures were designed
   to make it easy to distinguish them quickly (we can do that by
   checking only the first element) and to extract LENGTH (from the
   former form) and COMPOSITION-ID (from the latter form).

   We register a composition when it is displayed, or when the width
   is required (for instance, to calculate columns).

   LENGTH -- Length of the composition.  This information is used to
	check the validity of the composition.

   COMPONENTS --  Character, string, vector, list, or nil.

	If it is nil, characters in the text are composed relatively
	according to their metrics in font glyphs.

	If it is a character or a string, the character or characters
	in the string are composed relatively.

	If it is a vector or list of integers, the element is a
	character or an encoded composition rule.  The characters are
	composed according to the rules.  (2N)th elements are
	characters to be composed and (2N+1)th elements are
	composition rules to tell how to compose (2N+2)th element with
	the previously composed 2N glyphs.

76 77
   COMPONENTS-VEC -- Vector of integers.  In a relative composition,
	the elements are the characters to be composed.  In a rule-base
Kenichi Handa's avatar
Kenichi Handa committed
78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96
	composition, the elements are characters or encoded
	composition rules.

   MODIFICATION-FUNC -- If non nil, it is a function to call when the
	composition gets invalid after a modification in a buffer.  If
	it is nil, a function in `composition-function-table' of the
	first character in the sequence is called.

   COMPOSITION-ID --Identification number of the composition.  It is
	used as an index to composition_table for the composition.

   When Emacs has to display a composition or has to know its
   displaying width, the function get_composition_id is called.  It
   returns COMPOSITION-ID so that the caller can access the
   information about the composition through composition_table.  If a
   COMPOSITION-ID has not yet been assigned to the composition,
   get_composition_id checks the validity of `composition' property,
   and, if valid, assigns a new ID, registers the information in
   composition_hash_table and composition_table, and changes the form
97 98
   of the property value.  If the property is invalid,
   get_composition_id returns -1 without changing the property value.
Kenichi Handa's avatar
Kenichi Handa committed
99

100
   We use two tables to keep the information about composition;
Kenichi Handa's avatar
Kenichi Handa committed
101 102
   composition_hash_table and composition_table.

103
   The former is a hash table whose keys are COMPONENTS-VECs and
Kenichi Handa's avatar
Kenichi Handa committed
104
   values are the corresponding COMPOSITION-IDs.  This hash table is
105
   weak, but as each key (COMPONENTS-VEC) is also kept as a value of the
Kenichi Handa's avatar
Kenichi Handa committed
106
   `composition' property, it won't be collected as garbage until all
107
   bits of text that have the same COMPONENTS-VEC are deleted.
Kenichi Handa's avatar
Kenichi Handa committed
108 109

   The latter is a table of pointers to `struct composition' indexed
110
   by COMPOSITION-ID.  This structure keeps the other information (see
Kenichi Handa's avatar
Kenichi Handa committed
111 112 113 114
   composite.h).

   In general, a text property holds information about individual
   characters.  But, a `composition' property holds information about
115
   a sequence of characters (in this sense, it is like the `intangible'
Kenichi Handa's avatar
Kenichi Handa committed
116
   property).  That means that we should not share the property value
117
   in adjacent compositions -- we can't distinguish them if they have the
Kenichi Handa's avatar
Kenichi Handa committed
118 119 120 121 122 123
   same property.  So, after any changes, we call
   `update_compositions' and change a property of one of adjacent
   compositions to a copy of it.  This function also runs a proper
   composition modification function to make a composition that gets
   invalid by the change valid again.

124
   As the value of the `composition' property holds information about a
Kenichi Handa's avatar
Kenichi Handa committed
125
   specific range of text, the value gets invalid if we change the
126
   text in the range.  We treat the `composition' property as always
Kenichi Handa's avatar
Kenichi Handa committed
127 128 129
   rear-nonsticky (currently by setting default-text-properties to
   (rear-nonsticky (composition))) and we never make properties of
   adjacent compositions identical.  Thus, any such changes make the
130
   range just shorter.  So, we can check the validity of the `composition'
Kenichi Handa's avatar
Kenichi Handa committed
131 132 133 134 135 136 137 138 139 140 141 142 143 144
   property by comparing LENGTH information with the actual length of
   the composition.

*/


Lisp_Object Qcomposition;

/* Table of pointers to the structure `composition' indexed by
   COMPOSITION-ID.  This structure is for storing information about
   each composition except for COMPONENTS-VEC.  */
struct composition **composition_table;

/* The current size of `composition_table'.  */
145
static ptrdiff_t composition_table_size;
Kenichi Handa's avatar
Kenichi Handa committed
146 147

/* Number of compositions currently made. */
148
ptrdiff_t n_compositions;
Kenichi Handa's avatar
Kenichi Handa committed
149 150 151 152 153 154

/* Hash table for compositions.  The key is COMPONENTS-VEC of
   `composition' property.  The value is the corresponding
   COMPOSITION-ID.  */
Lisp_Object composition_hash_table;

155 156
static Lisp_Object Qauto_composed;
static Lisp_Object Qauto_composition_function;
157 158
/* Maximum number of characters to look back for
   auto-compositions.  */
159 160
#define MAX_AUTO_COMPOSITION_LOOKBACK 3

161 162
static Lisp_Object Fcomposition_get_gstring (Lisp_Object, Lisp_Object,
					     Lisp_Object, Lisp_Object);
163

Kenichi Handa's avatar
Kenichi Handa committed
164 165
/* Temporary variable used in macros COMPOSITION_XXX.  */
Lisp_Object composition_temp;
166

Kenichi Handa's avatar
Kenichi Handa committed
167 168 169 170 171 172 173 174

/* Return COMPOSITION-ID of a composition at buffer position
   CHARPOS/BYTEPOS and length NCHARS.  The `composition' property of
   the sequence is PROP.  STRING, if non-nil, is a string that
   contains the composition instead of the current buffer.

   If the composition is invalid, return -1.  */

175
ptrdiff_t
176 177
get_composition_id (EMACS_INT charpos, EMACS_INT bytepos, EMACS_INT nchars,
		    Lisp_Object prop, Lisp_Object string)
Kenichi Handa's avatar
Kenichi Handa committed
178 179
{
  Lisp_Object id, length, components, key, *key_contents;
180
  ptrdiff_t glyph_len;
Kenichi Handa's avatar
Kenichi Handa committed
181
  struct Lisp_Hash_Table *hash_table = XHASH_TABLE (composition_hash_table);
182
  ptrdiff_t hash_index;
183
  EMACS_UINT hash_code;
184
  enum composition_method method;
Kenichi Handa's avatar
Kenichi Handa committed
185
  struct composition *cmp;
186 187
  EMACS_INT i;
  int ch;
Kenichi Handa's avatar
Kenichi Handa committed
188

189 190 191 192 193
  /* Maximum length of a string of glyphs.  XftGlyphExtents limits
     this to INT_MAX, and Emacs limits it further.  Divide INT_MAX - 1
     by 2 because x_produce_glyphs computes glyph_len * 2 + 1.  Divide
     the size by MAX_MULTIBYTE_LENGTH because encode_terminal_code
     multiplies glyph_len by MAX_MULTIBYTE_LENGTH.  */
194
  enum {
195 196
    GLYPH_LEN_MAX = min ((INT_MAX - 1) / 2,
			 min (PTRDIFF_MAX, SIZE_MAX) / MAX_MULTIBYTE_LENGTH)
197 198
  };

Kenichi Handa's avatar
Kenichi Handa committed
199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263
  /* PROP should be
	Form-A: ((LENGTH . COMPONENTS) . MODIFICATION-FUNC)
     or
	Form-B: (COMPOSITION-ID . (LENGTH COMPONENTS-VEC . MODIFICATION-FUNC))
  */
  if (nchars == 0 || !CONSP (prop))
    goto invalid_composition;

  id = XCAR (prop);
  if (INTEGERP (id))
    {
      /* PROP should be Form-B.  */
      if (XINT (id) < 0 || XINT (id) >= n_compositions)
	goto invalid_composition;
      return XINT (id);
    }

  /* PROP should be Form-A.
     Thus, ID should be (LENGTH . COMPONENTS).  */
  if (!CONSP (id))
    goto invalid_composition;
  length = XCAR (id);
  if (!INTEGERP (length) || XINT (length) != nchars)
    goto invalid_composition;

  components = XCDR (id);

  /* Check if the same composition has already been registered or not
     by consulting composition_hash_table.  The key for this table is
     COMPONENTS (converted to a vector COMPONENTS-VEC) or, if it is
     nil, vector of characters in the composition range.  */
  if (INTEGERP (components))
    key = Fmake_vector (make_number (1), components);
  else if (STRINGP (components) || CONSP (components))
    key = Fvconcat (1, &components);
  else if (VECTORP (components))
    key = components;
  else if (NILP (components))
    {
      key = Fmake_vector (make_number (nchars), Qnil);
      if (STRINGP (string))
	for (i = 0; i < nchars; i++)
	  {
	    FETCH_STRING_CHAR_ADVANCE (ch, string, charpos, bytepos);
	    XVECTOR (key)->contents[i] = make_number (ch);
	  }
      else
	for (i = 0; i < nchars; i++)
	  {
	    FETCH_CHAR_ADVANCE (ch, charpos, bytepos);
	    XVECTOR (key)->contents[i] = make_number (ch);
	  }
    }
  else
    goto invalid_composition;

  hash_index = hash_lookup (hash_table, key, &hash_code);
  if (hash_index >= 0)
    {
      /* We have already registered the same composition.  Change PROP
	 from Form-A above to Form-B while replacing COMPONENTS with
	 COMPONENTS-VEC stored in the hash table.  We can directly
	 modify the cons cell of PROP because it is not shared.  */
      key = HASH_KEY (hash_table, hash_index);
      id = HASH_VALUE (hash_table, hash_index);
264 265
      XSETCAR (prop, id);
      XSETCDR (prop, Fcons (make_number (nchars), Fcons (key, XCDR (prop))));
Kenichi Handa's avatar
Kenichi Handa committed
266 267 268 269
      return XINT (id);
    }

  /* This composition is a new one.  We must register it.  */
270

Kenichi Handa's avatar
Kenichi Handa committed
271
  /* Check if we have sufficient memory to store this information.  */
272 273 274
  if (composition_table_size <= n_compositions)
    composition_table = xpalloc (composition_table, &composition_table_size,
				 1, -1, sizeof *composition_table);
Kenichi Handa's avatar
Kenichi Handa committed
275 276 277 278 279 280

  key_contents = XVECTOR (key)->contents;

  /* Check if the contents of COMPONENTS are valid if COMPONENTS is a
     vector or a list.  It should be a sequence of:
	char1 rule1 char2 rule2 char3 ...    ruleN charN+1  */
281

282
  if (VECTORP (components)
283 284 285 286
      && ASIZE (components) >= 2
      && VECTORP (AREF (components, 0)))
    {
      /* COMPONENTS is a glyph-string.  */
287
      EMACS_INT len = ASIZE (key);
288 289 290 291 292

      for (i = 1; i < len; i++)
	if (! VECTORP (AREF (key, i)))
	  goto invalid_composition;
    }
293
  else if (VECTORP (components) || CONSP (components))
Kenichi Handa's avatar
Kenichi Handa committed
294
    {
295
      EMACS_INT len = ASIZE (key);
Kenichi Handa's avatar
Kenichi Handa committed
296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311

      /* The number of elements should be odd.  */
      if ((len % 2) == 0)
	goto invalid_composition;
      /* All elements should be integers (character or encoded
         composition rule).  */
      for (i = 0; i < len; i++)
	{
	  if (!INTEGERP (key_contents[i]))
	    goto invalid_composition;
	}
    }

  /* Change PROP from Form-A above to Form-B.  We can directly modify
     the cons cell of PROP because it is not shared.  */
  XSETFASTINT (id, n_compositions);
312 313
  XSETCAR (prop, id);
  XSETCDR (prop, Fcons (make_number (nchars), Fcons (key, XCDR (prop))));
Kenichi Handa's avatar
Kenichi Handa committed
314 315 316 317

  /* Register the composition in composition_hash_table.  */
  hash_index = hash_put (hash_table, key, id, hash_code);

318 319 320 321 322 323 324 325 326 327
  method = (NILP (components)
	    ? COMPOSITION_RELATIVE
	    : ((INTEGERP (components) || STRINGP (components))
	       ? COMPOSITION_WITH_ALTCHARS
	       : COMPOSITION_WITH_RULE_ALTCHARS));

  glyph_len = (method == COMPOSITION_WITH_RULE_ALTCHARS
	       ? (ASIZE (key) + 1) / 2
	       : ASIZE (key));

328
  if (GLYPH_LEN_MAX < glyph_len)
329 330
    memory_full (SIZE_MAX);

Kenichi Handa's avatar
Kenichi Handa committed
331 332 333
  /* Register the composition in composition_table.  */
  cmp = (struct composition *) xmalloc (sizeof (struct composition));

334
  cmp->method = method;
Kenichi Handa's avatar
Kenichi Handa committed
335 336
  cmp->hash_index = hash_index;
  cmp->glyph_len = glyph_len;
337
  cmp->offsets = xnmalloc (glyph_len, 2 * sizeof *cmp->offsets);
Kenichi Handa's avatar
Kenichi Handa committed
338 339
  cmp->font = NULL;

340
  if (cmp->method != COMPOSITION_WITH_RULE_ALTCHARS)
Kenichi Handa's avatar
Kenichi Handa committed
341 342 343 344 345 346 347
    {
      /* Relative composition.  */
      cmp->width = 0;
      for (i = 0; i < glyph_len; i++)
	{
	  int this_width;
	  ch = XINT (key_contents[i]);
348 349
	  /* TAB in a composition means display glyphs with padding
	     space on the left or right.  */
350
	  this_width = (ch == '\t' ? 1 : CHAR_WIDTH (ch));
Kenichi Handa's avatar
Kenichi Handa committed
351 352 353 354 355 356 357
	  if (cmp->width < this_width)
	    cmp->width = this_width;
	}
    }
  else
    {
      /* Rule-base composition.  */
358
      double leftmost = 0.0, rightmost;
Kenichi Handa's avatar
Kenichi Handa committed
359 360

      ch = XINT (key_contents[0]);
361
      rightmost = ch != '\t' ? CHAR_WIDTH (ch) : 1;
Kenichi Handa's avatar
Kenichi Handa committed
362 363 364

      for (i = 1; i < glyph_len; i += 2)
	{
365
	  int rule, gref, nref;
Kenichi Handa's avatar
Kenichi Handa committed
366
	  int this_width;
367
	  double this_left;
Kenichi Handa's avatar
Kenichi Handa committed
368 369 370

	  rule = XINT (key_contents[i]);
	  ch = XINT (key_contents[i + 1]);
371
	  this_width = ch != '\t' ? CHAR_WIDTH (ch) : 1;
Kenichi Handa's avatar
Kenichi Handa committed
372 373 374 375 376 377 378 379 380 381 382 383 384 385 386

	  /* A composition rule is specified by an integer value
	     that encodes global and new reference points (GREF and
	     NREF).  GREF and NREF are specified by numbers as
	     below:
		0---1---2 -- ascent
		|       |
		|       |
		|       |
		9--10--11 -- center
		|       |
	     ---3---4---5--- baseline
		|       |
		6---7---8 -- descent
	  */
387
	  COMPOSITION_DECODE_REFS (rule, gref, nref);
Kenichi Handa's avatar
Kenichi Handa committed
388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413
	  this_left = (leftmost
		       + (gref % 3) * (rightmost - leftmost) / 2.0
		       - (nref % 3) * this_width / 2.0);

	  if (this_left < leftmost)
	    leftmost = this_left;
	  if (this_left + this_width > rightmost)
	    rightmost = this_left + this_width;
	}

      cmp->width = rightmost - leftmost;
      if (cmp->width < (rightmost - leftmost))
	/* To get a ceiling integer value.  */
	cmp->width++;
    }

  composition_table[n_compositions] = cmp;

  return n_compositions++;

 invalid_composition:
  /* Would it be better to remove this `composition' property?  */
  return -1;
}


414 415
/* Find a static composition at or nearest to position POS of OBJECT
   (buffer or string).
Kenichi Handa's avatar
Kenichi Handa committed
416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431

   OBJECT defaults to the current buffer.  If there's a composition at
   POS, set *START and *END to the start and end of the sequence,
   *PROP to the `composition' property, and return 1.

   If there's no composition at POS and LIMIT is negative, return 0.

   Otherwise, search for a composition forward (LIMIT > POS) or
   backward (LIMIT < POS).  In this case, LIMIT bounds the search.

   If a composition is found, set *START, *END, and *PROP as above,
   and return 1, else return 0.

   This doesn't check the validity of composition.  */

int
432 433 434
find_composition (EMACS_INT pos, EMACS_INT limit,
		  EMACS_INT *start, EMACS_INT *end,
		  Lisp_Object *prop, Lisp_Object object)
Kenichi Handa's avatar
Kenichi Handa committed
435 436 437 438 439 440 441 442 443 444
{
  Lisp_Object val;

  if (get_property_and_range (pos, Qcomposition, prop, start, end, object))
    return 1;

  if (limit < 0 || limit == pos)
    return 0;

  if (limit > pos)		/* search forward */
445 446 447 448 449 450 451
    {
      val = Fnext_single_property_change (make_number (pos), Qcomposition,
					  object, make_number (limit));
      pos = XINT (val);
      if (pos == limit)
	return 0;
    }
Kenichi Handa's avatar
Kenichi Handa committed
452
  else				/* search backward */
453 454 455 456 457 458 459 460 461 462 463
    {
      if (get_property_and_range (pos - 1, Qcomposition, prop, start, end,
				  object))
	return 1;
      val = Fprevious_single_property_change (make_number (pos), Qcomposition,
					      object, make_number (limit));
      pos = XINT (val);
      if (pos == limit)
	return 0;
      pos--;
    }
Kenichi Handa's avatar
Kenichi Handa committed
464 465 466 467 468 469 470 471
  get_property_and_range (pos, Qcomposition, prop, start, end, object);
  return 1;
}

/* Run a proper function to adjust the composition sitting between
   FROM and TO with property PROP.  */

static void
472
run_composition_function (EMACS_INT from, EMACS_INT to, Lisp_Object prop)
Kenichi Handa's avatar
Kenichi Handa committed
473
{
474
  Lisp_Object func;
475
  EMACS_INT start, end;
Kenichi Handa's avatar
Kenichi Handa committed
476 477 478 479 480 481 482 483 484 485 486 487

  func = COMPOSITION_MODIFICATION_FUNC (prop);
  /* If an invalid composition precedes or follows, try to make them
     valid too.  */
  if (from > BEGV
      && find_composition (from - 1, -1, &start, &end, &prop, Qnil)
      && !COMPOSITION_VALID_P (start, end, prop))
    from = start;
  if (to < ZV
      && find_composition (to, -1, &start, &end, &prop, Qnil)
      && !COMPOSITION_VALID_P (start, end, prop))
    to = end;
Kenichi Handa's avatar
Kenichi Handa committed
488
  if (!NILP (Ffboundp (func)))
Kenichi Handa's avatar
Kenichi Handa committed
489 490 491 492 493 494 495
    call2 (func, make_number (from), make_number (to));
}

/* Make invalid compositions adjacent to or inside FROM and TO valid.
   CHECK_MASK is bitwise `or' of mask bits defined by macros
   CHECK_XXX (see the comment in composite.h).

496
   It also resets the text-property `auto-composed' to a proper region
Kenichi Handa's avatar
Kenichi Handa committed
497 498
   so that automatic character composition works correctly later while
   displaying the region.
Kenichi Handa's avatar
Kenichi Handa committed
499

Kenichi Handa's avatar
Kenichi Handa committed
500 501 502 503
   This function is called when a buffer text is changed.  If the
   change is deletion, FROM == TO.  Otherwise, FROM < TO.  */

void
504
update_compositions (EMACS_INT from, EMACS_INT to, int check_mask)
Kenichi Handa's avatar
Kenichi Handa committed
505
{
506
  Lisp_Object prop;
507
  EMACS_INT start, end;
Kenichi Handa's avatar
Kenichi Handa committed
508 509
  /* The beginning and end of the region to set the property
     `auto-composed' to nil.  */
510
  EMACS_INT min_pos = from, max_pos = to;
Kenichi Handa's avatar
Kenichi Handa committed
511

512 513
  if (inhibit_modification_hooks)
    return;
514

515 516 517 518
  /* If FROM and TO are not in a valid range, do nothing.  */
  if (! (BEGV <= from && from <= to && to <= ZV))
    return;

Kenichi Handa's avatar
Kenichi Handa committed
519 520 521 522 523 524 525 526
  if (check_mask & CHECK_HEAD)
    {
      /* FROM should be at composition boundary.  But, insertion or
	 deletion will make two compositions adjacent and
	 indistinguishable when they have same (eq) property.  To
	 avoid it, in such a case, we change the property of the
	 latter to the copy of it.  */
      if (from > BEGV
527 528
	  && find_composition (from - 1, -1, &start, &end, &prop, Qnil)
	  && COMPOSITION_VALID_P (start, end, prop))
Kenichi Handa's avatar
Kenichi Handa committed
529
	{
Kenichi Handa's avatar
Kenichi Handa committed
530 531 532
	  min_pos = start;
	  if (end > to)
	    max_pos = end;
Kenichi Handa's avatar
Kenichi Handa committed
533 534 535 536 537 538 539
	  if (from < end)
	    Fput_text_property (make_number (from), make_number (end),
				Qcomposition,
				Fcons (XCAR (prop), XCDR (prop)), Qnil);
	  run_composition_function (start, end, prop);
	  from = end;
	}
540
      else if (from < ZV
541
	       && find_composition (from, -1, &start, &from, &prop, Qnil)
542
	       && COMPOSITION_VALID_P (start, from, prop))
Kenichi Handa's avatar
Kenichi Handa committed
543 544 545 546 547
	{
	  if (from > to)
	    max_pos = from;
	  run_composition_function (start, from, prop);
	}
Kenichi Handa's avatar
Kenichi Handa committed
548 549 550 551 552 553 554 555 556
    }

  if (check_mask & CHECK_INSIDE)
    {
      /* In this case, we are sure that (check & CHECK_TAIL) is also
         nonzero.  Thus, here we should check only compositions before
         (to - 1).  */
      while (from < to - 1
	     && find_composition (from, to, &start, &from, &prop, Qnil)
557
	     && COMPOSITION_VALID_P (start, from, prop)
Kenichi Handa's avatar
Kenichi Handa committed
558 559 560 561 562 563 564
	     && from < to - 1)
	run_composition_function (start, from, prop);
    }

  if (check_mask & CHECK_TAIL)
    {
      if (from < to
565 566
	  && find_composition (to - 1, -1, &start, &end, &prop, Qnil)
	  && COMPOSITION_VALID_P (start, end, prop))
Kenichi Handa's avatar
Kenichi Handa committed
567 568 569 570 571 572 573
	{
	  /* TO should be also at composition boundary.  But,
	     insertion or deletion will make two compositions adjacent
	     and indistinguishable when they have same (eq) property.
	     To avoid it, in such a case, we change the property of
	     the former to the copy of it.  */
	  if (to < end)
Kenichi Handa's avatar
Kenichi Handa committed
574 575 576 577 578 579
	    {
	      Fput_text_property (make_number (start), make_number (to),
				  Qcomposition,
				  Fcons (XCAR (prop), XCDR (prop)), Qnil);
	      max_pos = end;
	    }
Kenichi Handa's avatar
Kenichi Handa committed
580 581 582
	  run_composition_function (start, end, prop);
	}
      else if (to < ZV
583 584
	       && find_composition (to, -1, &start, &end, &prop, Qnil)
	       && COMPOSITION_VALID_P (start, end, prop))
Kenichi Handa's avatar
Kenichi Handa committed
585 586 587 588
	{
	  run_composition_function (start, end, prop);
	  max_pos = end;
	}
Kenichi Handa's avatar
Kenichi Handa committed
589
    }
Kenichi Handa's avatar
Kenichi Handa committed
590
  if (min_pos < max_pos)
591 592 593 594 595 596 597 598 599 600 601
    {
      int count = SPECPDL_INDEX ();

      specbind (Qinhibit_read_only, Qt);
      specbind (Qinhibit_modification_hooks, Qt);
      specbind (Qinhibit_point_motion_hooks, Qt);
      Fremove_list_of_text_properties (make_number (min_pos),
				       make_number (max_pos),
				       Fcons (Qauto_composed, Qnil), Qnil);
      unbind_to (count, Qnil);
    }
Kenichi Handa's avatar
Kenichi Handa committed
602 603
}

604 605 606 607 608 609

/* Modify composition property values in LIST destructively.  LIST is
   a list as returned from text_property_list.  Change values to the
   top-level copies of them so that none of them are `eq'.  */

void
610
make_composition_value_copy (Lisp_Object list)
611 612 613 614 615 616 617 618 619 620
{
  Lisp_Object plist, val;

  for (; CONSP (list); list = XCDR (list))
    {
      plist = XCAR (XCDR (XCDR (XCAR (list))));
      while (CONSP (plist) && CONSP (XCDR (plist)))
	{
	  if (EQ (XCAR (plist), Qcomposition)
	      && (val = XCAR (XCDR (plist)), CONSP (val)))
621
	    XSETCAR (XCDR (plist), Fcons (XCAR (val), XCDR (val)));
622 623 624 625 626 627
	  plist = XCDR (XCDR (plist));
	}
    }
}


Kenichi Handa's avatar
Kenichi Handa committed
628 629 630 631 632 633 634
/* Make text in the region between START and END a composition that
   has COMPONENTS and MODIFICATION-FUNC.

   If STRING is non-nil, then operate on characters contained between
   indices START and END in STRING.  */

void
635 636
compose_text (EMACS_INT start, EMACS_INT end, Lisp_Object components,
	      Lisp_Object modification_func, Lisp_Object string)
Kenichi Handa's avatar
Kenichi Handa committed
637 638 639 640 641 642 643 644
{
  Lisp_Object prop;

  prop = Fcons (Fcons (make_number (end - start), components),
		modification_func);
  Fput_text_property  (make_number (start), make_number (end),
		       Qcomposition, prop, string);
}
645 646


647 648 649
static Lisp_Object autocmp_chars (Lisp_Object, EMACS_INT, EMACS_INT,
                                  EMACS_INT, struct window *,
                                  struct face *, Lisp_Object);
650 651 652 653 654 655 656 657 658 659


/* Lisp glyph-string handlers */

/* Hash table for automatic composition.  The key is a header of a
   lgstring (Lispy glyph-string), and the value is a body of a
   lgstring.  */

static Lisp_Object gstring_hash_table;

660
static Lisp_Object gstring_lookup_cache (Lisp_Object);
661 662

static Lisp_Object
663
gstring_lookup_cache (Lisp_Object header)
664 665
{
  struct Lisp_Hash_Table *h = XHASH_TABLE (gstring_hash_table);
666
  ptrdiff_t i = hash_lookup (h, header, NULL);
667 668 669 670 671

  return (i >= 0 ? HASH_VALUE (h, i) : Qnil);
}

Lisp_Object
672
composition_gstring_put_cache (Lisp_Object gstring, EMACS_INT len)
673 674
{
  struct Lisp_Hash_Table *h = XHASH_TABLE (gstring_hash_table);
675
  EMACS_UINT hash;
676
  Lisp_Object header, copy;
677
  EMACS_INT i;
678 679 680 681 682

  header = LGSTRING_HEADER (gstring);
  hash = h->hashfn (h, header);
  if (len < 0)
    {
683
      EMACS_INT j, glyph_len = LGSTRING_GLYPH_LEN (gstring);
684 685
      for (j = 0; j < glyph_len; j++)
	if (NILP (LGSTRING_GLYPH (gstring, j)))
686
	  break;
687
      len = j;
688
    }
Juanma Barranquero's avatar
Juanma Barranquero committed
689

690
  lint_assume (len <= TYPE_MAXIMUM (EMACS_INT) - 2);
691 692 693 694 695 696 697 698 699 700
  copy = Fmake_vector (make_number (len + 2), Qnil);
  LGSTRING_SET_HEADER (copy, Fcopy_sequence (header));
  for (i = 0; i < len; i++)
    LGSTRING_SET_GLYPH (copy, i, Fcopy_sequence (LGSTRING_GLYPH (gstring, i)));
  i = hash_put (h, LGSTRING_HEADER (copy), copy, hash);
  LGSTRING_SET_ID (copy, make_number (i));
  return copy;
}

Lisp_Object
701
composition_gstring_from_id (ptrdiff_t id)
702 703 704 705 706 707
{
  struct Lisp_Hash_Table *h = XHASH_TABLE (gstring_hash_table);

  return HASH_VALUE (h, id);
}

708 709 710
static Lisp_Object fill_gstring_header (Lisp_Object, Lisp_Object,
                                        Lisp_Object, Lisp_Object,
                                        Lisp_Object);
711 712

int
713
composition_gstring_p (Lisp_Object gstring)
714 715
{
  Lisp_Object header;
716
  EMACS_INT i;
717 718 719 720 721 722 723

  if (! VECTORP (gstring) || ASIZE (gstring) < 2)
    return 0;
  header = LGSTRING_HEADER (gstring);
  if (! VECTORP (header) || ASIZE (header) < 2)
    return 0;
  if (! NILP (LGSTRING_FONT (gstring))
724 725
      && (! FONT_OBJECT_P (LGSTRING_FONT (gstring))
	  && ! CODING_SYSTEM_P (LGSTRING_FONT (gstring))))
726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743
    return 0;
  for (i = 1; i < ASIZE (LGSTRING_HEADER (gstring)); i++)
    if (! NATNUMP (AREF (LGSTRING_HEADER (gstring), i)))
      return 0;
  if (! NILP (LGSTRING_ID (gstring)) && ! NATNUMP (LGSTRING_ID (gstring)))
    return 0;
  for (i = 0; i < LGSTRING_GLYPH_LEN (gstring); i++)
    {
      Lisp_Object glyph = LGSTRING_GLYPH (gstring, i);
      if (NILP (glyph))
	break;
      if (! VECTORP (glyph) || ASIZE (glyph) != LGLYPH_SIZE)
	return 0;
    }
  return 1;
}

int
744 745
composition_gstring_width (Lisp_Object gstring, EMACS_INT from, EMACS_INT to,
			   struct font_metrics *metrics)
746 747 748 749 750 751 752 753
{
  Lisp_Object *glyph;
  int width = 0;

  if (metrics)
    {
      Lisp_Object font_object = LGSTRING_FONT (gstring);

754 755 756 757 758 759 760 761 762 763 764 765
      if (FONT_OBJECT_P (font_object))
	{
	  struct font *font = XFONT_OBJECT (font_object);

	  metrics->ascent = font->ascent;
	  metrics->descent = font->descent;
	}
      else
	{
	  metrics->ascent = 1;
	  metrics->descent = 0;
	}
766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787
      metrics->width = metrics->lbearing = metrics->rbearing = 0;
    }
  for (glyph = &LGSTRING_GLYPH (gstring, from); from < to; from++, glyph++)
    {
      int x;

      if (NILP (LGLYPH_ADJUSTMENT (*glyph)))
	width += LGLYPH_WIDTH (*glyph);
      else
	width += LGLYPH_WADJUST (*glyph);
      if (metrics)
	{
	  x = metrics->width + LGLYPH_LBEARING (*glyph) + LGLYPH_XOFF (*glyph);
	  if (metrics->lbearing > x)
	    metrics->lbearing = x;
	  x = metrics->width + LGLYPH_RBEARING (*glyph) + LGLYPH_XOFF (*glyph);
	  if (metrics->rbearing < x)
	    metrics->rbearing = x;
	  metrics->width = width;
	  x = LGLYPH_ASCENT (*glyph) - LGLYPH_YOFF (*glyph);
	  if (metrics->ascent < x)
	    metrics->ascent = x;
788
	  x = LGLYPH_DESCENT (*glyph) + LGLYPH_YOFF (*glyph);
789 790 791 792 793 794 795 796 797 798 799 800
	  if (metrics->descent < x)
	    metrics->descent = x;
	}
    }
  return width;
}


static Lisp_Object gstring_work;
static Lisp_Object gstring_work_headers;

static Lisp_Object
801
fill_gstring_header (Lisp_Object header, Lisp_Object start, Lisp_Object end, Lisp_Object font_object, Lisp_Object string)
802 803 804 805 806 807
{
  EMACS_INT from, to, from_byte;
  EMACS_INT len, i;

  if (NILP (string))
    {
Tom Tromey's avatar
Tom Tromey committed
808
      if (NILP (BVAR (current_buffer, enable_multibyte_characters)))
809 810 811 812 813 814 815 816 817
	error ("Attempt to shape unibyte text");
      validate_region (&start, &end);
      from = XFASTINT (start);
      to = XFASTINT (end);
      from_byte = CHAR_TO_BYTE (from);
    }
  else
    {
      CHECK_STRING (string);
818
      if (! STRING_MULTIBYTE (string))
819
	error ("Attempt to shape unibyte text");
820
      /* FROM and TO are checked by the caller.  */
821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858
      from = XINT (start);
      to = XINT (end);
      if (from < 0 || from > to || to > SCHARS (string))
	args_out_of_range_3 (string, start, end);
      from_byte = string_char_to_byte (string, from);
    }

  len = to - from;
  if (len == 0)
    error ("Attempt to shape zero-length text");
  if (VECTORP (header))
    {
      if (ASIZE (header) != len + 1)
	args_out_of_range (header, make_number (len + 1));
    }
  else
    {
      if (len <= 8)
	header = AREF (gstring_work_headers, len - 1);
      else
	header = Fmake_vector (make_number (len + 1), Qnil);
    }

  ASET (header, 0, font_object);
  for (i = 0; i < len; i++)
    {
      int c;

      if (NILP (string))
	FETCH_CHAR_ADVANCE_NO_CHECK (c, from, from_byte);
      else
	FETCH_STRING_CHAR_ADVANCE_NO_CHECK (c, string, from, from_byte);
      ASET (header, i + 1, make_number (c));
    }
  return header;
}

static void
859
fill_gstring_body (Lisp_Object gstring)
860 861 862 863 864 865 866 867 868
{
  Lisp_Object font_object = LGSTRING_FONT (gstring);
  Lisp_Object header = AREF (gstring, 0);
  EMACS_INT len = LGSTRING_CHAR_LEN (gstring);
  EMACS_INT i;

  for (i = 0; i < len; i++)
    {
      Lisp_Object g = LGSTRING_GLYPH (gstring, i);
869
      int c = XFASTINT (AREF (header, i + 1));
870 871 872 873 874 875 876 877 878

      if (NILP (g))
	{
	  g = LGLYPH_NEW ();
	  LGSTRING_SET_GLYPH (gstring, i, g);
	}
      LGLYPH_SET_FROM (g, i);
      LGLYPH_SET_TO (g, i);
      LGLYPH_SET_CHAR (g, c);
879
      if (FONT_OBJECT_P (font_object))
880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900
	{
	  font_fill_lglyph_metrics (g, font_object);
	}
      else
	{
	  int width = XFASTINT (CHAR_TABLE_REF (Vchar_width_table, c));

	  LGLYPH_SET_CODE (g, c);
	  LGLYPH_SET_LBEARING (g, 0);
	  LGLYPH_SET_RBEARING (g, width);
	  LGLYPH_SET_WIDTH (g, width);
	  LGLYPH_SET_ASCENT (g, 1);
	  LGLYPH_SET_DESCENT (g, 0);
	}
      LGLYPH_SET_ADJUSTMENT (g, Qnil);
    }
  if (i < LGSTRING_GLYPH_LEN (gstring))
    LGSTRING_SET_GLYPH (gstring, i, Qnil);
}


901 902 903 904 905 906
/* Try to compose the characters at CHARPOS according to composition
   rule RULE ([PATTERN PREV-CHARS FUNC]).  LIMIT limits the characters
   to compose.  STRING, if not nil, is a target string.  WIN is a
   window where the characters are being displayed.  If characters are
   successfully composed, return the composition as a glyph-string
   object.  Otherwise return nil.  */
907 908

static Lisp_Object
909
autocmp_chars (Lisp_Object rule, EMACS_INT charpos, EMACS_INT bytepos, EMACS_INT limit, struct window *win, struct face *face, Lisp_Object string)
910 911 912 913
{
  int count = SPECPDL_INDEX ();
  FRAME_PTR f = XFRAME (win->frame);
  Lisp_Object pos = make_number (charpos);
914
  EMACS_INT to;
915
  EMACS_INT pt = PT, pt_byte = PT_BYTE;
916
  Lisp_Object re, font_object, lgstring;
917
  EMACS_INT len;
Juanma Barranquero's avatar
Juanma Barranquero committed
918

919
  record_unwind_save_match_data ();
920 921 922 923 924 925 926
  re = AREF (rule, 0);
  if (NILP (re))
    len = 1;
  else if (! STRINGP (re))
    return unbind_to (count, Qnil);
  else if ((len = fast_looking_at (re, charpos, bytepos, limit, -1, string))
	   > 0)
927
    {
928 929 930 931 932 933 934 935
      if (NILP (string))
	len = BYTE_TO_CHAR (bytepos + len) - charpos;
      else
	len = string_byte_to_char (string, bytepos + len) - charpos;
    }
  if (len <= 0)
    return unbind_to (count, Qnil);
  to = limit = charpos + len;
936
#ifdef HAVE_WINDOW_SYSTEM
937 938 939 940 941 942 943 944 945 946
  if (FRAME_WINDOW_P (f))
    {
      font_object = font_range (charpos, &to, win, face, string);
      if (! FONT_OBJECT_P (font_object)
	  || (! NILP (re)
	      && to < limit
	      && (fast_looking_at (re, charpos, bytepos, to, -1, string) <= 0)))
	return unbind_to (count, Qnil);
    }
  else
947
#endif	/* not HAVE_WINDOW_SYSTEM */
948 949 950 951 952 953
    font_object = win->frame;
  lgstring = Fcomposition_get_gstring (pos, make_number (to), font_object,
				       string);
  if (NILP (LGSTRING_ID (lgstring)))
    {
      Lisp_Object args[6];
Andreas Schwab's avatar
Andreas Schwab committed
954

955 956 957 958 959 960
      /* Save point as marker before calling out to lisp.  */
      if (NILP (string))
	{
	  Lisp_Object m = Fmake_marker ();
	  set_marker_both (m, Qnil, pt, pt_byte);
	  record_unwind_protect (restore_point_unwind, m);
961
	}
962 963 964 965 966 967 968 969

      args[0] = Vauto_composition_function;
      args[1] = AREF (rule, 2);
      args[2] = pos;
      args[3] = make_number (to);
      args[4] = font_object;
      args[5] = string;
      lgstring = safe_call (6, args);
970
    }
971
  return unbind_to (count, lgstring);
972 973
}

974 975
static Lisp_Object _work_val;

976 977 978
/* 1 iff the character C is composable.  Characters of general
   category Z? or C? are not composable except for ZWNJ and ZWJ. */

979
#define CHAR_COMPOSABLE_P(C)						\
980 981 982
  ((C) > ' '								\
   && ((C) == 0x200C || (C) == 0x200D					\
       || (_work_val = CHAR_TABLE_REF (Vunicode_category_table, (C)),	\
983 984
	   (INTEGERP (_work_val)					\
	    && (XINT (_work_val) <= UNICODE_CATEGORY_So)))))
985 986 987

/* Update cmp_it->stop_pos to the next position after CHARPOS (and
   BYTEPOS) where character composition may happen.  If BYTEPOS is
988 989 990 991 992 993 994 995 996 997
   negative, compute it.  ENDPOS is a limit of searching.  If it is
   less than CHARPOS, search backward to ENDPOS+1 assuming that
   set_iterator_to_next works in reverse order.  In this case, if a
   composition closest to CHARPOS is found, set cmp_it->stop_pos to
   the last character of the composition.

   If no composition is found, set cmp_it->ch to -2.  If a static
   composition is found, set cmp_it->ch to -1.  Otherwise, set
   cmp_it->ch to the character that triggers the automatic
   composition.  */
998 999

void
1000
composition_compute_stop_pos (struct composition_it *cmp_it, EMACS_INT charpos, EMACS_INT bytepos, EMACS_INT endpos, Lisp_Object string)
1001
{
1002 1003
  EMACS_INT start, end;
  int c;
1004
  Lisp_Object prop, val;
1005 1006
  /* This is from forward_to_next_line_start in xdisp.c.  */
  const int MAX_NEWLINE_DISTANCE = 500;
1007

1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023
  if (charpos < endpos)
    {
      if (endpos > charpos + MAX_NEWLINE_DISTANCE)
	endpos = charpos + MAX_NEWLINE_DISTANCE;
    }
  else if (endpos < charpos)
    {
      /* We search backward for a position to check composition.  */
      if (endpos < 0)
	{
	  /* But we don't know where to stop the searching.  */
	  endpos = NILP (string) ? BEGV - 1 : -1;
	  /* Usually we don't reach ENDPOS because we stop searching
	     at an uncomposable character (NL, LRE, etc).  */
	}
    }
1024
  cmp_it->id = -1;
1025
  cmp_it->ch = -2;
1026 1027 1028 1029 1030 1031 1032
  cmp_it->reversed_p = 0;
  cmp_it->stop_pos = endpos;
  if (charpos == endpos)
    return;
  /* FIXME: Bidi is not yet handled well in static composition.  */
  if (charpos < endpos
      && find_composition (charpos, endpos, &start, &end, &prop, string)
1033
      && start >= charpos
1034 1035 1036 1037 1038
      && COMPOSITION_VALID_P (start, end, prop))
    {
      cmp_it->stop_pos = endpos = start;
      cmp_it->ch = -1;
    }
Tom Tromey's avatar
Tom Tromey committed
1039
  if (NILP (BVAR (current_buffer, enable_multibyte_characters))
1040
      || NILP (Vauto_composition_mode))
1041 1042 1043
    return;
  if (bytepos < 0)
    {
1044
      if (NILP (string))
1045
	bytepos = CHAR_TO_BYTE (charpos);
1046 1047
      else
	bytepos = string_char_to_byte (string, charpos);
1048 1049 1050
    }

  start = charpos;
1051
  if (charpos < endpos)
1052
    {
1053 1054
      /* Forward search.  */
      while (charpos < endpos)
1055
	{
1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068
	  if (STRINGP (string))
	    FETCH_STRING_CHAR_ADVANCE (c, string, charpos, bytepos);
	  else
	    FETCH_CHAR_ADVANCE (c, charpos, bytepos);
	  if (c == '\n')
	    {
	      cmp_it->ch = -2;
	      break;
	    }
	  val = CHAR_TABLE_REF (Vcomposition_function_table, c);
	  if (! NILP (val))
	    {
	      Lisp_Object elt;
1069
	      int ridx;
1070

1071
	      for (ridx = 0; CONSP (val); val = XCDR (val), ridx++)
1072 1073 1074 1075 1076 1077 1078 1079 1080
		{
		  elt = XCAR (val);
		  if (VECTORP (elt) && ASIZE (elt) == 3
		      && NATNUMP (AREF (elt, 1))
		      && charpos - 1 - XFASTINT (AREF (elt, 1)) >= start)
		    break;
		}
	      if (CONSP (val))
		{
1081
		  cmp_it->rule_idx = ridx;
1082 1083 1084 1085 1086 1087
		  cmp_it->lookback = XFASTINT (AREF (elt, 1));
		  cmp_it->stop_pos = charpos - 1 - cmp_it->lookback;
		  cmp_it->ch = c;
		  return;
		}
	    }
1088
	}
1089 1090 1091 1092 1093 1094 1095 1096 1097 1098
      if (charpos == endpos)
	{
	  /* We couldn't find a composition point before ENDPOS.  But,
	     some character after ENDPOS may be composed with
	     characters before ENDPOS.  So, we should stop at the safe
	     point.  */
	  charpos = endpos - MAX_AUTO_COMPOSITION_LOOKBACK;
	  if (charpos < start)
	    charpos = start;
	}
1099
    }
1100
  else if (charpos > endpos)
1101 1102 1103 1104
    {
      /* Search backward for a pattern that may be composed and the
	 position of (possibly) the last character of the match is
	 closest to (but not after) START.  The reason for the last
1105 1106
	 character is that set_iterator_to_next works in reverse order,
	 and thus we must stop at the last character for composition
1107 1108 1109
	 check.  */
      unsigned char *p;
      int len;
1110 1111
      /* Limit byte position used in fast_looking_at.  This is the
	 byte position of the character after START. */
1112 1113 1114 1115 1116 1117 1118 1119 1120
      EMACS_INT limit;

      if (NILP (string))
	p = BYTE_POS_ADDR (bytepos);
      else
	p = SDATA (string) + bytepos;
      c = STRING_CHAR_AND_LENGTH (p, len);
      limit = bytepos + len;
      while (CHAR_COMPOSABLE_P (c))
1121
	{
1122 1123
	  val = CHAR_TABLE_REF (Vcomposition_function_table, c);
	  if (! NILP (val))
1124
	    {
1125
	      Lisp_Object elt;
1126
	      int ridx, back, blen;
1127

1128
	      for (ridx = 0; CONSP (val); val = XCDR (val), ridx++)
1129
		{
1130 1131 1132 1133
		  elt = XCAR (val);
		  if (VECTORP (elt) && ASIZE (elt) == 3
		      && NATNUMP (AREF (elt, 1))
		      && charpos - (back = XFASTINT (AREF (elt, 1))) > endpos)
1134
		    {
1135 1136 1137 1138
		      EMACS_INT cpos = charpos - back, bpos;

		      if (back == 0)
			bpos = bytepos;
1139
		      else
1140 1141 1142
			bpos = (NILP (string) ? CHAR_TO_BYTE (cpos)
				: string_char_to_byte (string, cpos));
		      if (STRINGP (AREF (elt, 0)))
1143 1144
			blen = fast_looking_at (AREF (elt, 0), cpos, bpos,
						start + 1, limit, string);
1145
		      else
1146 1147
			blen = 1;
		      if (blen > 0)
1148
			{