fns.c 134 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* Random utility Lisp functions.
2
   Copyright (C) 1985, 86, 87, 93, 94, 95, 97, 98, 99, 2000, 2001, 02, 2003
Gerd Moellmann's avatar
Gerd Moellmann committed
3
   Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
4 5 6 7 8

This file is part of GNU Emacs.

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

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
along with GNU Emacs; see the file COPYING.  If not, write to
19 20
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.  */
Jim Blandy's avatar
Jim Blandy committed
21

22
#include <config.h>
Jim Blandy's avatar
Jim Blandy committed
23

Andreas Schwab's avatar
Andreas Schwab committed
24 25 26
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
Andreas Schwab's avatar
Andreas Schwab committed
27
#include <time.h>
Andreas Schwab's avatar
Andreas Schwab committed
28

29 30 31
#ifndef MAC_OSX
/* On Mac OS X, defining this conflicts with precompiled headers.  */

Jim Blandy's avatar
Jim Blandy committed
32 33 34 35
/* Note on some machines this defines `vector' as a typedef,
   so make sure we don't use that name in this file.  */
#undef vector
#define vector *****
36 37 38

#endif  /* ! MAC_OSX */

Jim Blandy's avatar
Jim Blandy committed
39 40
#include "lisp.h"
#include "commands.h"
41
#include "character.h"
42
#include "coding.h"
Jim Blandy's avatar
Jim Blandy committed
43
#include "buffer.h"
Jim Blandy's avatar
Jim Blandy committed
44
#include "keyboard.h"
Stefan Monnier's avatar
Stefan Monnier committed
45
#include "keymap.h"
46
#include "intervals.h"
47 48
#include "frame.h"
#include "window.h"
Gerd Moellmann's avatar
Gerd Moellmann committed
49
#include "blockinput.h"
50
#if defined (HAVE_MENUS) && defined (HAVE_X_WINDOWS)
Andreas Schwab's avatar
Andreas Schwab committed
51 52
#include "xterm.h"
#endif
Jim Blandy's avatar
Jim Blandy committed
53

Karl Heuer's avatar
Karl Heuer committed
54
#ifndef NULL
55
#define NULL ((POINTER_TYPE *)0)
Karl Heuer's avatar
Karl Heuer committed
56 57
#endif

58 59 60 61
/* Nonzero enables use of dialog boxes for questions
   asked by mouse commands.  */
int use_dialog_box;

62 63
extern int minibuffer_auto_raise;
extern Lisp_Object minibuf_window;
64
extern Lisp_Object Vlocale_coding_system;
65

66
Lisp_Object Qstring_lessp, Qprovide, Qrequire;
67
Lisp_Object Qyes_or_no_p_history;
68
Lisp_Object Qcursor_in_echo_area;
Karl Heuer's avatar
Karl Heuer committed
69
Lisp_Object Qwidget_type;
70
Lisp_Object Qcodeset, Qdays, Qmonths, Qpaper;
Jim Blandy's avatar
Jim Blandy committed
71

72 73
extern Lisp_Object Qinput_method_function;

74
static int internal_equal ();
75 76 77 78 79 80 81

extern long get_random ();
extern void seed_random ();

#ifndef HAVE_UNISTD_H
extern long time ();
#endif
82

Jim Blandy's avatar
Jim Blandy committed
83
DEFUN ("identity", Fidentity, Sidentity, 1, 1, 0,
Pavel Janík's avatar
Pavel Janík committed
84
       doc: /* Return the argument unchanged.  */)
85
     (arg)
Jim Blandy's avatar
Jim Blandy committed
86 87 88 89 90 91
     Lisp_Object arg;
{
  return arg;
}

DEFUN ("random", Frandom, Srandom, 0, 1, 0,
92
       doc: /* Return a pseudo-random number.
Gerd Moellmann's avatar
Gerd Moellmann committed
93 94 95
All integers representable in Lisp are equally likely.
  On most systems, this is 28 bits' worth.
With positive integer argument N, return random number in interval [0,N).
96 97
With argument t, set the random number seed from the current time and pid. */)
     (n)
98
     Lisp_Object n;
Jim Blandy's avatar
Jim Blandy committed
99
{
100 101
  EMACS_INT val;
  Lisp_Object lispy_val;
102
  unsigned long denominator;
Jim Blandy's avatar
Jim Blandy committed
103

104
  if (EQ (n, Qt))
105
    seed_random (getpid () + time (NULL));
106
  if (NATNUMP (n) && XFASTINT (n) != 0)
Jim Blandy's avatar
Jim Blandy committed
107
    {
108 109 110 111
      /* Try to take our random number from the higher bits of VAL,
	 not the lower, since (says Gentzel) the low bits of `random'
	 are less random than the higher ones.  We do this by using the
	 quotient rather than the remainder.  At the high end of the RNG
112
	 it's possible to get a quotient larger than n; discarding
113
	 these values eliminates the bias that would otherwise appear
114 115
	 when using a large n.  */
      denominator = ((unsigned long)1 << VALBITS) / XFASTINT (n);
116
      do
117
	val = get_random () / denominator;
118
      while (val >= XFASTINT (n));
Jim Blandy's avatar
Jim Blandy committed
119
    }
120
  else
121
    val = get_random ();
122 123
  XSETINT (lispy_val, val);
  return lispy_val;
Jim Blandy's avatar
Jim Blandy committed
124 125 126 127 128
}

/* Random data-structure functions */

DEFUN ("length", Flength, Slength, 1, 1, 0,
129
       doc: /* Return the length of vector, list or string SEQUENCE.
Gerd Moellmann's avatar
Gerd Moellmann committed
130
A byte-code function object is also allowed.
John Paul Wallington's avatar
John Paul Wallington committed
131
If the string contains multibyte characters, this is not necessarily
Gerd Moellmann's avatar
Gerd Moellmann committed
132
the number of bytes in the string; it is the number of characters.
133 134
To get the number of bytes, use `string-bytes'. */)
     (sequence)
135
     register Lisp_Object sequence;
Jim Blandy's avatar
Jim Blandy committed
136
{
137
  register Lisp_Object val;
Jim Blandy's avatar
Jim Blandy committed
138 139 140
  register int i;

 retry:
141
  if (STRINGP (sequence))
142
    XSETFASTINT (val, SCHARS (sequence));
143 144 145
  else if (VECTORP (sequence))
    XSETFASTINT (val, XVECTOR (sequence)->size);
  else if (CHAR_TABLE_P (sequence))
146
    XSETFASTINT (val, MAX_CHAR);
147 148 149 150 151
  else if (BOOL_VECTOR_P (sequence))
    XSETFASTINT (val, XBOOL_VECTOR (sequence)->size);
  else if (COMPILEDP (sequence))
    XSETFASTINT (val, XVECTOR (sequence)->size & PSEUDOVECTOR_SIZE_MASK);
  else if (CONSP (sequence))
Jim Blandy's avatar
Jim Blandy committed
152
    {
153 154
      i = 0;
      while (CONSP (sequence))
Jim Blandy's avatar
Jim Blandy committed
155
	{
156
	  sequence = XCDR (sequence);
157 158 159 160 161 162 163 164
	  ++i;

	  if (!CONSP (sequence))
	    break;

	  sequence = XCDR (sequence);
	  ++i;
	  QUIT;
Jim Blandy's avatar
Jim Blandy committed
165 166
	}

167 168 169 170
      if (!NILP (sequence))
	wrong_type_argument (Qlistp, sequence);

      val = make_number (i);
Jim Blandy's avatar
Jim Blandy committed
171
    }
172
  else if (NILP (sequence))
173
    XSETFASTINT (val, 0);
Jim Blandy's avatar
Jim Blandy committed
174 175
  else
    {
176
      sequence = wrong_type_argument (Qsequencep, sequence);
Jim Blandy's avatar
Jim Blandy committed
177 178
      goto retry;
    }
179
  return val;
Jim Blandy's avatar
Jim Blandy committed
180 181
}

182 183 184 185
/* This does not check for quits.  That is safe
   since it must terminate.  */

DEFUN ("safe-length", Fsafe_length, Ssafe_length, 1, 1, 0,
186
       doc: /* Return the length of a list, but avoid error or infinite loop.
Gerd Moellmann's avatar
Gerd Moellmann committed
187 188
This function never gets an error.  If LIST is not really a list,
it returns 0.  If LIST is circular, it returns a finite value
189 190
which is at least the number of distinct elements. */)
     (list)
191 192 193 194 195 196 197
     Lisp_Object list;
{
  Lisp_Object tail, halftail, length;
  int len = 0;

  /* halftail is used to detect circular lists.  */
  halftail = list;
198
  for (tail = list; CONSP (tail); tail = XCDR (tail))
199 200
    {
      if (EQ (tail, halftail) && len != 0)
201
	break;
202
      len++;
203
      if ((len & 1) == 0)
204
	halftail = XCDR (halftail);
205 206 207 208 209 210
    }

  XSETINT (length, len);
  return length;
}

211
DEFUN ("string-bytes", Fstring_bytes, Sstring_bytes, 1, 1, 0,
212 213 214
       doc: /* Return the number of bytes in STRING.
If STRING is a multibyte string, this is greater than the length of STRING. */)
     (string)
215
     Lisp_Object string;
216
{
217
  CHECK_STRING (string);
218
  return make_number (SBYTES (string));
219 220
}

Jim Blandy's avatar
Jim Blandy committed
221
DEFUN ("string-equal", Fstring_equal, Sstring_equal, 2, 2, 0,
222
       doc: /* Return t if two strings have identical contents.
Gerd Moellmann's avatar
Gerd Moellmann committed
223
Case is significant, but text properties are ignored.
224 225
Symbols are also allowed; their print names are used instead. */)
     (s1, s2)
Jim Blandy's avatar
Jim Blandy committed
226 227
     register Lisp_Object s1, s2;
{
228
  if (SYMBOLP (s1))
229
    s1 = SYMBOL_NAME (s1);
230
  if (SYMBOLP (s2))
231
    s2 = SYMBOL_NAME (s2);
232 233
  CHECK_STRING (s1);
  CHECK_STRING (s2);
Jim Blandy's avatar
Jim Blandy committed
234

235 236 237
  if (SCHARS (s1) != SCHARS (s2)
      || SBYTES (s1) != SBYTES (s2)
      || bcmp (SDATA (s1), SDATA (s2), SBYTES (s1)))
Jim Blandy's avatar
Jim Blandy committed
238 239 240 241
    return Qnil;
  return Qt;
}

242
DEFUN ("compare-strings", Fcompare_strings,
243
       Scompare_strings, 6, 7, 0,
244
doc: /* Compare the contents of two strings, converting to multibyte if needed.
Gerd Moellmann's avatar
Gerd Moellmann committed
245 246 247 248 249 250 251 252 253 254 255
In string STR1, skip the first START1 characters and stop at END1.
In string STR2, skip the first START2 characters and stop at END2.
END1 and END2 default to the full lengths of the respective strings.

Case is significant in this comparison if IGNORE-CASE is nil.
Unibyte strings are converted to multibyte for comparison.

The value is t if the strings (or specified portions) match.
If string STR1 is less, the value is a negative number N;
  - 1 - N is the number of characters that match at the beginning.
If string STR1 is greater, the value is a positive number N;
256 257
  N - 1 is the number of characters that match at the beginning. */)
     (str1, start1, end1, str2, start2, end2, ignore_case)
258 259 260 261 262
     Lisp_Object str1, start1, end1, start2, str2, end2, ignore_case;
{
  register int end1_char, end2_char;
  register int i1, i1_byte, i2, i2_byte;

263 264
  CHECK_STRING (str1);
  CHECK_STRING (str2);
265 266 267 268
  if (NILP (start1))
    start1 = make_number (0);
  if (NILP (start2))
    start2 = make_number (0);
269 270
  CHECK_NATNUM (start1);
  CHECK_NATNUM (start2);
271
  if (! NILP (end1))
272
    CHECK_NATNUM (end1);
273
  if (! NILP (end2))
274
    CHECK_NATNUM (end2);
275 276 277 278 279 280 281

  i1 = XINT (start1);
  i2 = XINT (start2);

  i1_byte = string_char_to_byte (str1, i1);
  i2_byte = string_char_to_byte (str2, i2);

282
  end1_char = SCHARS (str1);
283 284 285
  if (! NILP (end1) && end1_char > XINT (end1))
    end1_char = XINT (end1);

286
  end2_char = SCHARS (str2);
287 288 289 290 291 292 293 294 295 296
  if (! NILP (end2) && end2_char > XINT (end2))
    end2_char = XINT (end2);

  while (i1 < end1_char && i2 < end2_char)
    {
      /* When we find a mismatch, we must compare the
	 characters, not just the bytes.  */
      int c1, c2;

      if (STRING_MULTIBYTE (str1))
297
	FETCH_STRING_CHAR_ADVANCE_NO_CHECK (c1, str1, i1, i1_byte);
298 299
      else
	{
300
	  c1 = SREF (str1, i1++);
301 302 303 304
	  c1 = unibyte_char_to_multibyte (c1);
	}

      if (STRING_MULTIBYTE (str2))
305
	FETCH_STRING_CHAR_ADVANCE_NO_CHECK (c2, str2, i2, i2_byte);
306 307
      else
	{
308
	  c2 = SREF (str2, i2++);
309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331
	  c2 = unibyte_char_to_multibyte (c2);
	}

      if (c1 == c2)
	continue;

      if (! NILP (ignore_case))
	{
	  Lisp_Object tem;

	  tem = Fupcase (make_number (c1));
	  c1 = XINT (tem);
	  tem = Fupcase (make_number (c2));
	  c2 = XINT (tem);
	}

      if (c1 == c2)
	continue;

      /* Note that I1 has already been incremented
	 past the character that we are comparing;
	 hence we don't add or subtract 1 here.  */
      if (c1 < c2)
332
	return make_number (- i1 + XINT (start1));
333
      else
334
	return make_number (i1 - XINT (start1));
335 336 337 338 339 340 341 342 343 344
    }

  if (i1 < end1_char)
    return make_number (i1 - XINT (start1) + 1);
  if (i2 < end2_char)
    return make_number (- i1 + XINT (start1) - 1);

  return Qt;
}

Jim Blandy's avatar
Jim Blandy committed
345
DEFUN ("string-lessp", Fstring_lessp, Sstring_lessp, 2, 2, 0,
346
       doc: /* Return t if first arg string is less than second in lexicographic order.
Gerd Moellmann's avatar
Gerd Moellmann committed
347
Case is significant.
348 349
Symbols are also allowed; their print names are used instead. */)
     (s1, s2)
Jim Blandy's avatar
Jim Blandy committed
350 351 352
     register Lisp_Object s1, s2;
{
  register int end;
353
  register int i1, i1_byte, i2, i2_byte;
Jim Blandy's avatar
Jim Blandy committed
354

355
  if (SYMBOLP (s1))
356
    s1 = SYMBOL_NAME (s1);
357
  if (SYMBOLP (s2))
358
    s2 = SYMBOL_NAME (s2);
359 360
  CHECK_STRING (s1);
  CHECK_STRING (s2);
Jim Blandy's avatar
Jim Blandy committed
361

362 363
  i1 = i1_byte = i2 = i2_byte = 0;

364 365 366
  end = SCHARS (s1);
  if (end > SCHARS (s2))
    end = SCHARS (s2);
Jim Blandy's avatar
Jim Blandy committed
367

368
  while (i1 < end)
Jim Blandy's avatar
Jim Blandy committed
369
    {
370 371 372 373
      /* When we find a mismatch, we must compare the
	 characters, not just the bytes.  */
      int c1, c2;

374 375
      FETCH_STRING_CHAR_ADVANCE (c1, s1, i1, i1_byte);
      FETCH_STRING_CHAR_ADVANCE (c2, s2, i2, i2_byte);
376 377 378

      if (c1 != c2)
	return c1 < c2 ? Qt : Qnil;
Jim Blandy's avatar
Jim Blandy committed
379
    }
380
  return i1 < SCHARS (s2) ? Qt : Qnil;
Jim Blandy's avatar
Jim Blandy committed
381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399
}

static Lisp_Object concat ();

/* ARGSUSED */
Lisp_Object
concat2 (s1, s2)
     Lisp_Object s1, s2;
{
#ifdef NO_ARG_ARRAY
  Lisp_Object args[2];
  args[0] = s1;
  args[1] = s2;
  return concat (2, args, Lisp_String, 0);
#else
  return concat (2, &s1, Lisp_String, 0);
#endif /* NO_ARG_ARRAY */
}

Richard M. Stallman's avatar
Richard M. Stallman committed
400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415
/* ARGSUSED */
Lisp_Object
concat3 (s1, s2, s3)
     Lisp_Object s1, s2, s3;
{
#ifdef NO_ARG_ARRAY
  Lisp_Object args[3];
  args[0] = s1;
  args[1] = s2;
  args[2] = s3;
  return concat (3, args, Lisp_String, 0);
#else
  return concat (3, &s1, Lisp_String, 0);
#endif /* NO_ARG_ARRAY */
}

Jim Blandy's avatar
Jim Blandy committed
416
DEFUN ("append", Fappend, Sappend, 0, MANY, 0,
417
       doc: /* Concatenate all the arguments and make the result a list.
Gerd Moellmann's avatar
Gerd Moellmann committed
418 419
The result is a list whose elements are the elements of all the arguments.
Each argument may be a list, vector or string.
420 421
The last argument is not copied, just used as the tail of the new list.
usage: (append &rest SEQUENCES)  */)
422
     (nargs, args)
Jim Blandy's avatar
Jim Blandy committed
423 424 425 426 427 428 429
     int nargs;
     Lisp_Object *args;
{
  return concat (nargs, args, Lisp_Cons, 1);
}

DEFUN ("concat", Fconcat, Sconcat, 0, MANY, 0,
430
       doc: /* Concatenate all the arguments and make the result a string.
Gerd Moellmann's avatar
Gerd Moellmann committed
431
The result is a string whose elements are the elements of all the arguments.
432 433
Each argument may be a string or a list or vector of characters (integers).
usage: (concat &rest SEQUENCES)  */)
434
     (nargs, args)
Jim Blandy's avatar
Jim Blandy committed
435 436 437 438 439 440 441
     int nargs;
     Lisp_Object *args;
{
  return concat (nargs, args, Lisp_String, 0);
}

DEFUN ("vconcat", Fvconcat, Svconcat, 0, MANY, 0,
442
       doc: /* Concatenate all the arguments and make the result a vector.
Gerd Moellmann's avatar
Gerd Moellmann committed
443
The result is a vector whose elements are the elements of all the arguments.
444 445
Each argument may be a list, vector or string.
usage: (vconcat &rest SEQUENCES)   */)
446
     (nargs, args)
Jim Blandy's avatar
Jim Blandy committed
447 448 449
     int nargs;
     Lisp_Object *args;
{
450
  return concat (nargs, args, Lisp_Vectorlike, 0);
Jim Blandy's avatar
Jim Blandy committed
451 452
}

453

Jim Blandy's avatar
Jim Blandy committed
454
DEFUN ("copy-sequence", Fcopy_sequence, Scopy_sequence, 1, 1, 0,
Dave Love's avatar
Dave Love committed
455
       doc: /* Return a copy of a list, vector, string or char-table.
Gerd Moellmann's avatar
Gerd Moellmann committed
456
The elements of a list or vector are not copied; they are shared
457 458
with the original. */)
     (arg)
Jim Blandy's avatar
Jim Blandy committed
459 460
     Lisp_Object arg;
{
Jim Blandy's avatar
Jim Blandy committed
461
  if (NILP (arg)) return arg;
462 463 464

  if (CHAR_TABLE_P (arg))
    {
465
      return copy_char_table (arg);
466 467 468 469 470 471
    }

  if (BOOL_VECTOR_P (arg))
    {
      Lisp_Object val;
      int size_in_chars
472
	= (XBOOL_VECTOR (arg)->size + BITS_PER_CHAR - 1) / BITS_PER_CHAR;
473 474 475 476 477 478 479

      val = Fmake_bool_vector (Flength (arg), Qnil);
      bcopy (XBOOL_VECTOR (arg)->data, XBOOL_VECTOR (val)->data,
	     size_in_chars);
      return val;
    }

480
  if (!CONSP (arg) && !VECTORP (arg) && !STRINGP (arg))
Jim Blandy's avatar
Jim Blandy committed
481 482 483 484
    arg = wrong_type_argument (Qsequencep, arg);
  return concat (1, &arg, CONSP (arg) ? Lisp_Cons : XTYPE (arg), 0);
}

485
#if 0				/* unused */
486 487 488 489 490 491 492 493 494 495
/* In string STR of length LEN, see if bytes before STR[I] combine
   with bytes after STR[I] to form a single character.  If so, return
   the number of bytes after STR[I] which combine in this way.
   Otherwize, return 0.  */

static int
count_combining (str, len, i)
     unsigned char *str;
     int len, i;
{
496
  int j = i - 1, bytes;
497 498 499 500 501 502

  if (i == 0 || i == len || CHAR_HEAD_P (str[i]))
    return 0;
  while (j >= 0 && !CHAR_HEAD_P (str[j])) j--;
  if (j < 0 || ! BASE_LEADING_CODE_P (str[j]))
    return 0;
503 504
  PARSE_MULTIBYTE_SEQ (str + j, len - j, bytes);
  return (bytes <= i - j ? 0 : bytes - (i - j));
505
}
506
#endif
507 508 509

/* This structure holds information of an argument of `concat' that is
   a string and has text properties to be copied.  */
Kenichi Handa's avatar
Kenichi Handa committed
510
struct textprop_rec
511 512 513 514 515 516
{
  int argnum;			/* refer to ARGS (arguments of `concat') */
  int from;			/* refer to ARGS[argnum] (argument string) */
  int to;			/* refer to VAL (the target string) */
};

Jim Blandy's avatar
Jim Blandy committed
517 518 519 520 521 522 523 524 525 526 527
static Lisp_Object
concat (nargs, args, target_type, last_special)
     int nargs;
     Lisp_Object *args;
     enum Lisp_Type target_type;
     int last_special;
{
  Lisp_Object val;
  register Lisp_Object tail;
  register Lisp_Object this;
  int toindex;
528
  int toindex_byte = 0;
529 530
  register int result_len;
  register int result_len_byte;
Jim Blandy's avatar
Jim Blandy committed
531 532 533
  register int argnum;
  Lisp_Object last_tail;
  Lisp_Object prev;
534
  int some_multibyte;
535 536 537 538 539
  /* When we make a multibyte string, we can't copy text properties
     while concatinating each string because the length of resulting
     string can't be decided until we finish the whole concatination.
     So, we record strings that have text properties to be copied
     here, and copy the text properties after the concatination.  */
540
  struct textprop_rec  *textprops = NULL;
Kenichi Handa's avatar
Kenichi Handa committed
541 542
  /* Number of elments in textprops.  */
  int num_textprops = 0;
Jim Blandy's avatar
Jim Blandy committed
543

544 545
  tail = Qnil;

Jim Blandy's avatar
Jim Blandy committed
546 547 548 549 550 551 552 553 554
  /* In append, the last arg isn't treated like the others */
  if (last_special && nargs > 0)
    {
      nargs--;
      last_tail = args[nargs];
    }
  else
    last_tail = Qnil;

555
  /* Canonicalize each argument.  */
Jim Blandy's avatar
Jim Blandy committed
556 557 558
  for (argnum = 0; argnum < nargs; argnum++)
    {
      this = args[argnum];
559
      if (!(CONSP (this) || NILP (this) || VECTORP (this) || STRINGP (this)
560
	    || COMPILEDP (this) || BOOL_VECTOR_P (this)))
Jim Blandy's avatar
Jim Blandy committed
561 562 563 564 565
	{
	    args[argnum] = wrong_type_argument (Qsequencep, this);
	}
    }

566 567 568 569 570 571 572 573
  /* Compute total length in chars of arguments in RESULT_LEN.
     If desired output is a string, also compute length in bytes
     in RESULT_LEN_BYTE, and determine in SOME_MULTIBYTE
     whether the result should be a multibyte string.  */
  result_len_byte = 0;
  result_len = 0;
  some_multibyte = 0;
  for (argnum = 0; argnum < nargs; argnum++)
Jim Blandy's avatar
Jim Blandy committed
574
    {
575
      int len;
Jim Blandy's avatar
Jim Blandy committed
576
      this = args[argnum];
577 578
      len = XFASTINT (Flength (this));
      if (target_type == Lisp_String)
579
	{
580 581
	  /* We must count the number of bytes needed in the string
	     as well as the number of characters.  */
582 583
	  int i;
	  Lisp_Object ch;
584
	  int this_len_byte;
585

586
	  if (VECTORP (this))
587
	    for (i = 0; i < len; i++)
588 589
	      {
		ch = XVECTOR (this)->contents[i];
Dave Love's avatar
Dave Love committed
590 591
		if (! CHARACTERP (ch))
		  wrong_type_argument (Qcharacterp, ch);
592
		this_len_byte = CHAR_BYTES (XINT (ch));
593
		result_len_byte += this_len_byte;
594
		if (! ASCII_CHAR_P (XINT (ch)) && ! CHAR_BYTE8_P (XINT (ch)))
595
		  some_multibyte = 1;
596
	      }
597 598
	  else if (BOOL_VECTOR_P (this) && XBOOL_VECTOR (this)->size > 0)
	    wrong_type_argument (Qintegerp, Faref (this, make_number (0)));
599
	  else if (CONSP (this))
600
	    for (; CONSP (this); this = XCDR (this))
601
	      {
602
		ch = XCAR (this);
Dave Love's avatar
Dave Love committed
603 604
		if (! CHARACTERP (ch))
		  wrong_type_argument (Qcharacterp, ch);
605
		this_len_byte = CHAR_BYTES (XINT (ch));
606
		result_len_byte += this_len_byte;
607
		if (! ASCII_CHAR_P (XINT (ch)) && ! CHAR_BYTE8_P (XINT (ch)))
608
		  some_multibyte = 1;
609
	      }
610
	  else if (STRINGP (this))
611
	    {
612
	      if (STRING_MULTIBYTE (this))
613 614
		{
		  some_multibyte = 1;
615
		  result_len_byte += SBYTES (this);
616 617
		}
	      else
618 619
		result_len_byte += count_size_as_multibyte (SDATA (this),
							    SCHARS (this));
620
	    }
621
	}
622 623

      result_len += len;
Jim Blandy's avatar
Jim Blandy committed
624 625
    }

626 627
  if (! some_multibyte)
    result_len_byte = result_len;
Jim Blandy's avatar
Jim Blandy committed
628

629
  /* Create the output object.  */
Jim Blandy's avatar
Jim Blandy committed
630
  if (target_type == Lisp_Cons)
631
    val = Fmake_list (make_number (result_len), Qnil);
632
  else if (target_type == Lisp_Vectorlike)
633
    val = Fmake_vector (make_number (result_len), Qnil);
634
  else if (some_multibyte)
635
    val = make_uninit_multibyte_string (result_len, result_len_byte);
636 637
  else
    val = make_uninit_string (result_len);
Jim Blandy's avatar
Jim Blandy committed
638

639 640 641
  /* In `append', if all but last arg are nil, return last arg.  */
  if (target_type == Lisp_Cons && EQ (val, Qnil))
    return last_tail;
Jim Blandy's avatar
Jim Blandy committed
642

643
  /* Copy the contents of the args into the result.  */
Jim Blandy's avatar
Jim Blandy committed
644
  if (CONSP (val))
645
    tail = val, toindex = -1; /* -1 in toindex is flag we are making a list */
Jim Blandy's avatar
Jim Blandy committed
646
  else
647
    toindex = 0, toindex_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
648 649

  prev = Qnil;
650
  if (STRINGP (val))
Kenichi Handa's avatar
Kenichi Handa committed
651 652
    textprops
      = (struct textprop_rec *) alloca (sizeof (struct textprop_rec) * nargs);
Jim Blandy's avatar
Jim Blandy committed
653 654 655 656

  for (argnum = 0; argnum < nargs; argnum++)
    {
      Lisp_Object thislen;
657
      int thisleni = 0;
658
      register unsigned int thisindex = 0;
659
      register unsigned int thisindex_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
660 661 662 663 664

      this = args[argnum];
      if (!CONSP (this))
	thislen = Flength (this), thisleni = XINT (thislen);

665 666 667
      /* Between strings of the same kind, copy fast.  */
      if (STRINGP (this) && STRINGP (val)
	  && STRING_MULTIBYTE (this) == some_multibyte)
Jim Blandy's avatar
Jim Blandy committed
668
	{
669
	  int thislen_byte = SBYTES (this);
670

671 672 673
	  bcopy (SDATA (this), SDATA (val) + toindex_byte,
		 SBYTES (this));
	  if (! NULL_INTERVAL_P (STRING_INTERVALS (this)))
674
	    {
Kenichi Handa's avatar
Kenichi Handa committed
675
	      textprops[num_textprops].argnum = argnum;
676
	      textprops[num_textprops].from = 0;
Kenichi Handa's avatar
Kenichi Handa committed
677
	      textprops[num_textprops++].to = toindex;
678
	    }
679
	  toindex_byte += thislen_byte;
680
	  toindex += thisleni;
681
	}
682 683 684
      /* Copy a single-byte string to a multibyte string.  */
      else if (STRINGP (this) && STRINGP (val))
	{
685
	  if (! NULL_INTERVAL_P (STRING_INTERVALS (this)))
686
	    {
Kenichi Handa's avatar
Kenichi Handa committed
687 688 689
	      textprops[num_textprops].argnum = argnum;
	      textprops[num_textprops].from = 0;
	      textprops[num_textprops++].to = toindex;
690
	    }
691 692 693
	  toindex_byte += copy_text (SDATA (this),
				     SDATA (val) + toindex_byte,
				     SCHARS (this), 0, 1);
694 695
	  toindex += thisleni;
	}
696 697 698 699 700 701 702 703 704 705
      else
	/* Copy element by element.  */
	while (1)
	  {
	    register Lisp_Object elt;

	    /* Fetch next element of `this' arg into `elt', or break if
	       `this' is exhausted. */
	    if (NILP (this)) break;
	    if (CONSP (this))
706
	      elt = XCAR (this), this = XCDR (this);
707 708 709
	    else if (thisindex >= thisleni)
	      break;
	    else if (STRINGP (this))
710
	      {
711
		int c;
712
		if (STRING_MULTIBYTE (this))
713
		  {
714 715 716
		    FETCH_STRING_CHAR_ADVANCE_NO_CHECK (c, this,
							thisindex,
							thisindex_byte);
717
		    XSETFASTINT (elt, c);
718
		  }
719
		else
720
		  {
721
		    XSETFASTINT (elt, SREF (this, thisindex++));
722
		    if (some_multibyte
723
			&& XINT (elt) >= 0200
724 725
			&& XINT (elt) < 0400)
		      {
726
			c = unibyte_char_to_multibyte (XINT (elt));
727 728
			XSETINT (elt, c);
		      }
729
		  }
730 731 732 733 734 735 736
	      }
	    else if (BOOL_VECTOR_P (this))
	      {
		int byte;
		byte = XBOOL_VECTOR (this)->data[thisindex / BITS_PER_CHAR];
		if (byte & (1 << (thisindex % BITS_PER_CHAR)))
		  elt = Qt;
737
		else
738 739
		  elt = Qnil;
		thisindex++;
740
	      }
741 742
	    else
	      elt = XVECTOR (this)->contents[thisindex++];
Jim Blandy's avatar
Jim Blandy committed
743

744 745
	    /* Store this element into the result.  */
	    if (toindex < 0)
Jim Blandy's avatar
Jim Blandy committed
746
	      {
747
		XSETCAR (tail, elt);
748
		prev = tail;
749
		tail = XCDR (tail);
Jim Blandy's avatar
Jim Blandy committed
750
	      }
751 752 753 754
	    else if (VECTORP (val))
	      XVECTOR (val)->contents[toindex++] = elt;
	    else
	      {
755
		CHECK_NUMBER (elt);
756
		if (some_multibyte)
Kenichi Handa's avatar
Kenichi Handa committed
757 758
		  toindex_byte += CHAR_STRING (XINT (elt),
					       SDATA (val) + toindex_byte);
759
		else
Kenichi Handa's avatar
Kenichi Handa committed
760
		  SSET (val, toindex_byte++, XINT (elt));
761
		toindex++;
762 763
	      }
	  }
Jim Blandy's avatar
Jim Blandy committed
764
    }
Jim Blandy's avatar
Jim Blandy committed
765
  if (!NILP (prev))
766
    XSETCDR (prev, last_tail);
Jim Blandy's avatar
Jim Blandy committed
767

Kenichi Handa's avatar
Kenichi Handa committed
768
  if (num_textprops > 0)
769
    {
770
      Lisp_Object props;
771
      int last_to_end = -1;
772

Kenichi Handa's avatar
Kenichi Handa committed
773
      for (argnum = 0; argnum < num_textprops; argnum++)
774
	{
Kenichi Handa's avatar
Kenichi Handa committed
775
	  this = args[textprops[argnum].argnum];
776 777
	  props = text_property_list (this,
				      make_number (0),
778
				      make_number (SCHARS (this)),
779 780 781
				      Qnil);
	  /* If successive arguments have properites, be sure that the
	     value of `composition' property be the copy.  */
782
	  if (last_to_end == textprops[argnum].to)
783 784 785
	    make_composition_value_copy (props);
	  add_text_properties_from_list (val, props,
					 make_number (textprops[argnum].to));
786
	  last_to_end = textprops[argnum].to + SCHARS (this);
787 788
	}
    }
Karl Heuer's avatar
Karl Heuer committed
789
  return val;
Jim Blandy's avatar
Jim Blandy committed
790 791
}

792 793 794 795
static Lisp_Object string_char_byte_cache_string;
static int string_char_byte_cache_charpos;
static int string_char_byte_cache_bytepos;

796 797 798 799 800 801
void
clear_string_char_byte_cache ()
{
  string_char_byte_cache_string = Qnil;
}

802 803 804 805 806 807 808
/* Return the character index corresponding to CHAR_INDEX in STRING.  */

int
string_char_to_byte (string, char_index)
     Lisp_Object string;
     int char_index;
{
Dave Love's avatar
Dave Love committed
809
  int i_byte;
810 811
  int best_below, best_below_byte;
  int best_above, best_above_byte;
812 813 814 815

  if (! STRING_MULTIBYTE (string))
    return char_index;

816
  best_below = best_below_byte = 0;
817 818
  best_above = SCHARS (string);
  best_above_byte = SBYTES (string);
819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835

  if (EQ (string, string_char_byte_cache_string))
    {
      if (string_char_byte_cache_charpos < char_index)
	{
	  best_below = string_char_byte_cache_charpos;
	  best_below_byte = string_char_byte_cache_bytepos;
	}
      else
	{
	  best_above = string_char_byte_cache_charpos;
	  best_above_byte = string_char_byte_cache_bytepos;
	}
    }

  if (char_index - best_below < best_above - char_index)
    {
Kenichi Handa's avatar
Kenichi Handa committed
836
      unsigned char *p = SDATA (string) + best_below_byte;
837

838 839
      while (best_below < char_index)
	{
840 841
	  p += BYTES_BY_CHAR_HEAD (*p);
	  best_below++;
842
	}
Kenichi Handa's avatar
Kenichi Handa committed
843
      i_byte = p - SDATA (string);
844 845
    }
  else
846
    {
Kenichi Handa's avatar
Kenichi Handa committed
847
      unsigned char *p = SDATA (string