the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
-#define DOC_STRINGS_IN_COMMENTS
-
#include <config.h>
#ifdef HAVE_UNISTD_H
#endif
\f
DEFUN ("identity", Fidentity, Sidentity, 1, 1, 0,
- /* Return the argument unchanged. */
- (arg))
+ doc: /* Return the argument unchanged. */)
+ (arg)
Lisp_Object arg;
{
return arg;
}
DEFUN ("random", Frandom, Srandom, 0, 1, 0,
- /* Return a pseudo-random number.
+ doc: /* Return a pseudo-random number.
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).
-With argument t, set the random number seed from the current time and pid. */
- (n))
+With argument t, set the random number seed from the current time and pid. */)
+ (n)
Lisp_Object n;
{
EMACS_INT val;
/* Random data-structure functions */
DEFUN ("length", Flength, Slength, 1, 1, 0,
- /* Return the length of vector, list or string SEQUENCE.
+ doc: /* Return the length of vector, list or string SEQUENCE.
A byte-code function object is also allowed.
If the string contains multibyte characters, this is not the necessarily
the number of bytes in the string; it is the number of characters.
-To get the number of bytes, use `string-bytes'. */
- (sequence))
+To get the number of bytes, use `string-bytes'. */)
+ (sequence)
register Lisp_Object sequence;
{
register Lisp_Object val;
since it must terminate. */
DEFUN ("safe-length", Fsafe_length, Ssafe_length, 1, 1, 0,
- /* Return the length of a list, but avoid error or infinite loop.
+ doc: /* Return the length of a list, but avoid error or infinite loop.
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
-which is at least the number of distinct elements. */
- (list))
+which is at least the number of distinct elements. */)
+ (list)
Lisp_Object list;
{
Lisp_Object tail, halftail, length;
}
DEFUN ("string-bytes", Fstring_bytes, Sstring_bytes, 1, 1, 0,
- /* Return the number of bytes in STRING.
-If STRING is a multibyte string, this is greater than the length of STRING. */
- (string))
+ doc: /* Return the number of bytes in STRING.
+If STRING is a multibyte string, this is greater than the length of STRING. */)
+ (string)
Lisp_Object string;
{
- CHECK_STRING (string, 1);
+ CHECK_STRING (string);
return make_number (STRING_BYTES (XSTRING (string)));
}
DEFUN ("string-equal", Fstring_equal, Sstring_equal, 2, 2, 0,
- /* Return t if two strings have identical contents.
+ doc: /* Return t if two strings have identical contents.
Case is significant, but text properties are ignored.
-Symbols are also allowed; their print names are used instead. */
- (s1, s2))
+Symbols are also allowed; their print names are used instead. */)
+ (s1, s2)
register Lisp_Object s1, s2;
{
if (SYMBOLP (s1))
- XSETSTRING (s1, XSYMBOL (s1)->name);
+ s1 = SYMBOL_NAME (s1);
if (SYMBOLP (s2))
- XSETSTRING (s2, XSYMBOL (s2)->name);
- CHECK_STRING (s1, 0);
- CHECK_STRING (s2, 1);
+ s2 = SYMBOL_NAME (s2);
+ CHECK_STRING (s1);
+ CHECK_STRING (s2);
if (XSTRING (s1)->size != XSTRING (s2)->size
|| STRING_BYTES (XSTRING (s1)) != STRING_BYTES (XSTRING (s2))
DEFUN ("compare-strings", Fcompare_strings,
Scompare_strings, 6, 7, 0,
-/* Compare the contents of two strings, converting to multibyte if needed.
+doc: /* Compare the contents of two strings, converting to multibyte if needed.
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.
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;
- N - 1 is the number of characters that match at the beginning. */
- (str1, start1, end1, str2, start2, end2, ignore_case))
+ N - 1 is the number of characters that match at the beginning. */)
+ (str1, start1, end1, str2, start2, end2, ignore_case)
Lisp_Object str1, start1, end1, start2, str2, end2, ignore_case;
{
register int end1_char, end2_char;
register int i1, i1_byte, i2, i2_byte;
- CHECK_STRING (str1, 0);
- CHECK_STRING (str2, 1);
+ CHECK_STRING (str1);
+ CHECK_STRING (str2);
if (NILP (start1))
start1 = make_number (0);
if (NILP (start2))
start2 = make_number (0);
- CHECK_NATNUM (start1, 2);
- CHECK_NATNUM (start2, 3);
+ CHECK_NATNUM (start1);
+ CHECK_NATNUM (start2);
if (! NILP (end1))
- CHECK_NATNUM (end1, 4);
+ CHECK_NATNUM (end1);
if (! NILP (end2))
- CHECK_NATNUM (end2, 4);
+ CHECK_NATNUM (end2);
i1 = XINT (start1);
i2 = XINT (start2);
}
DEFUN ("string-lessp", Fstring_lessp, Sstring_lessp, 2, 2, 0,
-/* Return t if first arg string is less than second in lexicographic order.
+ doc: /* Return t if first arg string is less than second in lexicographic order.
Case is significant.
-Symbols are also allowed; their print names are used instead. */
- (s1, s2))
+Symbols are also allowed; their print names are used instead. */)
+ (s1, s2)
register Lisp_Object s1, s2;
{
register int end;
register int i1, i1_byte, i2, i2_byte;
if (SYMBOLP (s1))
- XSETSTRING (s1, XSYMBOL (s1)->name);
+ s1 = SYMBOL_NAME (s1);
if (SYMBOLP (s2))
- XSETSTRING (s2, XSYMBOL (s2)->name);
- CHECK_STRING (s1, 0);
- CHECK_STRING (s2, 1);
+ s2 = SYMBOL_NAME (s2);
+ CHECK_STRING (s1);
+ CHECK_STRING (s2);
i1 = i1_byte = i2 = i2_byte = 0;
}
DEFUN ("append", Fappend, Sappend, 0, MANY, 0,
- /* Concatenate all the arguments and make the result a list.
+ doc: /* Concatenate all the arguments and make the result a list.
The result is a list whose elements are the elements of all the arguments.
Each argument may be a list, vector or string.
-The last argument is not copied, just used as the tail of the new list. */
- (nargs, args))
+The last argument is not copied, just used as the tail of the new list.
+usage: (append &rest SEQUENCES) */)
+ (nargs, args)
int nargs;
Lisp_Object *args;
{
}
DEFUN ("concat", Fconcat, Sconcat, 0, MANY, 0,
- /* Concatenate all the arguments and make the result a string.
+ doc: /* Concatenate all the arguments and make the result a string.
The result is a string whose elements are the elements of all the arguments.
-Each argument may be a string or a list or vector of characters (integers). */
- (nargs, args))
+Each argument may be a string or a list or vector of characters (integers).
+usage: (concat &rest SEQUENCES) */)
+ (nargs, args)
int nargs;
Lisp_Object *args;
{
}
DEFUN ("vconcat", Fvconcat, Svconcat, 0, MANY, 0,
- /* Concatenate all the arguments and make the result a vector.
+ doc: /* Concatenate all the arguments and make the result a vector.
The result is a vector whose elements are the elements of all the arguments.
-Each argument may be a list, vector or string. */
- (nargs, args))
+Each argument may be a list, vector or string.
+usage: (vconcat &rest SEQUENCES) */)
+ (nargs, args)
int nargs;
Lisp_Object *args;
{
DEFUN ("copy-sequence", Fcopy_sequence, Scopy_sequence, 1, 1, 0,
- /* Return a copy of a list, vector or string.
+ doc: /* Return a copy of a list, vector or string.
The elements of a list or vector are not copied; they are shared
-with the original. */
- (arg))
+with the original. */)
+ (arg)
Lisp_Object arg;
{
if (NILP (arg)) return arg;
/* Store this element into the result. */
if (toindex < 0)
{
- XCAR (tail) = elt;
+ XSETCAR (tail, elt);
prev = tail;
tail = XCDR (tail);
}
XVECTOR (val)->contents[toindex++] = elt;
else
{
- CHECK_NUMBER (elt, 0);
+ CHECK_NUMBER (elt);
if (SINGLE_BYTE_CHAR_P (XINT (elt)))
{
if (some_multibyte)
}
}
if (!NILP (prev))
- XCDR (prev) = last_tail;
+ XSETCDR (prev, last_tail);
if (num_textprops > 0)
{
DEFUN ("string-make-multibyte", Fstring_make_multibyte, Sstring_make_multibyte,
1, 1, 0,
- /* Return the multibyte equivalent of STRING.
+ doc: /* Return the multibyte equivalent of STRING.
The function `unibyte-char-to-multibyte' is used to convert
-each unibyte character to a multibyte character. */
- (string))
+each unibyte character to a multibyte character. */)
+ (string)
Lisp_Object string;
{
- CHECK_STRING (string, 0);
+ CHECK_STRING (string);
return string_make_multibyte (string);
}
DEFUN ("string-make-unibyte", Fstring_make_unibyte, Sstring_make_unibyte,
1, 1, 0,
- /* Return the unibyte equivalent of STRING.
+ doc: /* Return the unibyte equivalent of STRING.
Multibyte character codes are converted to unibyte
-by using just the low 8 bits. */
- (string))
+by using just the low 8 bits. */)
+ (string)
Lisp_Object string;
{
- CHECK_STRING (string, 0);
+ CHECK_STRING (string);
return string_make_unibyte (string);
}
DEFUN ("string-as-unibyte", Fstring_as_unibyte, Sstring_as_unibyte,
1, 1, 0,
- /* Return a unibyte string with the same individual bytes as STRING.
+ doc: /* Return a unibyte string with the same individual bytes as STRING.
If STRING is unibyte, the result is STRING itself.
Otherwise it is a newly created string, with no text properties.
If STRING is multibyte and contains a character of charset
`eight-bit-control' or `eight-bit-graphic', it is converted to the
-corresponding single byte. */
- (string))
+corresponding single byte. */)
+ (string)
Lisp_Object string;
{
- CHECK_STRING (string, 0);
+ CHECK_STRING (string);
if (STRING_MULTIBYTE (string))
{
DEFUN ("string-as-multibyte", Fstring_as_multibyte, Sstring_as_multibyte,
1, 1, 0,
-/* Return a multibyte string with the same individual bytes as STRING.
+ doc: /* Return a multibyte string with the same individual bytes as STRING.
If STRING is multibyte, the result is STRING itself.
Otherwise it is a newly created string, with no text properties.
If STRING is unibyte and contains an individual 8-bit byte (i.e. not
part of a multibyte form), it is converted to the corresponding
-multibyte character of charset `eight-bit-control' or `eight-bit-graphic'. */
- (string))
+multibyte character of charset `eight-bit-control' or `eight-bit-graphic'. */)
+ (string)
Lisp_Object string;
{
- CHECK_STRING (string, 0);
+ CHECK_STRING (string);
if (! STRING_MULTIBYTE (string))
{
}
\f
DEFUN ("copy-alist", Fcopy_alist, Scopy_alist, 1, 1, 0,
- /* Return a copy of ALIST.
+ doc: /* Return a copy of ALIST.
This is an alist which represents the same mapping from objects to objects,
but does not share the alist structure with ALIST.
The objects mapped (cars and cdrs of elements of the alist)
are shared, however.
-Elements of ALIST that are not conses are also shared. */
- (alist))
+Elements of ALIST that are not conses are also shared. */)
+ (alist)
Lisp_Object alist;
{
register Lisp_Object tem;
- CHECK_LIST (alist, 0);
+ CHECK_LIST (alist);
if (NILP (alist))
return alist;
alist = concat (1, &alist, Lisp_Cons, 0);
car = XCAR (tem);
if (CONSP (car))
- XCAR (tem) = Fcons (XCAR (car), XCDR (car));
+ XSETCAR (tem, Fcons (XCAR (car), XCDR (car)));
}
return alist;
}
DEFUN ("substring", Fsubstring, Ssubstring, 2, 3, 0,
-/* Return a substring of STRING, starting at index FROM and ending before TO.
+ doc: /* Return a substring of STRING, starting at index FROM and ending before TO.
TO may be nil or omitted; then the substring runs to the end of STRING.
If FROM or TO is negative, it counts from the end.
-This function allows vectors as well as strings. */
- (string, from, to))
+This function allows vectors as well as strings. */)
+ (string, from, to)
Lisp_Object string;
register Lisp_Object from, to;
{
if (! (STRINGP (string) || VECTORP (string)))
wrong_type_argument (Qarrayp, string);
- CHECK_NUMBER (from, 1);
+ CHECK_NUMBER (from);
if (STRINGP (string))
{
}
else
{
- CHECK_NUMBER (to, 2);
+ CHECK_NUMBER (to);
to_char = XINT (to);
if (to_char < 0)
return res;
}
+
+DEFUN ("substring-no-properties", Fsubstring_no_properties, Ssubstring_no_properties, 1, 3, 0,
+ doc: /* Return a substring of STRING, without text properties.
+It starts at index FROM and ending before TO.
+TO may be nil or omitted; then the substring runs to the end of STRING.
+If FROM is nil or omitted, the substring starts at the beginning of STRING.
+If FROM or TO is negative, it counts from the end.
+
+With one argument, just copy STRING without its properties. */)
+ (string, from, to)
+ Lisp_Object string;
+ register Lisp_Object from, to;
+{
+ int size, size_byte;
+ int from_char, to_char;
+ int from_byte, to_byte;
+
+ CHECK_STRING (string);
+
+ size = XSTRING (string)->size;
+ size_byte = STRING_BYTES (XSTRING (string));
+
+ if (NILP (from))
+ from_char = from_byte = 0;
+ else
+ {
+ CHECK_NUMBER (from);
+ from_char = XINT (from);
+ if (from_char < 0)
+ from_char += size;
+
+ from_byte = string_char_to_byte (string, from_char);
+ }
+
+ if (NILP (to))
+ {
+ to_char = size;
+ to_byte = size_byte;
+ }
+ else
+ {
+ CHECK_NUMBER (to);
+
+ to_char = XINT (to);
+ if (to_char < 0)
+ to_char += size;
+
+ to_byte = string_char_to_byte (string, to_char);
+ }
+
+ if (!(0 <= from_char && from_char <= to_char && to_char <= size))
+ args_out_of_range_3 (string, make_number (from_char),
+ make_number (to_char));
+
+ return make_specified_string (XSTRING (string)->data + from_byte,
+ to_char - from_char, to_byte - from_byte,
+ STRING_MULTIBYTE (string));
+}
+
/* Extract a substring of STRING, giving start and end positions
both in characters and in bytes. */
}
\f
DEFUN ("nthcdr", Fnthcdr, Snthcdr, 2, 2, 0,
- /* Take cdr N times on LIST, returns the result. */
- (n, list))
+ doc: /* Take cdr N times on LIST, returns the result. */)
+ (n, list)
Lisp_Object n;
register Lisp_Object list;
{
register int i, num;
- CHECK_NUMBER (n, 0);
+ CHECK_NUMBER (n);
num = XINT (n);
for (i = 0; i < num && !NILP (list); i++)
{
}
DEFUN ("nth", Fnth, Snth, 2, 2, 0,
- /* Return the Nth element of LIST.
-N counts from zero. If LIST is not that long, nil is returned. */
- (n, list))
+ doc: /* Return the Nth element of LIST.
+N counts from zero. If LIST is not that long, nil is returned. */)
+ (n, list)
Lisp_Object n, list;
{
return Fcar (Fnthcdr (n, list));
}
DEFUN ("elt", Felt, Selt, 2, 2, 0,
- /* Return element of SEQUENCE at index N. */
- (sequence, n))
+ doc: /* Return element of SEQUENCE at index N. */)
+ (sequence, n)
register Lisp_Object sequence, n;
{
- CHECK_NUMBER (n, 0);
+ CHECK_NUMBER (n);
while (1)
{
if (CONSP (sequence) || NILP (sequence))
}
DEFUN ("member", Fmember, Smember, 2, 2, 0,
-/* Return non-nil if ELT is an element of LIST. Comparison done with `equal'.
-The value is actually the tail of LIST whose car is ELT. */
- (elt, list))
+doc: /* Return non-nil if ELT is an element of LIST. Comparison done with `equal'.
+The value is actually the tail of LIST whose car is ELT. */)
+ (elt, list)
register Lisp_Object elt;
Lisp_Object list;
{
}
DEFUN ("memq", Fmemq, Smemq, 2, 2, 0,
- /* Return non-nil if ELT is an element of LIST.
+ doc: /* Return non-nil if ELT is an element of LIST.
Comparison done with EQ. The value is actually the tail of LIST
-whose car is ELT. */
- (elt, list))
+whose car is ELT. */)
+ (elt, list)
Lisp_Object elt, list;
{
while (1)
}
DEFUN ("assq", Fassq, Sassq, 2, 2, 0,
- /* Return non-nil if KEY is `eq' to the car of an element of LIST.
+ doc: /* Return non-nil if KEY is `eq' to the car of an element of LIST.
The value is actually the element of LIST whose car is KEY.
-Elements of LIST that are not conses are ignored. */
- (key, list))
+Elements of LIST that are not conses are ignored. */)
+ (key, list)
Lisp_Object key, list;
{
Lisp_Object result;
}
DEFUN ("assoc", Fassoc, Sassoc, 2, 2, 0,
- /* Return non-nil if KEY is `equal' to the car of an element of LIST.
-The value is actually the element of LIST whose car equals KEY. */
- (key, list))
+ doc: /* Return non-nil if KEY is `equal' to the car of an element of LIST.
+The value is actually the element of LIST whose car equals KEY. */)
+ (key, list)
Lisp_Object key, list;
{
Lisp_Object result, car;
}
DEFUN ("rassq", Frassq, Srassq, 2, 2, 0,
- /* Return non-nil if KEY is `eq' to the cdr of an element of LIST.
-The value is actually the element of LIST whose cdr is KEY. */
- (key, list))
+ doc: /* Return non-nil if KEY is `eq' to the cdr of an element of LIST.
+The value is actually the element of LIST whose cdr is KEY. */)
+ (key, list)
register Lisp_Object key;
Lisp_Object list;
{
}
DEFUN ("rassoc", Frassoc, Srassoc, 2, 2, 0,
- /* Return non-nil if KEY is `equal' to the cdr of an element of LIST.
-The value is actually the element of LIST whose cdr equals KEY. */
- (key, list))
+ doc: /* Return non-nil if KEY is `equal' to the cdr of an element of LIST.
+The value is actually the element of LIST whose cdr equals KEY. */)
+ (key, list)
Lisp_Object key, list;
{
Lisp_Object result, cdr;
}
\f
DEFUN ("delq", Fdelq, Sdelq, 2, 2, 0,
- /* Delete by side effect any occurrences of ELT as a member of LIST.
+ doc: /* Delete by side effect any occurrences of ELT as a member of LIST.
The modified LIST is returned. Comparison is done with `eq'.
If the first member of LIST is ELT, there is no way to remove it by side effect;
therefore, write `(setq foo (delq element foo))'
-to be sure of changing the value of `foo'. */
- (elt, list))
+to be sure of changing the value of `foo'. */)
+ (elt, list)
register Lisp_Object elt;
Lisp_Object list;
{
}
DEFUN ("delete", Fdelete, Sdelete, 2, 2, 0,
- /* Delete by side effect any occurrences of ELT as a member of SEQ.
+ doc: /* Delete by side effect any occurrences of ELT as a member of SEQ.
SEQ must be a list, a vector, or a string.
The modified SEQ is returned. Comparison is done with `equal'.
If SEQ is not a list, or the first member of SEQ is ELT, deleting it
is not a side effect; it is simply using a different sequence.
Therefore, write `(setq foo (delete element foo))'
-to be sure of changing the value of `foo'. */
- (elt, seq))
+to be sure of changing the value of `foo'. */)
+ (elt, seq)
Lisp_Object elt, seq;
{
if (VECTORP (seq))
}
DEFUN ("nreverse", Fnreverse, Snreverse, 1, 1, 0,
- /* Reverse LIST by modifying cdr pointers.
-Returns the beginning of the reversed list. */
- (list))
+ doc: /* Reverse LIST by modifying cdr pointers.
+Returns the beginning of the reversed list. */)
+ (list)
Lisp_Object list;
{
register Lisp_Object prev, tail, next;
}
DEFUN ("reverse", Freverse, Sreverse, 1, 1, 0,
- /* Reverse LIST, copying. Returns the beginning of the reversed list.
-See also the function `nreverse', which is used more often. */
- (list))
+ doc: /* Reverse LIST, copying. Returns the beginning of the reversed list.
+See also the function `nreverse', which is used more often. */)
+ (list)
Lisp_Object list;
{
Lisp_Object new;
Lisp_Object merge ();
DEFUN ("sort", Fsort, Ssort, 2, 2, 0,
- /* Sort LIST, stably, comparing elements using PREDICATE.
+ doc: /* Sort LIST, stably, comparing elements using PREDICATE.
Returns the sorted list. LIST is modified by side effects.
PREDICATE is called with two elements of LIST, and should return t
-if the first element is "less" than the second. */
- (list, predicate))
+if the first element is "less" than the second. */)
+ (list, predicate)
Lisp_Object list, predicate;
{
Lisp_Object front, back;
\f
DEFUN ("plist-get", Fplist_get, Splist_get, 2, 2, 0,
- /* Extract a value from a property list.
+ doc: /* Extract a value from a property list.
PLIST is a property list, which is a list of the form
\(PROP1 VALUE1 PROP2 VALUE2...). This function returns the value
corresponding to the given PROP, or nil if PROP is not
-one of the properties on the list. */
- (plist, prop))
+one of the properties on the list. */)
+ (plist, prop)
Lisp_Object plist;
Lisp_Object prop;
{
}
DEFUN ("get", Fget, Sget, 2, 2, 0,
- /* Return the value of SYMBOL's PROPNAME property.
-This is the last value stored with `(put SYMBOL PROPNAME VALUE)'. */
- (symbol, propname))
+ doc: /* Return the value of SYMBOL's PROPNAME property.
+This is the last value stored with `(put SYMBOL PROPNAME VALUE)'. */)
+ (symbol, propname)
Lisp_Object symbol, propname;
{
- CHECK_SYMBOL (symbol, 0);
+ CHECK_SYMBOL (symbol);
return Fplist_get (XSYMBOL (symbol)->plist, propname);
}
DEFUN ("plist-put", Fplist_put, Splist_put, 3, 3, 0,
- /* Change value in PLIST of PROP to VAL.
+ doc: /* Change value in PLIST of PROP to VAL.
PLIST is a property list, which is a list of the form
\(PROP1 VALUE1 PROP2 VALUE2 ...). PROP is a symbol and VAL is any object.
If PROP is already a property on the list, its value is set to VAL,
otherwise the new PROP VAL pair is added. The new plist is returned;
use `(setq x (plist-put x prop val))' to be sure to use the new value.
-The PLIST is modified by side effects. */
- (plist, prop, val))
+The PLIST is modified by side effects. */)
+ (plist, prop, val)
Lisp_Object plist;
register Lisp_Object prop;
Lisp_Object val;
}
DEFUN ("put", Fput, Sput, 3, 3, 0,
- /* Store SYMBOL's PROPNAME property with value VALUE.
-It can be retrieved with `(get SYMBOL PROPNAME)'. */
- (symbol, propname, value))
+ doc: /* Store SYMBOL's PROPNAME property with value VALUE.
+It can be retrieved with `(get SYMBOL PROPNAME)'. */)
+ (symbol, propname, value)
Lisp_Object symbol, propname, value;
{
- CHECK_SYMBOL (symbol, 0);
+ CHECK_SYMBOL (symbol);
XSYMBOL (symbol)->plist
= Fplist_put (XSYMBOL (symbol)->plist, propname, value);
return value;
}
+\f
+DEFUN ("lax-plist-get", Flax_plist_get, Slax_plist_get, 2, 2, 0,
+ doc: /* Extract a value from a property list, comparing with `equal'.
+PLIST is a property list, which is a list of the form
+\(PROP1 VALUE1 PROP2 VALUE2...). This function returns the value
+corresponding to the given PROP, or nil if PROP is not
+one of the properties on the list. */)
+ (plist, prop)
+ Lisp_Object plist;
+ Lisp_Object prop;
+{
+ Lisp_Object tail;
+
+ for (tail = plist;
+ CONSP (tail) && CONSP (XCDR (tail));
+ tail = XCDR (XCDR (tail)))
+ {
+ if (! NILP (Fequal (prop, XCAR (tail))))
+ return XCAR (XCDR (tail));
+
+ QUIT;
+ }
+
+ if (!NILP (tail))
+ wrong_type_argument (Qlistp, prop);
+
+ return Qnil;
+}
+DEFUN ("lax-plist-put", Flax_plist_put, Slax_plist_put, 3, 3, 0,
+ doc: /* Change value in PLIST of PROP to VAL, comparing with `equal'.
+PLIST is a property list, which is a list of the form
+\(PROP1 VALUE1 PROP2 VALUE2 ...). PROP and VAL are any objects.
+If PROP is already a property on the list, its value is set to VAL,
+otherwise the new PROP VAL pair is added. The new plist is returned;
+use `(setq x (lax-plist-put x prop val))' to be sure to use the new value.
+The PLIST is modified by side effects. */)
+ (plist, prop, val)
+ Lisp_Object plist;
+ register Lisp_Object prop;
+ Lisp_Object val;
+{
+ register Lisp_Object tail, prev;
+ Lisp_Object newcell;
+ prev = Qnil;
+ for (tail = plist; CONSP (tail) && CONSP (XCDR (tail));
+ tail = XCDR (XCDR (tail)))
+ {
+ if (! NILP (Fequal (prop, XCAR (tail))))
+ {
+ Fsetcar (XCDR (tail), val);
+ return plist;
+ }
+
+ prev = tail;
+ QUIT;
+ }
+ newcell = Fcons (prop, Fcons (val, Qnil));
+ if (NILP (prev))
+ return newcell;
+ else
+ Fsetcdr (XCDR (prev), newcell);
+ return plist;
+}
+\f
DEFUN ("equal", Fequal, Sequal, 2, 2, 0,
- /* Return t if two Lisp objects have similar structure and contents.
+ doc: /* Return t if two Lisp objects have similar structure and contents.
They must have the same data type.
Conses are compared by comparing the cars and the cdrs.
Vectors and strings are compared element by element.
Numbers are compared by value, but integers cannot equal floats.
(Use `=' if you want integers and floats to be able to be equal.)
-Symbols must match exactly. */
- (o1, o2))
+Symbols must match exactly. */)
+ (o1, o2)
register Lisp_Object o1, o2;
{
return internal_equal (o1, o2, 0) ? Qt : Qnil;
extern Lisp_Object Fmake_char_internal ();
DEFUN ("fillarray", Ffillarray, Sfillarray, 2, 2, 0,
- /* Store each element of ARRAY with ITEM.
-ARRAY is a vector, string, char-table, or bool-vector. */
- (array, item))
+ doc: /* Store each element of ARRAY with ITEM.
+ARRAY is a vector, string, char-table, or bool-vector. */)
+ (array, item)
Lisp_Object array, item;
{
register int size, index, charval;
else if (STRINGP (array))
{
register unsigned char *p = XSTRING (array)->data;
- CHECK_NUMBER (item, 1);
+ CHECK_NUMBER (item);
charval = XINT (item);
size = XSTRING (array)->size;
if (STRING_MULTIBYTE (array))
\f
DEFUN ("char-table-subtype", Fchar_table_subtype, Schar_table_subtype,
1, 1, 0,
- /* Return the subtype of char-table CHAR-TABLE. The value is a symbol. */
- (char_table))
+ doc: /* Return the subtype of char-table CHAR-TABLE. The value is a symbol. */)
+ (char_table)
Lisp_Object char_table;
{
- CHECK_CHAR_TABLE (char_table, 0);
+ CHECK_CHAR_TABLE (char_table);
return XCHAR_TABLE (char_table)->purpose;
}
DEFUN ("char-table-parent", Fchar_table_parent, Schar_table_parent,
1, 1, 0,
- /* Return the parent char-table of CHAR-TABLE.
+ 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). */
- (char_table))
+\(or from its parents, if necessary). */)
+ (char_table)
Lisp_Object char_table;
{
- CHECK_CHAR_TABLE (char_table, 0);
+ 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,
- /* Set the parent char-table of CHAR-TABLE to PARENT.
-PARENT must be either nil or another char-table. */
- (char_table, parent))
+ doc: /* Set the parent char-table of CHAR-TABLE to PARENT.
+PARENT must be either nil or another char-table. */)
+ (char_table, parent)
Lisp_Object char_table, parent;
{
Lisp_Object temp;
- CHECK_CHAR_TABLE (char_table, 0);
+ CHECK_CHAR_TABLE (char_table);
if (!NILP (parent))
{
- CHECK_CHAR_TABLE (parent, 0);
+ CHECK_CHAR_TABLE (parent);
for (temp = parent; !NILP (temp); temp = XCHAR_TABLE (temp)->parent)
if (EQ (temp, char_table))
DEFUN ("char-table-extra-slot", Fchar_table_extra_slot, Schar_table_extra_slot,
2, 2, 0,
- /* Return the value of CHAR-TABLE's extra-slot number N. */
- (char_table, n))
+ doc: /* Return the value of CHAR-TABLE's extra-slot number N. */)
+ (char_table, n)
Lisp_Object char_table, n;
{
- CHECK_CHAR_TABLE (char_table, 1);
- CHECK_NUMBER (n, 2);
+ 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);
DEFUN ("set-char-table-extra-slot", Fset_char_table_extra_slot,
Sset_char_table_extra_slot,
3, 3, 0,
- /* Set CHAR-TABLE's extra-slot number N to VALUE. */
- (char_table, n, value))
+ doc: /* Set CHAR-TABLE's extra-slot number N to VALUE. */)
+ (char_table, n, value)
Lisp_Object char_table, n, value;
{
- CHECK_CHAR_TABLE (char_table, 1);
- CHECK_NUMBER (n, 2);
+ 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);
\f
DEFUN ("char-table-range", Fchar_table_range, Schar_table_range,
2, 2, 0,
- /* Return the value in CHAR-TABLE for a range of characters RANGE.
+ doc: /* Return the value in CHAR-TABLE for a range of characters RANGE.
RANGE should be nil (for the default value)
a vector which identifies a character set or a row of a character set,
-a character set name, or a character code. */
- (char_table, range))
+a character set name, or a character code. */)
+ (char_table, range)
Lisp_Object char_table, range;
{
- CHECK_CHAR_TABLE (char_table, 0);
+ CHECK_CHAR_TABLE (char_table);
if (EQ (range, Qnil))
return XCHAR_TABLE (char_table)->defalt;
Lisp_Object charset_info;
charset_info = Fget (range, Qcharset);
- CHECK_VECTOR (charset_info, 0);
+ CHECK_VECTOR (charset_info);
return Faref (char_table,
make_number (XINT (XVECTOR (charset_info)->contents[0])
DEFUN ("set-char-table-range", Fset_char_table_range, Sset_char_table_range,
3, 3, 0,
- /* Set the value in CHAR-TABLE for a range of characters RANGE to VALUE.
+ doc: /* Set the value in CHAR-TABLE for a range of characters RANGE to VALUE.
RANGE should be t (for all characters), nil (for the default value)
a vector which identifies a character set or a row of a character set,
-a coding system, or a character code. */
- (char_table, range, value))
+a coding system, or a character code. */)
+ (char_table, range, value)
Lisp_Object char_table, range, value;
{
int i;
- CHECK_CHAR_TABLE (char_table, 0);
+ CHECK_CHAR_TABLE (char_table);
if (EQ (range, Qt))
for (i = 0; i < CHAR_TABLE_ORDINARY_SLOTS; i++)
Lisp_Object charset_info;
charset_info = Fget (range, Qcharset);
- CHECK_VECTOR (charset_info, 0);
+ CHECK_VECTOR (charset_info);
return Faset (char_table,
make_number (XINT (XVECTOR (charset_info)->contents[0])
DEFUN ("set-char-table-default", Fset_char_table_default,
Sset_char_table_default, 3, 3, 0,
- /* Set the default value in CHAR-TABLE for a generic character CHAR to VALUE.
+ doc: /* Set the default value in CHAR-TABLE for a generic character CHAR to VALUE.
The generic character specifies the group of characters.
-See also the documentation of make-char. */
- (char_table, ch, value))
+See also the documentation of make-char. */)
+ (char_table, ch, value)
Lisp_Object char_table, ch, value;
{
int c, charset, code1, code2;
Lisp_Object temp;
- CHECK_CHAR_TABLE (char_table, 0);
- CHECK_NUMBER (ch, 1);
+ CHECK_CHAR_TABLE (char_table);
+ CHECK_NUMBER (ch);
c = XINT (ch);
SPLIT_CHAR (c, charset, code1, code2);
}
DEFUN ("optimize-char-table", Foptimize_char_table, Soptimize_char_table,
- 1, 1, 0,
- /* Optimize char table TABLE. */
- (table))
+ 1, 1, 0, doc: /* Optimize char table TABLE. */)
+ (table)
Lisp_Object table;
{
Lisp_Object elt;
int dim;
int i, j;
- CHECK_CHAR_TABLE (table, 0);
+ CHECK_CHAR_TABLE (table);
for (i = CHAR_TABLE_SINGLE_BYTE_SLOTS; i < CHAR_TABLE_ORDINARY_SLOTS; i++)
{
DEFUN ("map-char-table", Fmap_char_table, Smap_char_table,
2, 2, 0,
- /* Call FUNCTION for each (normal and generic) characters in CHAR-TABLE.
+ doc: /* Call FUNCTION for each (normal and generic) characters in CHAR-TABLE.
FUNCTION is called with two arguments--a key and a value.
-The key is always a possible IDX argument to `aref'. */
- (function, char_table))
+The key is always a possible IDX argument to `aref'. */)
+ (function, char_table)
Lisp_Object function, char_table;
{
/* The depth of char table is at most 3. */
Lisp_Object indices[3];
- CHECK_CHAR_TABLE (char_table, 1);
+ CHECK_CHAR_TABLE (char_table);
map_char_table (NULL, function, char_table, char_table, 0, indices);
return Qnil;
}
DEFUN ("nconc", Fnconc, Snconc, 0, MANY, 0,
- /* Concatenate any number of lists by altering them.
-Only the last argument is not altered, and need not be a list. */
- (nargs, args))
+ doc: /* Concatenate any number of lists by altering them.
+Only the last argument is not altered, and need not be a list.
+usage: (nconc &rest LISTS) */)
+ (nargs, args)
int nargs;
Lisp_Object *args;
{
}
DEFUN ("mapconcat", Fmapconcat, Smapconcat, 3, 3, 0,
- /* Apply FUNCTION to each element of SEQUENCE, and concat the results as strings.
+ doc: /* Apply FUNCTION to each element of SEQUENCE, and concat the results as strings.
In between each pair of results, stick in SEPARATOR. Thus, " " as
SEPARATOR results in spaces between the values returned by FUNCTION.
-SEQUENCE may be a list, a vector, a bool-vector, or a string. */
- (function, sequence, separator))
+SEQUENCE may be a list, a vector, a bool-vector, or a string. */)
+ (function, sequence, separator)
Lisp_Object function, sequence, separator;
{
Lisp_Object len;
}
DEFUN ("mapcar", Fmapcar, Smapcar, 2, 2, 0,
- /* Apply FUNCTION to each element of SEQUENCE, and make a list of the results.
+ doc: /* Apply FUNCTION to each element of SEQUENCE, and make a list of the results.
The result is a list just as long as SEQUENCE.
-SEQUENCE may be a list, a vector, a bool-vector, or a string. */
- (function, sequence))
+SEQUENCE may be a list, a vector, a bool-vector, or a string. */)
+ (function, sequence)
Lisp_Object function, sequence;
{
register Lisp_Object len;
}
DEFUN ("mapc", Fmapc, Smapc, 2, 2, 0,
- /* Apply FUNCTION to each element of SEQUENCE for side effects only.
+ doc: /* Apply FUNCTION to each element of SEQUENCE for side effects only.
Unlike `mapcar', don't accumulate the results. Return SEQUENCE.
-SEQUENCE may be a list, a vector, a bool-vector, or a string. */
- (function, sequence))
+SEQUENCE may be a list, a vector, a bool-vector, or a string. */)
+ (function, sequence)
Lisp_Object function, sequence;
{
register int leni;
/* Anything that calls this function must protect from GC! */
DEFUN ("y-or-n-p", Fy_or_n_p, Sy_or_n_p, 1, 1, 0,
- /* Ask user a "y or n" question. Return t if answer is "y".
+ doc: /* Ask user a "y or n" question. Return t if answer is "y".
Takes one argument, which is the string to display to ask the question.
It should end in a space; `y-or-n-p' adds `(y or n) ' to it.
No confirmation of the answer is requested; a single character is enough.
`recenter', and `quit'.\)
Under a windowing system a dialog box will be used if `last-nonmenu-event'
-is nil and `use-dialog-box' is non-nil. */
- (prompt))
+is nil and `use-dialog-box' is non-nil. */)
+ (prompt)
Lisp_Object prompt;
{
register Lisp_Object obj, key, def, map;
map = Fsymbol_value (intern ("query-replace-map"));
- CHECK_STRING (prompt, 0);
+ CHECK_STRING (prompt);
xprompt = prompt;
GCPRO2 (prompt, xprompt);
#endif /* HAVE_MENUS */
cursor_in_echo_area = 1;
choose_minibuf_frame ();
- message_with_string ("%s(y or n) ", xprompt, 0);
+
+ {
+ Lisp_Object pargs[3];
+
+ /* Colorize prompt according to `minibuffer-prompt' face. */
+ pargs[0] = build_string ("%s(y or n) ");
+ pargs[1] = intern ("face");
+ pargs[2] = intern ("minibuffer-prompt");
+ args[0] = Fpropertize (3, pargs);
+ args[1] = xprompt;
+ Fmessage (2, args);
+ }
if (minibuffer_auto_raise)
{
/* Anything that calls this function must protect from GC! */
DEFUN ("yes-or-no-p", Fyes_or_no_p, Syes_or_no_p, 1, 1, 0,
- /* Ask user a yes-or-no question. Return t if answer is yes.
+ doc: /* Ask user a yes-or-no question. Return t if answer is yes.
Takes one argument, which is the string to display to ask the question.
It should end in a space; `yes-or-no-p' adds `(yes or no) ' to it.
The user must confirm the answer with RET,
and can edit it until it has been confirmed.
Under a windowing system a dialog box will be used if `last-nonmenu-event'
-is nil, and `use-dialog-box' is non-nil. */
- (prompt))
+is nil, and `use-dialog-box' is non-nil. */)
+ (prompt)
Lisp_Object prompt;
{
register Lisp_Object ans;
Lisp_Object args[2];
struct gcpro gcpro1;
- CHECK_STRING (prompt, 0);
+ CHECK_STRING (prompt);
#ifdef HAVE_MENUS
if ((NILP (last_nonmenu_event) || CONSP (last_nonmenu_event))
}
\f
DEFUN ("load-average", Fload_average, Sload_average, 0, 1, 0,
- /* Return list of 1 minute, 5 minute and 15 minute load averages.
+ doc: /* Return list of 1 minute, 5 minute and 15 minute load averages.
Each of the three load averages is multiplied by 100, then converted
to integer.
These floats are not multiplied by 100.
If the 5-minute or 15-minute load averages are not available, return a
-shortened list, containing only those averages which are available. */
- (use_floats))
+shortened list, containing only those averages which are available. */)
+ (use_floats)
Lisp_Object use_floats;
{
double load_ave[3];
extern Lisp_Object Vafter_load_alist;
DEFUN ("featurep", Ffeaturep, Sfeaturep, 1, 2, 0,
- /* Returns t if FEATURE is present in this Emacs.
+ doc: /* Returns t if FEATURE is present in this Emacs.
Use this to conditionalize execution of lisp code based on the
presence or absence of emacs or environment extensions.
Use `provide' to declare that a feature is available. This function
looks at the value of the variable `features'. The optional argument
-SUBFEATURE can be used to check a specific subfeature of FEATURE. */
- (feature, subfeature))
+SUBFEATURE can be used to check a specific subfeature of FEATURE. */)
+ (feature, subfeature)
Lisp_Object feature, subfeature;
{
register Lisp_Object tem;
- CHECK_SYMBOL (feature, 0);
+ CHECK_SYMBOL (feature);
tem = Fmemq (feature, Vfeatures);
if (!NILP (tem) && !NILP (subfeature))
- tem = Fmemq (subfeature, Fget (feature, Qsubfeatures));
+ tem = Fmember (subfeature, Fget (feature, Qsubfeatures));
return (NILP (tem)) ? Qnil : Qt;
}
DEFUN ("provide", Fprovide, Sprovide, 1, 2, 0,
- /* Announce that FEATURE is a feature of the current Emacs.
+ doc: /* Announce that FEATURE is a feature of the current Emacs.
The optional argument SUBFEATURES should be a list of symbols listing
-particular subfeatures supported in this version of FEATURE. */
- (feature, subfeatures))
+particular subfeatures supported in this version of FEATURE. */)
+ (feature, subfeatures)
Lisp_Object feature, subfeatures;
{
register Lisp_Object tem;
- CHECK_SYMBOL (feature, 0);
+ CHECK_SYMBOL (feature);
+ CHECK_LIST (subfeatures);
if (!NILP (Vautoload_queue))
Vautoload_queue = Fcons (Fcons (Vfeatures, Qnil), Vautoload_queue);
tem = Fmemq (feature, Vfeatures);
return feature;
}
+\f
+/* `require' and its subroutines. */
+
+/* List of features currently being require'd, innermost first. */
+
+Lisp_Object require_nesting_list;
+
+Lisp_Object
+require_unwind (old_value)
+ Lisp_Object old_value;
+{
+ return require_nesting_list = old_value;
+}
DEFUN ("require", Frequire, Srequire, 1, 3, 0,
- /* If feature FEATURE is not loaded, load it from FILENAME.
+ doc: /* If feature FEATURE is not loaded, load it from FILENAME.
If FEATURE is not a member of the list `features', then the feature
is not loaded; so load the file FILENAME.
If FILENAME is omitted, the printname of FEATURE is used as the file name,
If the optional third argument NOERROR is non-nil,
then return nil if the file is not found instead of signaling an error.
Normally the return value is FEATURE.
-The normal messages at start and end of loading FILENAME are suppressed. */
- (feature, filename, noerror))
+The normal messages at start and end of loading FILENAME are suppressed. */)
+ (feature, filename, noerror)
Lisp_Object feature, filename, noerror;
{
register Lisp_Object tem;
- CHECK_SYMBOL (feature, 0);
+ struct gcpro gcpro1, gcpro2;
+
+ CHECK_SYMBOL (feature);
+
tem = Fmemq (feature, Vfeatures);
LOADHIST_ATTACH (Fcons (Qrequire, feature));
if (NILP (tem))
{
int count = specpdl_ptr - specpdl;
+ int nesting = 0;
+
+ /* This is to make sure that loadup.el gives a clear picture
+ of what files are preloaded and when. */
+ if (! NILP (Vpurify_flag))
+ error ("(require %s) while preparing to dump",
+ XSTRING (SYMBOL_NAME (feature))->data);
+
+ /* A certain amount of recursive `require' is legitimate,
+ but if we require the same feature recursively 3 times,
+ signal an error. */
+ tem = require_nesting_list;
+ while (! NILP (tem))
+ {
+ if (! NILP (Fequal (feature, XCAR (tem))))
+ nesting++;
+ tem = XCDR (tem);
+ }
+ if (nesting > 2)
+ error ("Recursive `require' for feature `%s'",
+ XSTRING (SYMBOL_NAME (feature))->data);
+
+ /* Update the list for any nested `require's that occur. */
+ record_unwind_protect (require_unwind, require_nesting_list);
+ require_nesting_list = Fcons (feature, require_nesting_list);
/* Value saved here is to be restored into Vautoload_queue */
record_unwind_protect (un_autoload, Vautoload_queue);
Vautoload_queue = Qt;
+ /* Load the file. */
+ GCPRO2 (feature, filename);
tem = Fload (NILP (filename) ? Fsymbol_name (feature) : filename,
noerror, Qt, Qnil, (NILP (filename) ? Qt : Qnil));
+ UNGCPRO;
+
/* If load failed entirely, return nil. */
if (NILP (tem))
return unbind_to (count, Qnil);
tem = Fmemq (feature, Vfeatures);
if (NILP (tem))
- error ("Required feature %s was not provided",
- XSYMBOL (feature)->name->data);
+ error ("Required feature `%s' was not provided",
+ XSTRING (SYMBOL_NAME (feature))->data);
/* Once loading finishes, don't undo it. */
Vautoload_queue = Qt;
feature = unbind_to (count, feature);
}
+
return feature;
}
\f
for the sole reason of efficiency. */
DEFUN ("plist-member", Fplist_member, Splist_member, 2, 2, 0,
- /* Return non-nil if PLIST has the property PROP.
+ doc: /* Return non-nil if PLIST has the property PROP.
PLIST is a property list, which is a list of the form
\(PROP1 VALUE1 PROP2 VALUE2 ...\). PROP is a symbol.
Unlike `plist-get', this allows you to distinguish between a missing
property and a property with the value nil.
-The value is actually the tail of PLIST whose car is PROP. */
- (plist, prop))
+The value is actually the tail of PLIST whose car is PROP. */)
+ (plist, prop)
Lisp_Object plist, prop;
{
while (CONSP (plist) && !EQ (XCAR (plist), prop))
}
DEFUN ("widget-put", Fwidget_put, Swidget_put, 3, 3, 0,
- /* In WIDGET, set PROPERTY to VALUE.
-The value can later be retrieved with `widget-get'. */
- (widget, property, value))
+ doc: /* In WIDGET, set PROPERTY to VALUE.
+The value can later be retrieved with `widget-get'. */)
+ (widget, property, value)
Lisp_Object widget, property, value;
{
- CHECK_CONS (widget, 1);
- XCDR (widget) = Fplist_put (XCDR (widget), property, value);
+ CHECK_CONS (widget);
+ XSETCDR (widget, Fplist_put (XCDR (widget), property, value));
return value;
}
DEFUN ("widget-get", Fwidget_get, Swidget_get, 2, 2, 0,
- /* In WIDGET, get the value of PROPERTY.
+ doc: /* In WIDGET, get the value of PROPERTY.
The value could either be specified when the widget was created, or
-later with `widget-put'. */
- (widget, property))
+later with `widget-put'. */)
+ (widget, property)
Lisp_Object widget, property;
{
Lisp_Object tmp;
{
if (NILP (widget))
return Qnil;
- CHECK_CONS (widget, 1);
+ CHECK_CONS (widget);
tmp = Fplist_member (XCDR (widget), property);
if (CONSP (tmp))
{
}
DEFUN ("widget-apply", Fwidget_apply, Swidget_apply, 2, MANY, 0,
- /* Apply the value of WIDGET's PROPERTY to the widget itself.
-ARGS are passed as extra arguments to the function. */
- (nargs, args))
+ doc: /* Apply the value of WIDGET's PROPERTY to the widget itself.
+ARGS are passed as extra arguments to the function.
+usage: (widget-apply WIDGET PROPERTY &rest ARGS) */)
+ (nargs, args)
int nargs;
Lisp_Object *args;
{
DEFUN ("base64-encode-region", Fbase64_encode_region, Sbase64_encode_region,
2, 3, "r",
- /* Base64-encode the region between BEG and END.
+ doc: /* Base64-encode the region between BEG and END.
Return the length of the encoded text.
Optional third argument NO-LINE-BREAK means do not break long lines
-into shorter lines. */
- (beg, end, no_line_break))
+into shorter lines. */)
+ (beg, end, no_line_break)
Lisp_Object beg, end, no_line_break;
{
char *encoded;
DEFUN ("base64-encode-string", Fbase64_encode_string, Sbase64_encode_string,
1, 2, 0,
- /* Base64-encode STRING and return the result.
+ doc: /* Base64-encode STRING and return the result.
Optional second argument NO-LINE-BREAK means do not break long lines
-into shorter lines. */
- (string, no_line_break))
+into shorter lines. */)
+ (string, no_line_break)
Lisp_Object string, no_line_break;
{
int allength, length, encoded_length;
char *encoded;
Lisp_Object encoded_string;
- CHECK_STRING (string, 1);
+ CHECK_STRING (string);
/* We need to allocate enough room for encoding the text.
We need 33 1/3% more space, plus a newline every 76
DEFUN ("base64-decode-region", Fbase64_decode_region, Sbase64_decode_region,
2, 2, "r",
- /* Base64-decode the region between BEG and END.
+ doc: /* Base64-decode the region between BEG and END.
Return the length of the decoded text.
-If the region can't be decoded, signal an error and don't modify the buffer. */
- (beg, end))
+If the region can't be decoded, signal an error and don't modify the buffer. */)
+ (beg, end)
Lisp_Object beg, end;
{
int ibeg, iend, length, allength;
DEFUN ("base64-decode-string", Fbase64_decode_string, Sbase64_decode_string,
1, 1, 0,
- /* Base64-decode STRING and return the result. */
- (string))
+ doc: /* Base64-decode STRING and return the result. */)
+ (string)
Lisp_Object string;
{
char *decoded;
int length, decoded_length;
Lisp_Object decoded_string;
- CHECK_STRING (string, 1);
+ CHECK_STRING (string);
length = STRING_BYTES (XSTRING (string));
/* We need to allocate enough room for decoding the text. */
check_hash_table (obj)
Lisp_Object obj;
{
- CHECK_HASH_TABLE (obj, 0);
+ CHECK_HASH_TABLE (obj);
return XHASH_TABLE (obj);
}
{
Lisp_Object table;
struct Lisp_Hash_Table *h2;
- struct Lisp_Vector *v, *next;
+ struct Lisp_Vector *next;
h2 = allocate_hash_table ();
next = h2->vec_next;
break;
case Lisp_Symbol:
- hash = sxhash_string (XSYMBOL (obj)->name->data,
- XSYMBOL (obj)->name->size);
+ hash = sxhash_string (XSTRING (SYMBOL_NAME (obj))->data,
+ XSTRING (SYMBOL_NAME (obj))->size);
break;
case Lisp_Misc:
DEFUN ("sxhash", Fsxhash, Ssxhash, 1, 1, 0,
- /* Compute a hash code for OBJ and return it as integer. */
- (obj))
+ doc: /* Compute a hash code for OBJ and return it as integer. */)
+ (obj)
Lisp_Object obj;
{
unsigned hash = sxhash (obj, 0);;
DEFUN ("make-hash-table", Fmake_hash_table, Smake_hash_table, 0, MANY, 0,
- /* Create and return a new hash table.
+ doc: /* Create and return a new hash table.
Arguments are specified as keyword/argument pairs. The following
arguments are defined:
hash table when there are no non-weak references pointing to their
key, value, one of key or value, or both key and value, depending on
WEAK. WEAK t is equivalent to `key-and-value'. Default value of WEAK
-is nil. */
- (nargs, args))
+is nil.
+
+usage: (make-hash-table &rest KEYWORD-ARGS) */)
+ (nargs, args)
int nargs;
Lisp_Object *args;
{
Lisp_Object prop;
prop = Fget (test, Qhash_table_test);
- if (!CONSP (prop) || XFASTINT (Flength (prop)) < 2)
+ if (!CONSP (prop) || !CONSP (XCDR (prop)))
Fsignal (Qerror, list2 (build_string ("Invalid hash table test"),
test));
- user_test = Fnth (make_number (0), prop);
- user_hash = Fnth (make_number (1), prop);
+ user_test = XCAR (prop);
+ user_hash = XCAR (XCDR (prop));
}
else
user_test = user_hash = Qnil;
DEFUN ("copy-hash-table", Fcopy_hash_table, Scopy_hash_table, 1, 1, 0,
- /* Return a copy of hash table TABLE. */
- (table))
+ doc: /* Return a copy of hash table TABLE. */)
+ (table)
Lisp_Object table;
{
return copy_hash_table (check_hash_table (table));
DEFUN ("makehash", Fmakehash, Smakehash, 0, 1, 0,
- /* Create a new hash table.
+ doc: /* Create a new hash table.
Optional first argument TEST specifies how to compare keys in the
table. Predefined tests are `eq', `eql', and `equal'. Default is
-`eql'. New tests can be defined with `define-hash-table-test'. */
- (test))
+`eql'. New tests can be defined with `define-hash-table-test'. */)
+ (test)
Lisp_Object test;
{
Lisp_Object args[2];
DEFUN ("hash-table-count", Fhash_table_count, Shash_table_count, 1, 1, 0,
- /* Return the number of elements in TABLE. */
- (table))
+ doc: /* Return the number of elements in TABLE. */)
+ (table)
Lisp_Object table;
{
return check_hash_table (table)->count;
DEFUN ("hash-table-rehash-size", Fhash_table_rehash_size,
Shash_table_rehash_size, 1, 1, 0,
- /* Return the current rehash size of TABLE. */
- (table))
+ doc: /* Return the current rehash size of TABLE. */)
+ (table)
Lisp_Object table;
{
return check_hash_table (table)->rehash_size;
DEFUN ("hash-table-rehash-threshold", Fhash_table_rehash_threshold,
Shash_table_rehash_threshold, 1, 1, 0,
- /* Return the current rehash threshold of TABLE. */
- (table))
+ doc: /* Return the current rehash threshold of TABLE. */)
+ (table)
Lisp_Object table;
{
return check_hash_table (table)->rehash_threshold;
DEFUN ("hash-table-size", Fhash_table_size, Shash_table_size, 1, 1, 0,
- /* Return the size of TABLE.
+ doc: /* Return the size of TABLE.
The size can be used as an argument to `make-hash-table' to create
a hash table than can hold as many elements of TABLE holds
-without need for resizing. */
- (table))
+without need for resizing. */)
+ (table)
Lisp_Object table;
{
struct Lisp_Hash_Table *h = check_hash_table (table);
DEFUN ("hash-table-test", Fhash_table_test, Shash_table_test, 1, 1, 0,
- /* Return the test TABLE uses. */
- (table))
+ doc: /* Return the test TABLE uses. */)
+ (table)
Lisp_Object table;
{
return check_hash_table (table)->test;
DEFUN ("hash-table-weakness", Fhash_table_weakness, Shash_table_weakness,
1, 1, 0,
- /* Return the weakness of TABLE. */
- (table))
+ doc: /* Return the weakness of TABLE. */)
+ (table)
Lisp_Object table;
{
return check_hash_table (table)->weak;
DEFUN ("hash-table-p", Fhash_table_p, Shash_table_p, 1, 1, 0,
- /* Return t if OBJ is a Lisp hash table object. */
- (obj))
+ doc: /* Return t if OBJ is a Lisp hash table object. */)
+ (obj)
Lisp_Object obj;
{
return HASH_TABLE_P (obj) ? Qt : Qnil;
DEFUN ("clrhash", Fclrhash, Sclrhash, 1, 1, 0,
- /* Clear hash table TABLE. */
- (table))
+ doc: /* Clear hash table TABLE. */)
+ (table)
Lisp_Object table;
{
hash_clear (check_hash_table (table));
DEFUN ("gethash", Fgethash, Sgethash, 2, 3, 0,
- /* Look up KEY in TABLE and return its associated value.
-If KEY is not found, return DFLT which defaults to nil. */
- (key, table, dflt))
+ doc: /* Look up KEY in TABLE and return its associated value.
+If KEY is not found, return DFLT which defaults to nil. */)
+ (key, table, dflt)
Lisp_Object key, table, dflt;
{
struct Lisp_Hash_Table *h = check_hash_table (table);
DEFUN ("puthash", Fputhash, Sputhash, 3, 3, 0,
- /* Associate KEY with VALUE in hash table TABLE.
+ doc: /* Associate KEY with VALUE in hash table TABLE.
If KEY is already present in table, replace its current value with
-VALUE. */
- (key, value, table))
+VALUE. */)
+ (key, value, table)
Lisp_Object key, value, table;
{
struct Lisp_Hash_Table *h = check_hash_table (table);
DEFUN ("remhash", Fremhash, Sremhash, 2, 2, 0,
- /* Remove KEY from TABLE. */
- (key, table))
+ doc: /* Remove KEY from TABLE. */)
+ (key, table)
Lisp_Object key, table;
{
struct Lisp_Hash_Table *h = check_hash_table (table);
DEFUN ("maphash", Fmaphash, Smaphash, 2, 2, 0,
- /* Call FUNCTION for all entries in hash table TABLE.
-FUNCTION is called with 2 arguments KEY and VALUE. */
- (function, table))
+ doc: /* Call FUNCTION for all entries in hash table TABLE.
+FUNCTION is called with 2 arguments KEY and VALUE. */)
+ (function, table)
Lisp_Object function, table;
{
struct Lisp_Hash_Table *h = check_hash_table (table);
DEFUN ("define-hash-table-test", Fdefine_hash_table_test,
Sdefine_hash_table_test, 3, 3, 0,
- /* Define a new hash table test with name NAME, a symbol.
+ doc: /* Define a new hash table test with name NAME, a symbol.
In hash tables created with NAME specified as test, use TEST to
compare keys, and HASH for computing hash codes of keys.
both arguments are the same. HASH must be a function taking one
argument and return an integer that is the hash code of the argument.
Hash code computation should use the whole value range of integers,
-including negative integers. */
- (name, test, hash))
+including negative integers. */)
+ (name, test, hash)
Lisp_Object name, test, hash;
{
return Fput (name, Qhash_table_test, list2 (test, hash));
#include "coding.h"
DEFUN ("md5", Fmd5, Smd5, 1, 5, 0,
- /* Return MD5 message digest of OBJECT, a buffer or string.
+ doc: /* Return MD5 message digest of OBJECT, a buffer or string.
A message digest is a cryptographic checksum of a document, and the
algorithm to calculate it is defined in RFC 1321.
command `prefer-coding-system') is used.
If NOERROR is non-nil, silently assume the `raw-text' coding if the
-guesswork fails. Normally, an error is signaled in such case. */
- (object, start, end, coding_system, noerror))
+guesswork fails. Normally, an error is signaled in such case. */)
+ (object, start, end, coding_system, noerror)
Lisp_Object object, start, end, coding_system, noerror;
{
unsigned char digest[16];
if (!NILP (start))
{
- CHECK_NUMBER (start, 1);
+ CHECK_NUMBER (start);
start_char = XINT (start);
}
else
{
- CHECK_NUMBER (end, 2);
+ CHECK_NUMBER (end);
end_char = XINT (end);
}
else
{
- CHECK_BUFFER (object, 0);
+ CHECK_BUFFER (object);
bp = XBUFFER (object);
b = BUF_BEGV (bp);
else
{
- CHECK_NUMBER_COERCE_MARKER (start, 0);
+ CHECK_NUMBER_COERCE_MARKER (start);
b = XINT (start);
}
e = BUF_ZV (bp);
else
{
- CHECK_NUMBER_COERCE_MARKER (end, 1);
+ CHECK_NUMBER_COERCE_MARKER (end);
e = XINT (end);
}
staticpro (&string_char_byte_cache_string);
string_char_byte_cache_string = Qnil;
+ require_nesting_list = Qnil;
+ staticpro (&require_nesting_list);
+
Fset (Qyes_or_no_p_history, Qnil);
- DEFVAR_LISP ("features", &Vfeatures
- /* A list of symbols which are the features of the executing emacs.
+ DEFVAR_LISP ("features", &Vfeatures,
+ doc: /* A list of symbols which are the features of the executing emacs.
Used by `featurep' and `require', and altered by `provide'. */);
Vfeatures = Qnil;
Qsubfeatures = intern ("subfeatures");
staticpro (&Qsubfeatures);
- DEFVAR_BOOL ("use-dialog-box", &use_dialog_box
- /* *Non-nil means mouse commands use dialog boxes to ask questions.
-This applies to y-or-n and yes-or-no questions asked by commands
+ DEFVAR_BOOL ("use-dialog-box", &use_dialog_box,
+ doc: /* *Non-nil means mouse commands use dialog boxes to ask questions.
+This applies to `y-or-n-p' and `yes-or-no-p' questions asked by commands
invoked by mouse clicks and mouse menu items. */);
use_dialog_box = 1;
defsubr (&Sstring_as_unibyte);
defsubr (&Scopy_alist);
defsubr (&Ssubstring);
+ defsubr (&Ssubstring_no_properties);
defsubr (&Snthcdr);
defsubr (&Snth);
defsubr (&Selt);
defsubr (&Sget);
defsubr (&Splist_put);
defsubr (&Sput);
+ defsubr (&Slax_plist_get);
+ defsubr (&Slax_plist_put);
defsubr (&Sequal);
defsubr (&Sfillarray);
defsubr (&Schar_table_subtype);
HCoop / bpt / emacs.git / blobdiff