Commit | Line | Data |
---|---|---|
35692fe0 | 1 | /* Lisp functions pertaining to editing. |
9772455e | 2 | Copyright (C) 1985, 1986, 1987, 1989, 1993 Free Software Foundation, Inc. |
35692fe0 JB |
3 | |
4 | This file is part of GNU Emacs. | |
5 | ||
6 | GNU Emacs is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 1, or (at your option) | |
9 | any later version. | |
10 | ||
11 | GNU Emacs is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with GNU Emacs; see the file COPYING. If not, write to | |
18 | the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
19 | ||
20 | ||
738429d1 JB |
21 | #include <sys/types.h> |
22 | ||
35692fe0 | 23 | #include "config.h" |
bfb61299 JB |
24 | |
25 | #ifdef VMS | |
956ace37 | 26 | #include "vms-pwd.h" |
bfb61299 | 27 | #else |
35692fe0 | 28 | #include <pwd.h> |
bfb61299 JB |
29 | #endif |
30 | ||
35692fe0 | 31 | #include "lisp.h" |
74d6d8c5 | 32 | #include "intervals.h" |
35692fe0 JB |
33 | #include "buffer.h" |
34 | #include "window.h" | |
35 | ||
956ace37 | 36 | #include "systime.h" |
35692fe0 JB |
37 | |
38 | #define min(a, b) ((a) < (b) ? (a) : (b)) | |
39 | #define max(a, b) ((a) > (b) ? (a) : (b)) | |
40 | ||
41 | /* Some static data, and a function to initialize it for each run */ | |
42 | ||
43 | Lisp_Object Vsystem_name; | |
44 | Lisp_Object Vuser_real_name; /* login name of current user ID */ | |
45 | Lisp_Object Vuser_full_name; /* full name of current user */ | |
46 | Lisp_Object Vuser_name; /* user name from USER or LOGNAME. */ | |
47 | ||
48 | void | |
49 | init_editfns () | |
50 | { | |
52b14ac0 | 51 | char *user_name; |
35692fe0 JB |
52 | register unsigned char *p, *q, *r; |
53 | struct passwd *pw; /* password entry for the current user */ | |
54 | extern char *index (); | |
55 | Lisp_Object tem; | |
56 | ||
57 | /* Set up system_name even when dumping. */ | |
58 | ||
59 | Vsystem_name = build_string (get_system_name ()); | |
60 | p = XSTRING (Vsystem_name)->data; | |
61 | while (*p) | |
62 | { | |
63 | if (*p == ' ' || *p == '\t') | |
64 | *p = '-'; | |
65 | p++; | |
66 | } | |
67 | ||
68 | #ifndef CANNOT_DUMP | |
69 | /* Don't bother with this on initial start when just dumping out */ | |
70 | if (!initialized) | |
71 | return; | |
72 | #endif /* not CANNOT_DUMP */ | |
73 | ||
74 | pw = (struct passwd *) getpwuid (getuid ()); | |
75 | Vuser_real_name = build_string (pw ? pw->pw_name : "unknown"); | |
76 | ||
52b14ac0 JB |
77 | /* Get the effective user name, by consulting environment variables, |
78 | or the effective uid if those are unset. */ | |
79 | user_name = (char *) getenv ("USER"); | |
35692fe0 | 80 | if (!user_name) |
52b14ac0 JB |
81 | user_name = (char *) getenv ("LOGNAME"); |
82 | if (!user_name) | |
83 | { | |
84 | pw = (struct passwd *) getpwuid (geteuid ()); | |
85 | user_name = (char *) (pw ? pw->pw_name : "unknown"); | |
86 | } | |
87 | Vuser_name = build_string (user_name); | |
35692fe0 | 88 | |
52b14ac0 JB |
89 | /* If the user name claimed in the environment vars differs from |
90 | the real uid, use the claimed name to find the full name. */ | |
35692fe0 | 91 | tem = Fstring_equal (Vuser_name, Vuser_real_name); |
56a98455 | 92 | if (NILP (tem)) |
52b14ac0 | 93 | pw = (struct passwd *) getpwnam (XSTRING (Vuser_name)->data); |
35692fe0 JB |
94 | |
95 | p = (unsigned char *) (pw ? USER_FULL_NAME : "unknown"); | |
96 | q = (unsigned char *) index (p, ','); | |
97 | Vuser_full_name = make_string (p, q ? q - p : strlen (p)); | |
98 | ||
99 | #ifdef AMPERSAND_FULL_NAME | |
100 | p = XSTRING (Vuser_full_name)->data; | |
101 | q = (char *) index (p, '&'); | |
102 | /* Substitute the login name for the &, upcasing the first character. */ | |
103 | if (q) | |
104 | { | |
105 | r = (char *) alloca (strlen (p) + XSTRING (Vuser_name)->size + 1); | |
106 | bcopy (p, r, q - p); | |
107 | r[q - p] = 0; | |
52b14ac0 | 108 | strcat (r, XSTRING (Vuser_name)->data); |
35692fe0 JB |
109 | r[q - p] = UPCASE (r[q - p]); |
110 | strcat (r, q + 1); | |
111 | Vuser_full_name = build_string (r); | |
112 | } | |
113 | #endif /* AMPERSAND_FULL_NAME */ | |
114 | } | |
115 | \f | |
116 | DEFUN ("char-to-string", Fchar_to_string, Schar_to_string, 1, 1, 0, | |
117 | "Convert arg CHAR to a one-character string containing that character.") | |
118 | (n) | |
119 | Lisp_Object n; | |
120 | { | |
121 | char c; | |
122 | CHECK_NUMBER (n, 0); | |
123 | ||
124 | c = XINT (n); | |
125 | return make_string (&c, 1); | |
126 | } | |
127 | ||
128 | DEFUN ("string-to-char", Fstring_to_char, Sstring_to_char, 1, 1, 0, | |
129 | "Convert arg STRING to a character, the first character of that string.") | |
130 | (str) | |
131 | register Lisp_Object str; | |
132 | { | |
133 | register Lisp_Object val; | |
134 | register struct Lisp_String *p; | |
135 | CHECK_STRING (str, 0); | |
136 | ||
137 | p = XSTRING (str); | |
138 | if (p->size) | |
139 | XFASTINT (val) = ((unsigned char *) p->data)[0]; | |
140 | else | |
141 | XFASTINT (val) = 0; | |
142 | return val; | |
143 | } | |
144 | \f | |
145 | static Lisp_Object | |
146 | buildmark (val) | |
147 | int val; | |
148 | { | |
149 | register Lisp_Object mark; | |
150 | mark = Fmake_marker (); | |
151 | Fset_marker (mark, make_number (val), Qnil); | |
152 | return mark; | |
153 | } | |
154 | ||
155 | DEFUN ("point", Fpoint, Spoint, 0, 0, 0, | |
156 | "Return value of point, as an integer.\n\ | |
157 | Beginning of buffer is position (point-min)") | |
158 | () | |
159 | { | |
160 | Lisp_Object temp; | |
161 | XFASTINT (temp) = point; | |
162 | return temp; | |
163 | } | |
164 | ||
165 | DEFUN ("point-marker", Fpoint_marker, Spoint_marker, 0, 0, 0, | |
166 | "Return value of point, as a marker object.") | |
167 | () | |
168 | { | |
169 | return buildmark (point); | |
170 | } | |
171 | ||
172 | int | |
173 | clip_to_bounds (lower, num, upper) | |
174 | int lower, num, upper; | |
175 | { | |
176 | if (num < lower) | |
177 | return lower; | |
178 | else if (num > upper) | |
179 | return upper; | |
180 | else | |
181 | return num; | |
182 | } | |
183 | ||
184 | DEFUN ("goto-char", Fgoto_char, Sgoto_char, 1, 1, "NGoto char: ", | |
185 | "Set point to POSITION, a number or marker.\n\ | |
186 | Beginning of buffer is position (point-min), end is (point-max).") | |
187 | (n) | |
188 | register Lisp_Object n; | |
189 | { | |
190 | CHECK_NUMBER_COERCE_MARKER (n, 0); | |
191 | ||
192 | SET_PT (clip_to_bounds (BEGV, XINT (n), ZV)); | |
193 | return n; | |
194 | } | |
195 | ||
196 | static Lisp_Object | |
197 | region_limit (beginningp) | |
198 | int beginningp; | |
199 | { | |
646d9d18 | 200 | extern Lisp_Object Vmark_even_if_inactive; /* Defined in callint.c. */ |
35692fe0 | 201 | register Lisp_Object m; |
c9dd14e1 RM |
202 | if (!NILP (Vtransient_mark_mode) && NILP (Vmark_even_if_inactive) |
203 | && NILP (current_buffer->mark_active)) | |
204 | Fsignal (Qmark_inactive, Qnil); | |
35692fe0 | 205 | m = Fmarker_position (current_buffer->mark); |
56a98455 | 206 | if (NILP (m)) error ("There is no region now"); |
35692fe0 JB |
207 | if ((point < XFASTINT (m)) == beginningp) |
208 | return (make_number (point)); | |
209 | else | |
210 | return (m); | |
211 | } | |
212 | ||
213 | DEFUN ("region-beginning", Fregion_beginning, Sregion_beginning, 0, 0, 0, | |
214 | "Return position of beginning of region, as an integer.") | |
215 | () | |
216 | { | |
217 | return (region_limit (1)); | |
218 | } | |
219 | ||
220 | DEFUN ("region-end", Fregion_end, Sregion_end, 0, 0, 0, | |
221 | "Return position of end of region, as an integer.") | |
222 | () | |
223 | { | |
224 | return (region_limit (0)); | |
225 | } | |
226 | ||
227 | #if 0 /* now in lisp code */ | |
228 | DEFUN ("mark", Fmark, Smark, 0, 0, 0, | |
229 | "Return this buffer's mark value as integer, or nil if no mark.\n\ | |
230 | If you are using this in an editing command, you are most likely making\n\ | |
231 | a mistake; see the documentation of `set-mark'.") | |
232 | () | |
233 | { | |
234 | return Fmarker_position (current_buffer->mark); | |
235 | } | |
236 | #endif /* commented out code */ | |
237 | ||
238 | DEFUN ("mark-marker", Fmark_marker, Smark_marker, 0, 0, 0, | |
239 | "Return this buffer's mark, as a marker object.\n\ | |
240 | Watch out! Moving this marker changes the mark position.\n\ | |
241 | If you set the marker not to point anywhere, the buffer will have no mark.") | |
242 | () | |
243 | { | |
244 | return current_buffer->mark; | |
245 | } | |
246 | ||
247 | #if 0 /* this is now in lisp code */ | |
248 | DEFUN ("set-mark", Fset_mark, Sset_mark, 1, 1, 0, | |
249 | "Set this buffer's mark to POS. Don't use this function!\n\ | |
250 | That is to say, don't use this function unless you want\n\ | |
251 | the user to see that the mark has moved, and you want the previous\n\ | |
252 | mark position to be lost.\n\ | |
253 | \n\ | |
254 | Normally, when a new mark is set, the old one should go on the stack.\n\ | |
255 | This is why most applications should use push-mark, not set-mark.\n\ | |
256 | \n\ | |
257 | Novice programmers often try to use the mark for the wrong purposes.\n\ | |
258 | The mark saves a location for the user's convenience.\n\ | |
259 | Most editing commands should not alter the mark.\n\ | |
260 | To remember a location for internal use in the Lisp program,\n\ | |
261 | store it in a Lisp variable. Example:\n\ | |
262 | \n\ | |
263 | (let ((beg (point))) (forward-line 1) (delete-region beg (point))).") | |
264 | (pos) | |
265 | Lisp_Object pos; | |
266 | { | |
56a98455 | 267 | if (NILP (pos)) |
35692fe0 JB |
268 | { |
269 | current_buffer->mark = Qnil; | |
270 | return Qnil; | |
271 | } | |
272 | CHECK_NUMBER_COERCE_MARKER (pos, 0); | |
273 | ||
56a98455 | 274 | if (NILP (current_buffer->mark)) |
35692fe0 JB |
275 | current_buffer->mark = Fmake_marker (); |
276 | ||
277 | Fset_marker (current_buffer->mark, pos, Qnil); | |
278 | return pos; | |
279 | } | |
280 | #endif /* commented-out code */ | |
281 | ||
282 | Lisp_Object | |
283 | save_excursion_save () | |
284 | { | |
0e2c9c70 JB |
285 | register int visible = (XBUFFER (XWINDOW (selected_window)->buffer) |
286 | == current_buffer); | |
35692fe0 JB |
287 | |
288 | return Fcons (Fpoint_marker (), | |
0e2c9c70 | 289 | Fcons (Fcopy_marker (current_buffer->mark), |
9772455e RS |
290 | Fcons (visible ? Qt : Qnil, |
291 | current_buffer->mark_active))); | |
35692fe0 JB |
292 | } |
293 | ||
294 | Lisp_Object | |
295 | save_excursion_restore (info) | |
296 | register Lisp_Object info; | |
297 | { | |
9772455e | 298 | register Lisp_Object tem, tem1; |
35692fe0 JB |
299 | |
300 | tem = Fmarker_buffer (Fcar (info)); | |
301 | /* If buffer being returned to is now deleted, avoid error */ | |
302 | /* Otherwise could get error here while unwinding to top level | |
303 | and crash */ | |
304 | /* In that case, Fmarker_buffer returns nil now. */ | |
56a98455 | 305 | if (NILP (tem)) |
35692fe0 JB |
306 | return Qnil; |
307 | Fset_buffer (tem); | |
308 | tem = Fcar (info); | |
309 | Fgoto_char (tem); | |
310 | unchain_marker (tem); | |
311 | tem = Fcar (Fcdr (info)); | |
312 | Fset_marker (current_buffer->mark, tem, Fcurrent_buffer ()); | |
313 | unchain_marker (tem); | |
314 | tem = Fcdr (Fcdr (info)); | |
9772455e RS |
315 | tem1 = Fcar (tem); |
316 | if (!NILP (tem1) | |
0e2c9c70 | 317 | && current_buffer != XBUFFER (XWINDOW (selected_window)->buffer)) |
35692fe0 | 318 | Fswitch_to_buffer (Fcurrent_buffer (), Qnil); |
9772455e RS |
319 | |
320 | tem1 = current_buffer->mark_active; | |
321 | current_buffer->mark_active = Fcdr (tem); | |
322 | if (! NILP (current_buffer->mark_active)) | |
323 | call1 (Vrun_hooks, intern ("activate-mark-hook")); | |
324 | else if (! NILP (tem1)) | |
325 | call1 (Vrun_hooks, intern ("deactivate-mark-hook")); | |
35692fe0 JB |
326 | return Qnil; |
327 | } | |
328 | ||
329 | DEFUN ("save-excursion", Fsave_excursion, Ssave_excursion, 0, UNEVALLED, 0, | |
330 | "Save point, mark, and current buffer; execute BODY; restore those things.\n\ | |
331 | Executes BODY just like `progn'.\n\ | |
332 | The values of point, mark and the current buffer are restored\n\ | |
9772455e RS |
333 | even in case of abnormal exit (throw or error).\n\ |
334 | The state of activation of the mark is also restored.") | |
35692fe0 JB |
335 | (args) |
336 | Lisp_Object args; | |
337 | { | |
338 | register Lisp_Object val; | |
339 | int count = specpdl_ptr - specpdl; | |
340 | ||
341 | record_unwind_protect (save_excursion_restore, save_excursion_save ()); | |
342 | ||
343 | val = Fprogn (args); | |
344 | return unbind_to (count, val); | |
345 | } | |
346 | \f | |
347 | DEFUN ("buffer-size", Fbufsize, Sbufsize, 0, 0, 0, | |
348 | "Return the number of characters in the current buffer.") | |
349 | () | |
350 | { | |
351 | Lisp_Object temp; | |
352 | XFASTINT (temp) = Z - BEG; | |
353 | return temp; | |
354 | } | |
355 | ||
356 | DEFUN ("point-min", Fpoint_min, Spoint_min, 0, 0, 0, | |
357 | "Return the minimum permissible value of point in the current buffer.\n\ | |
358 | This is 1, unless a clipping restriction is in effect.") | |
359 | () | |
360 | { | |
361 | Lisp_Object temp; | |
362 | XFASTINT (temp) = BEGV; | |
363 | return temp; | |
364 | } | |
365 | ||
366 | DEFUN ("point-min-marker", Fpoint_min_marker, Spoint_min_marker, 0, 0, 0, | |
367 | "Return a marker to the minimum permissible value of point in this buffer.\n\ | |
368 | This is the beginning, unless a clipping restriction is in effect.") | |
369 | () | |
370 | { | |
371 | return buildmark (BEGV); | |
372 | } | |
373 | ||
374 | DEFUN ("point-max", Fpoint_max, Spoint_max, 0, 0, 0, | |
375 | "Return the maximum permissible value of point in the current buffer.\n\ | |
376 | This is (1+ (buffer-size)), unless a clipping restriction is in effect,\n\ | |
377 | in which case it is less.") | |
378 | () | |
379 | { | |
380 | Lisp_Object temp; | |
381 | XFASTINT (temp) = ZV; | |
382 | return temp; | |
383 | } | |
384 | ||
385 | DEFUN ("point-max-marker", Fpoint_max_marker, Spoint_max_marker, 0, 0, 0, | |
386 | "Return a marker to the maximum permissible value of point in this buffer.\n\ | |
387 | This is (1+ (buffer-size)), unless a clipping restriction is in effect,\n\ | |
388 | in which case it is less.") | |
389 | () | |
390 | { | |
391 | return buildmark (ZV); | |
392 | } | |
393 | ||
850a8179 JB |
394 | DEFUN ("following-char", Ffollowing_char, Sfollowing_char, 0, 0, 0, |
395 | "Return the character following point, as a number.\n\ | |
396 | At the end of the buffer or accessible region, return 0.") | |
35692fe0 JB |
397 | () |
398 | { | |
399 | Lisp_Object temp; | |
850a8179 JB |
400 | if (point >= ZV) |
401 | XFASTINT (temp) = 0; | |
402 | else | |
403 | XFASTINT (temp) = FETCH_CHAR (point); | |
35692fe0 JB |
404 | return temp; |
405 | } | |
406 | ||
850a8179 JB |
407 | DEFUN ("preceding-char", Fprevious_char, Sprevious_char, 0, 0, 0, |
408 | "Return the character preceding point, as a number.\n\ | |
409 | At the beginning of the buffer or accessible region, return 0.") | |
35692fe0 JB |
410 | () |
411 | { | |
412 | Lisp_Object temp; | |
413 | if (point <= BEGV) | |
414 | XFASTINT (temp) = 0; | |
415 | else | |
416 | XFASTINT (temp) = FETCH_CHAR (point - 1); | |
417 | return temp; | |
418 | } | |
419 | ||
420 | DEFUN ("bobp", Fbobp, Sbobp, 0, 0, 0, | |
421 | "Return T if point is at the beginning of the buffer.\n\ | |
422 | If the buffer is narrowed, this means the beginning of the narrowed part.") | |
423 | () | |
424 | { | |
425 | if (point == BEGV) | |
426 | return Qt; | |
427 | return Qnil; | |
428 | } | |
429 | ||
430 | DEFUN ("eobp", Feobp, Seobp, 0, 0, 0, | |
431 | "Return T if point is at the end of the buffer.\n\ | |
432 | If the buffer is narrowed, this means the end of the narrowed part.") | |
433 | () | |
434 | { | |
435 | if (point == ZV) | |
436 | return Qt; | |
437 | return Qnil; | |
438 | } | |
439 | ||
440 | DEFUN ("bolp", Fbolp, Sbolp, 0, 0, 0, | |
441 | "Return T if point is at the beginning of a line.") | |
442 | () | |
443 | { | |
444 | if (point == BEGV || FETCH_CHAR (point - 1) == '\n') | |
445 | return Qt; | |
446 | return Qnil; | |
447 | } | |
448 | ||
449 | DEFUN ("eolp", Feolp, Seolp, 0, 0, 0, | |
450 | "Return T if point is at the end of a line.\n\ | |
451 | `End of a line' includes point being at the end of the buffer.") | |
452 | () | |
453 | { | |
454 | if (point == ZV || FETCH_CHAR (point) == '\n') | |
455 | return Qt; | |
456 | return Qnil; | |
457 | } | |
458 | ||
459 | DEFUN ("char-after", Fchar_after, Schar_after, 1, 1, 0, | |
460 | "Return character in current buffer at position POS.\n\ | |
461 | POS is an integer or a buffer pointer.\n\ | |
462 | If POS is out of range, the value is nil.") | |
463 | (pos) | |
464 | Lisp_Object pos; | |
465 | { | |
466 | register Lisp_Object val; | |
467 | register int n; | |
468 | ||
469 | CHECK_NUMBER_COERCE_MARKER (pos, 0); | |
470 | ||
471 | n = XINT (pos); | |
472 | if (n < BEGV || n >= ZV) return Qnil; | |
473 | ||
474 | XFASTINT (val) = FETCH_CHAR (n); | |
475 | return val; | |
476 | } | |
477 | \f | |
478 | DEFUN ("user-login-name", Fuser_login_name, Suser_login_name, 0, 0, 0, | |
479 | "Return the name under which the user logged in, as a string.\n\ | |
480 | This is based on the effective uid, not the real uid.\n\ | |
481 | Also, if the environment variable USER or LOGNAME is set,\n\ | |
482 | that determines the value of this function.") | |
483 | () | |
484 | { | |
485 | return Vuser_name; | |
486 | } | |
487 | ||
488 | DEFUN ("user-real-login-name", Fuser_real_login_name, Suser_real_login_name, | |
489 | 0, 0, 0, | |
490 | "Return the name of the user's real uid, as a string.\n\ | |
491 | Differs from `user-login-name' when running under `su'.") | |
492 | () | |
493 | { | |
494 | return Vuser_real_name; | |
495 | } | |
496 | ||
497 | DEFUN ("user-uid", Fuser_uid, Suser_uid, 0, 0, 0, | |
498 | "Return the effective uid of Emacs, as an integer.") | |
499 | () | |
500 | { | |
501 | return make_number (geteuid ()); | |
502 | } | |
503 | ||
504 | DEFUN ("user-real-uid", Fuser_real_uid, Suser_real_uid, 0, 0, 0, | |
505 | "Return the real uid of Emacs, as an integer.") | |
506 | () | |
507 | { | |
508 | return make_number (getuid ()); | |
509 | } | |
510 | ||
511 | DEFUN ("user-full-name", Fuser_full_name, Suser_full_name, 0, 0, 0, | |
512 | "Return the full name of the user logged in, as a string.") | |
513 | () | |
514 | { | |
515 | return Vuser_full_name; | |
516 | } | |
517 | ||
518 | DEFUN ("system-name", Fsystem_name, Ssystem_name, 0, 0, 0, | |
519 | "Return the name of the machine you are running on, as a string.") | |
520 | () | |
521 | { | |
522 | return Vsystem_name; | |
523 | } | |
524 | ||
d940e0e4 | 525 | DEFUN ("current-time", Fcurrent_time, Scurrent_time, 0, 0, 0, |
956ace37 JB |
526 | "Return the current time, as the number of seconds since 12:00 AM January 1970.\n\ |
527 | The time is returned as a list of three integers. The first has the\n\ | |
528 | most significant 16 bits of the seconds, while the second has the\n\ | |
529 | least significant 16 bits. The third integer gives the microsecond\n\ | |
530 | count.\n\ | |
531 | \n\ | |
532 | The microsecond count is zero on systems that do not provide\n\ | |
533 | resolution finer than a second.") | |
d940e0e4 JB |
534 | () |
535 | { | |
956ace37 JB |
536 | EMACS_TIME t; |
537 | Lisp_Object result[3]; | |
538 | ||
539 | EMACS_GET_TIME (t); | |
540 | XSET (result[0], Lisp_Int, (EMACS_SECS (t) >> 16) & 0xffff); | |
541 | XSET (result[1], Lisp_Int, (EMACS_SECS (t) >> 0) & 0xffff); | |
542 | XSET (result[2], Lisp_Int, EMACS_USECS (t)); | |
543 | ||
544 | return Flist (3, result); | |
d940e0e4 JB |
545 | } |
546 | \f | |
547 | ||
e3120ab5 JB |
548 | static int |
549 | lisp_time_argument (specified_time, result) | |
550 | Lisp_Object specified_time; | |
551 | time_t *result; | |
552 | { | |
553 | if (NILP (specified_time)) | |
554 | return time (result) != -1; | |
555 | else | |
556 | { | |
557 | Lisp_Object high, low; | |
558 | high = Fcar (specified_time); | |
559 | CHECK_NUMBER (high, 0); | |
560 | low = Fcdr (specified_time); | |
561 | if (XTYPE (low) == Lisp_Cons) | |
562 | low = Fcar (low); | |
563 | CHECK_NUMBER (low, 0); | |
564 | *result = (XINT (high) << 16) + (XINT (low) & 0xffff); | |
565 | return *result >> 16 == XINT (high); | |
566 | } | |
567 | } | |
568 | ||
2148f2b4 | 569 | DEFUN ("current-time-string", Fcurrent_time_string, Scurrent_time_string, 0, 1, 0, |
35692fe0 | 570 | "Return the current time, as a human-readable string.\n\ |
2148f2b4 RS |
571 | Programs can use this function to decode a time,\n\ |
572 | since the number of columns in each field is fixed.\n\ | |
573 | The format is `Sun Sep 16 01:03:52 1973'.\n\ | |
574 | If an argument is given, it specifies a time to format\n\ | |
575 | instead of the current time. The argument should have the form:\n\ | |
576 | (HIGH . LOW)\n\ | |
577 | or the form:\n\ | |
578 | (HIGH LOW . IGNORED).\n\ | |
579 | Thus, you can use times obtained from `current-time'\n\ | |
580 | and from `file-attributes'.") | |
581 | (specified_time) | |
582 | Lisp_Object specified_time; | |
583 | { | |
e3120ab5 | 584 | time_t value; |
35692fe0 | 585 | char buf[30]; |
2148f2b4 RS |
586 | register char *tem; |
587 | ||
e3120ab5 JB |
588 | if (! lisp_time_argument (specified_time, &value)) |
589 | value = -1; | |
2148f2b4 | 590 | tem = (char *) ctime (&value); |
35692fe0 JB |
591 | |
592 | strncpy (buf, tem, 24); | |
593 | buf[24] = 0; | |
594 | ||
595 | return build_string (buf); | |
596 | } | |
c2662aea | 597 | |
e3120ab5 JB |
598 | #define TM_YEAR_ORIGIN 1900 |
599 | ||
600 | /* Yield A - B, measured in seconds. */ | |
601 | static long | |
602 | difftm(a, b) | |
603 | struct tm *a, *b; | |
604 | { | |
605 | int ay = a->tm_year + (TM_YEAR_ORIGIN - 1); | |
606 | int by = b->tm_year + (TM_YEAR_ORIGIN - 1); | |
607 | return | |
608 | ( | |
609 | ( | |
610 | ( | |
611 | /* difference in day of year */ | |
612 | a->tm_yday - b->tm_yday | |
613 | /* + intervening leap days */ | |
614 | + ((ay >> 2) - (by >> 2)) | |
615 | - (ay/100 - by/100) | |
616 | + ((ay/100 >> 2) - (by/100 >> 2)) | |
617 | /* + difference in years * 365 */ | |
618 | + (long)(ay-by) * 365 | |
619 | )*24 + (a->tm_hour - b->tm_hour) | |
620 | )*60 + (a->tm_min - b->tm_min) | |
621 | )*60 + (a->tm_sec - b->tm_sec); | |
622 | } | |
623 | ||
624 | DEFUN ("current-time-zone", Fcurrent_time_zone, Scurrent_time_zone, 0, 1, 0, | |
625 | "Return the offset and name for the local time zone.\n\ | |
626 | This returns a list of the form (OFFSET NAME).\n\ | |
627 | OFFSET is an integer number of seconds ahead of UTC (east of Greenwich).\n\ | |
628 | A negative value means west of Greenwich.\n\ | |
629 | NAME is a string giving the name of the time zone.\n\ | |
630 | If an argument is given, it specifies when the time zone offset is determined\n\ | |
631 | instead of using the current time. The argument should have the form:\n\ | |
632 | (HIGH . LOW)\n\ | |
633 | or the form:\n\ | |
634 | (HIGH LOW . IGNORED).\n\ | |
635 | Thus, you can use times obtained from `current-time'\n\ | |
636 | and from `file-attributes'.\n\ | |
773c1fd3 JB |
637 | \n\ |
638 | Some operating systems cannot provide all this information to Emacs;\n\ | |
2d88f747 | 639 | in this case, `current-time-zone' returns a list containing nil for\n\ |
773c1fd3 | 640 | the data it can't find.") |
e3120ab5 JB |
641 | (specified_time) |
642 | Lisp_Object specified_time; | |
c2662aea | 643 | { |
e3120ab5 JB |
644 | time_t value; |
645 | struct tm *t; | |
c2662aea | 646 | |
e3120ab5 | 647 | if (lisp_time_argument (specified_time, &value) |
2d88f747 | 648 | && (t = gmtime (&value)) != 0) |
e3120ab5 | 649 | { |
2d88f747 | 650 | struct tm gmt; |
e3120ab5 JB |
651 | long offset; |
652 | char *s, buf[6]; | |
2d88f747 RS |
653 | |
654 | gmt = *t; /* Make a copy, in case localtime modifies *t. */ | |
655 | t = localtime (&value); | |
656 | offset = difftm (t, &gmt); | |
e3120ab5 JB |
657 | s = 0; |
658 | #ifdef HAVE_TM_ZONE | |
659 | if (t->tm_zone) | |
660 | s = t->tm_zone; | |
a7971c39 RS |
661 | #else /* not HAVE_TM_ZONE */ |
662 | #ifdef HAVE_TZNAME | |
663 | if (t->tm_isdst == 0 || t->tm_isdst == 1) | |
664 | s = tzname[t->tm_isdst]; | |
c2662aea | 665 | #endif |
a7971c39 | 666 | #endif /* not HAVE_TM_ZONE */ |
e3120ab5 JB |
667 | if (!s) |
668 | { | |
669 | /* No local time zone name is available; use "+-NNNN" instead. */ | |
00fc94d0 | 670 | int am = (offset < 0 ? -offset : offset) / 60; |
e3120ab5 JB |
671 | sprintf (buf, "%c%02d%02d", (offset < 0 ? '-' : '+'), am/60, am%60); |
672 | s = buf; | |
673 | } | |
674 | return Fcons (make_number (offset), Fcons (build_string (s), Qnil)); | |
675 | } | |
676 | else | |
677 | return Fmake_list (2, Qnil); | |
c2662aea JB |
678 | } |
679 | ||
35692fe0 JB |
680 | \f |
681 | void | |
682 | insert1 (arg) | |
683 | Lisp_Object arg; | |
684 | { | |
685 | Finsert (1, &arg); | |
686 | } | |
687 | ||
52b14ac0 JB |
688 | |
689 | /* Callers passing one argument to Finsert need not gcpro the | |
690 | argument "array", since the only element of the array will | |
691 | not be used after calling insert or insert_from_string, so | |
692 | we don't care if it gets trashed. */ | |
693 | ||
35692fe0 JB |
694 | DEFUN ("insert", Finsert, Sinsert, 0, MANY, 0, |
695 | "Insert the arguments, either strings or characters, at point.\n\ | |
696 | Point moves forward so that it ends up after the inserted text.\n\ | |
697 | Any other markers at the point of insertion remain before the text.") | |
698 | (nargs, args) | |
699 | int nargs; | |
700 | register Lisp_Object *args; | |
701 | { | |
702 | register int argnum; | |
703 | register Lisp_Object tem; | |
704 | char str[1]; | |
35692fe0 JB |
705 | |
706 | for (argnum = 0; argnum < nargs; argnum++) | |
707 | { | |
708 | tem = args[argnum]; | |
709 | retry: | |
710 | if (XTYPE (tem) == Lisp_Int) | |
711 | { | |
712 | str[0] = XINT (tem); | |
713 | insert (str, 1); | |
714 | } | |
715 | else if (XTYPE (tem) == Lisp_String) | |
716 | { | |
717 | insert_from_string (tem, 0, XSTRING (tem)->size); | |
718 | } | |
719 | else | |
720 | { | |
721 | tem = wrong_type_argument (Qchar_or_string_p, tem); | |
722 | goto retry; | |
723 | } | |
724 | } | |
725 | ||
35692fe0 JB |
726 | return Qnil; |
727 | } | |
728 | ||
729 | DEFUN ("insert-before-markers", Finsert_before_markers, Sinsert_before_markers, 0, MANY, 0, | |
730 | "Insert strings or characters at point, relocating markers after the text.\n\ | |
731 | Point moves forward so that it ends up after the inserted text.\n\ | |
732 | Any other markers at the point of insertion also end up after the text.") | |
733 | (nargs, args) | |
734 | int nargs; | |
735 | register Lisp_Object *args; | |
736 | { | |
737 | register int argnum; | |
738 | register Lisp_Object tem; | |
739 | char str[1]; | |
35692fe0 JB |
740 | |
741 | for (argnum = 0; argnum < nargs; argnum++) | |
742 | { | |
743 | tem = args[argnum]; | |
744 | retry: | |
745 | if (XTYPE (tem) == Lisp_Int) | |
746 | { | |
747 | str[0] = XINT (tem); | |
748 | insert_before_markers (str, 1); | |
749 | } | |
750 | else if (XTYPE (tem) == Lisp_String) | |
751 | { | |
752 | insert_from_string_before_markers (tem, 0, XSTRING (tem)->size); | |
753 | } | |
754 | else | |
755 | { | |
756 | tem = wrong_type_argument (Qchar_or_string_p, tem); | |
757 | goto retry; | |
758 | } | |
759 | } | |
760 | ||
35692fe0 JB |
761 | return Qnil; |
762 | } | |
763 | \f | |
764 | DEFUN ("insert-char", Finsert_char, Sinsert_char, 2, 2, 0, | |
765 | "Insert COUNT (second arg) copies of CHAR (first arg).\n\ | |
766 | Point and all markers are affected as in the function `insert'.\n\ | |
767 | Both arguments are required.") | |
768 | (chr, count) | |
769 | Lisp_Object chr, count; | |
770 | { | |
771 | register unsigned char *string; | |
772 | register int strlen; | |
773 | register int i, n; | |
774 | ||
775 | CHECK_NUMBER (chr, 0); | |
776 | CHECK_NUMBER (count, 1); | |
777 | ||
778 | n = XINT (count); | |
779 | if (n <= 0) | |
780 | return Qnil; | |
781 | strlen = min (n, 256); | |
782 | string = (unsigned char *) alloca (strlen); | |
783 | for (i = 0; i < strlen; i++) | |
784 | string[i] = XFASTINT (chr); | |
785 | while (n >= strlen) | |
786 | { | |
787 | insert (string, strlen); | |
788 | n -= strlen; | |
789 | } | |
790 | if (n > 0) | |
791 | insert (string, n); | |
792 | return Qnil; | |
793 | } | |
794 | ||
795 | \f | |
ffd56f97 JB |
796 | /* Making strings from buffer contents. */ |
797 | ||
798 | /* Return a Lisp_String containing the text of the current buffer from | |
74d6d8c5 | 799 | START to END. If text properties are in use and the current buffer |
eb8c3be9 | 800 | has properties in the range specified, the resulting string will also |
74d6d8c5 | 801 | have them. |
ffd56f97 JB |
802 | |
803 | We don't want to use plain old make_string here, because it calls | |
804 | make_uninit_string, which can cause the buffer arena to be | |
805 | compacted. make_string has no way of knowing that the data has | |
806 | been moved, and thus copies the wrong data into the string. This | |
807 | doesn't effect most of the other users of make_string, so it should | |
808 | be left as is. But we should use this function when conjuring | |
809 | buffer substrings. */ | |
74d6d8c5 | 810 | |
ffd56f97 JB |
811 | Lisp_Object |
812 | make_buffer_string (start, end) | |
813 | int start, end; | |
814 | { | |
815 | Lisp_Object result; | |
816 | ||
817 | if (start < GPT && GPT < end) | |
818 | move_gap (start); | |
819 | ||
820 | result = make_uninit_string (end - start); | |
821 | bcopy (&FETCH_CHAR (start), XSTRING (result)->data, end - start); | |
822 | ||
74d6d8c5 JA |
823 | /* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */ |
824 | copy_intervals_to_string (result, current_buffer, start, end - start); | |
825 | ||
ffd56f97 JB |
826 | return result; |
827 | } | |
35692fe0 JB |
828 | |
829 | DEFUN ("buffer-substring", Fbuffer_substring, Sbuffer_substring, 2, 2, 0, | |
830 | "Return the contents of part of the current buffer as a string.\n\ | |
831 | The two arguments START and END are character positions;\n\ | |
832 | they can be in either order.") | |
833 | (b, e) | |
834 | Lisp_Object b, e; | |
835 | { | |
836 | register int beg, end; | |
35692fe0 JB |
837 | |
838 | validate_region (&b, &e); | |
839 | beg = XINT (b); | |
840 | end = XINT (e); | |
841 | ||
ffd56f97 | 842 | return make_buffer_string (beg, end); |
35692fe0 JB |
843 | } |
844 | ||
845 | DEFUN ("buffer-string", Fbuffer_string, Sbuffer_string, 0, 0, 0, | |
846 | "Return the contents of the current buffer as a string.") | |
847 | () | |
848 | { | |
ffd56f97 | 849 | return make_buffer_string (BEGV, ZV); |
35692fe0 JB |
850 | } |
851 | ||
852 | DEFUN ("insert-buffer-substring", Finsert_buffer_substring, Sinsert_buffer_substring, | |
853 | 1, 3, 0, | |
83ea6fc2 | 854 | "Insert before point a substring of the contents of buffer BUFFER.\n\ |
35692fe0 JB |
855 | BUFFER may be a buffer or a buffer name.\n\ |
856 | Arguments START and END are character numbers specifying the substring.\n\ | |
857 | They default to the beginning and the end of BUFFER.") | |
858 | (buf, b, e) | |
859 | Lisp_Object buf, b, e; | |
860 | { | |
74d6d8c5 | 861 | register int beg, end, temp, len, opoint, start; |
35692fe0 | 862 | register struct buffer *bp; |
3fff2dfa | 863 | Lisp_Object buffer; |
35692fe0 | 864 | |
3fff2dfa RS |
865 | buffer = Fget_buffer (buf); |
866 | if (NILP (buffer)) | |
867 | nsberror (buf); | |
868 | bp = XBUFFER (buffer); | |
35692fe0 | 869 | |
56a98455 | 870 | if (NILP (b)) |
35692fe0 JB |
871 | beg = BUF_BEGV (bp); |
872 | else | |
873 | { | |
874 | CHECK_NUMBER_COERCE_MARKER (b, 0); | |
875 | beg = XINT (b); | |
876 | } | |
56a98455 | 877 | if (NILP (e)) |
35692fe0 JB |
878 | end = BUF_ZV (bp); |
879 | else | |
880 | { | |
881 | CHECK_NUMBER_COERCE_MARKER (e, 1); | |
882 | end = XINT (e); | |
883 | } | |
884 | ||
885 | if (beg > end) | |
74d6d8c5 | 886 | temp = beg, beg = end, end = temp; |
35692fe0 JB |
887 | |
888 | /* Move the gap or create enough gap in the current buffer. */ | |
889 | ||
890 | if (point != GPT) | |
891 | move_gap (point); | |
892 | if (GAP_SIZE < end - beg) | |
893 | make_gap (end - beg - GAP_SIZE); | |
894 | ||
74d6d8c5 JA |
895 | len = end - beg; |
896 | start = beg; | |
897 | opoint = point; | |
898 | ||
35692fe0 JB |
899 | if (!(BUF_BEGV (bp) <= beg |
900 | && beg <= end | |
901 | && end <= BUF_ZV (bp))) | |
902 | args_out_of_range (b, e); | |
903 | ||
904 | /* Now the actual insertion will not do any gap motion, | |
905 | so it matters not if BUF is the current buffer. */ | |
906 | if (beg < BUF_GPT (bp)) | |
907 | { | |
908 | insert (BUF_CHAR_ADDRESS (bp, beg), min (end, BUF_GPT (bp)) - beg); | |
909 | beg = min (end, BUF_GPT (bp)); | |
910 | } | |
911 | if (beg < end) | |
912 | insert (BUF_CHAR_ADDRESS (bp, beg), end - beg); | |
913 | ||
74d6d8c5 JA |
914 | /* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */ |
915 | graft_intervals_into_buffer (copy_intervals (bp->intervals, start, len), | |
916 | opoint, bp); | |
917 | ||
35692fe0 JB |
918 | return Qnil; |
919 | } | |
e9cf2084 RS |
920 | |
921 | DEFUN ("compare-buffer-substrings", Fcompare_buffer_substrings, Scompare_buffer_substrings, | |
922 | 6, 6, 0, | |
923 | "Compare two substrings of two buffers; return result as number.\n\ | |
924 | the value is -N if first string is less after N-1 chars,\n\ | |
925 | +N if first string is greater after N-1 chars, or 0 if strings match.\n\ | |
926 | Each substring is represented as three arguments: BUFFER, START and END.\n\ | |
927 | That makes six args in all, three for each substring.\n\n\ | |
928 | The value of `case-fold-search' in the current buffer\n\ | |
929 | determines whether case is significant or ignored.") | |
930 | (buffer1, start1, end1, buffer2, start2, end2) | |
931 | Lisp_Object buffer1, start1, end1, buffer2, start2, end2; | |
932 | { | |
933 | register int begp1, endp1, begp2, endp2, temp, len1, len2, length, i; | |
934 | register struct buffer *bp1, *bp2; | |
935 | register unsigned char *trt | |
936 | = (!NILP (current_buffer->case_fold_search) | |
937 | ? XSTRING (current_buffer->case_canon_table)->data : 0); | |
938 | ||
939 | /* Find the first buffer and its substring. */ | |
940 | ||
941 | if (NILP (buffer1)) | |
942 | bp1 = current_buffer; | |
943 | else | |
944 | { | |
3fff2dfa RS |
945 | Lisp_Object buf1; |
946 | buf1 = Fget_buffer (buffer1); | |
947 | if (NILP (buf1)) | |
948 | nsberror (buffer1); | |
949 | bp1 = XBUFFER (buf1); | |
e9cf2084 RS |
950 | } |
951 | ||
952 | if (NILP (start1)) | |
953 | begp1 = BUF_BEGV (bp1); | |
954 | else | |
955 | { | |
956 | CHECK_NUMBER_COERCE_MARKER (start1, 1); | |
957 | begp1 = XINT (start1); | |
958 | } | |
959 | if (NILP (end1)) | |
960 | endp1 = BUF_ZV (bp1); | |
961 | else | |
962 | { | |
963 | CHECK_NUMBER_COERCE_MARKER (end1, 2); | |
964 | endp1 = XINT (end1); | |
965 | } | |
966 | ||
967 | if (begp1 > endp1) | |
968 | temp = begp1, begp1 = endp1, endp1 = temp; | |
969 | ||
970 | if (!(BUF_BEGV (bp1) <= begp1 | |
971 | && begp1 <= endp1 | |
972 | && endp1 <= BUF_ZV (bp1))) | |
973 | args_out_of_range (start1, end1); | |
974 | ||
975 | /* Likewise for second substring. */ | |
976 | ||
977 | if (NILP (buffer2)) | |
978 | bp2 = current_buffer; | |
979 | else | |
980 | { | |
3fff2dfa RS |
981 | Lisp_Object buf2; |
982 | buf2 = Fget_buffer (buffer2); | |
983 | if (NILP (buf2)) | |
984 | nsberror (buffer2); | |
e9cf2084 RS |
985 | bp2 = XBUFFER (buffer2); |
986 | } | |
987 | ||
988 | if (NILP (start2)) | |
989 | begp2 = BUF_BEGV (bp2); | |
990 | else | |
991 | { | |
992 | CHECK_NUMBER_COERCE_MARKER (start2, 4); | |
993 | begp2 = XINT (start2); | |
994 | } | |
995 | if (NILP (end2)) | |
996 | endp2 = BUF_ZV (bp2); | |
997 | else | |
998 | { | |
999 | CHECK_NUMBER_COERCE_MARKER (end2, 5); | |
1000 | endp2 = XINT (end2); | |
1001 | } | |
1002 | ||
1003 | if (begp2 > endp2) | |
1004 | temp = begp2, begp2 = endp2, endp2 = temp; | |
1005 | ||
1006 | if (!(BUF_BEGV (bp2) <= begp2 | |
1007 | && begp2 <= endp2 | |
1008 | && endp2 <= BUF_ZV (bp2))) | |
1009 | args_out_of_range (start2, end2); | |
1010 | ||
1011 | len1 = endp1 - begp1; | |
1012 | len2 = endp2 - begp2; | |
1013 | length = len1; | |
1014 | if (len2 < length) | |
1015 | length = len2; | |
1016 | ||
1017 | for (i = 0; i < length; i++) | |
1018 | { | |
1019 | int c1 = *BUF_CHAR_ADDRESS (bp1, begp1 + i); | |
1020 | int c2 = *BUF_CHAR_ADDRESS (bp2, begp2 + i); | |
1021 | if (trt) | |
1022 | { | |
1023 | c1 = trt[c1]; | |
1024 | c2 = trt[c2]; | |
1025 | } | |
1026 | if (c1 < c2) | |
1027 | return make_number (- 1 - i); | |
1028 | if (c1 > c2) | |
1029 | return make_number (i + 1); | |
1030 | } | |
1031 | ||
1032 | /* The strings match as far as they go. | |
1033 | If one is shorter, that one is less. */ | |
1034 | if (length < len1) | |
1035 | return make_number (length + 1); | |
1036 | else if (length < len2) | |
1037 | return make_number (- length - 1); | |
1038 | ||
1039 | /* Same length too => they are equal. */ | |
1040 | return make_number (0); | |
1041 | } | |
35692fe0 JB |
1042 | \f |
1043 | DEFUN ("subst-char-in-region", Fsubst_char_in_region, | |
1044 | Ssubst_char_in_region, 4, 5, 0, | |
1045 | "From START to END, replace FROMCHAR with TOCHAR each time it occurs.\n\ | |
1046 | If optional arg NOUNDO is non-nil, don't record this change for undo\n\ | |
1047 | and don't mark the buffer as really changed.") | |
1048 | (start, end, fromchar, tochar, noundo) | |
1049 | Lisp_Object start, end, fromchar, tochar, noundo; | |
1050 | { | |
1051 | register int pos, stop, look; | |
1052 | ||
1053 | validate_region (&start, &end); | |
1054 | CHECK_NUMBER (fromchar, 2); | |
1055 | CHECK_NUMBER (tochar, 3); | |
1056 | ||
1057 | pos = XINT (start); | |
1058 | stop = XINT (end); | |
1059 | look = XINT (fromchar); | |
1060 | ||
04a759c8 | 1061 | modify_region (current_buffer, pos, stop); |
56a98455 | 1062 | if (! NILP (noundo)) |
35692fe0 JB |
1063 | { |
1064 | if (MODIFF - 1 == current_buffer->save_modified) | |
1065 | current_buffer->save_modified++; | |
1066 | if (MODIFF - 1 == current_buffer->auto_save_modified) | |
1067 | current_buffer->auto_save_modified++; | |
1068 | } | |
1069 | ||
1070 | while (pos < stop) | |
1071 | { | |
1072 | if (FETCH_CHAR (pos) == look) | |
1073 | { | |
56a98455 | 1074 | if (NILP (noundo)) |
35692fe0 JB |
1075 | record_change (pos, 1); |
1076 | FETCH_CHAR (pos) = XINT (tochar); | |
56a98455 | 1077 | if (NILP (noundo)) |
35692fe0 JB |
1078 | signal_after_change (pos, 1, 1); |
1079 | } | |
1080 | pos++; | |
1081 | } | |
1082 | ||
1083 | return Qnil; | |
1084 | } | |
1085 | ||
1086 | DEFUN ("translate-region", Ftranslate_region, Stranslate_region, 3, 3, 0, | |
1087 | "From START to END, translate characters according to TABLE.\n\ | |
1088 | TABLE is a string; the Nth character in it is the mapping\n\ | |
1089 | for the character with code N. Returns the number of characters changed.") | |
1090 | (start, end, table) | |
1091 | Lisp_Object start; | |
1092 | Lisp_Object end; | |
1093 | register Lisp_Object table; | |
1094 | { | |
1095 | register int pos, stop; /* Limits of the region. */ | |
1096 | register unsigned char *tt; /* Trans table. */ | |
1097 | register int oc; /* Old character. */ | |
1098 | register int nc; /* New character. */ | |
1099 | int cnt; /* Number of changes made. */ | |
1100 | Lisp_Object z; /* Return. */ | |
1101 | int size; /* Size of translate table. */ | |
1102 | ||
1103 | validate_region (&start, &end); | |
1104 | CHECK_STRING (table, 2); | |
1105 | ||
1106 | size = XSTRING (table)->size; | |
1107 | tt = XSTRING (table)->data; | |
1108 | ||
1109 | pos = XINT (start); | |
1110 | stop = XINT (end); | |
04a759c8 | 1111 | modify_region (current_buffer, pos, stop); |
35692fe0 JB |
1112 | |
1113 | cnt = 0; | |
1114 | for (; pos < stop; ++pos) | |
1115 | { | |
1116 | oc = FETCH_CHAR (pos); | |
1117 | if (oc < size) | |
1118 | { | |
1119 | nc = tt[oc]; | |
1120 | if (nc != oc) | |
1121 | { | |
1122 | record_change (pos, 1); | |
1123 | FETCH_CHAR (pos) = nc; | |
1124 | signal_after_change (pos, 1, 1); | |
1125 | ++cnt; | |
1126 | } | |
1127 | } | |
1128 | } | |
1129 | ||
1130 | XFASTINT (z) = cnt; | |
1131 | return (z); | |
1132 | } | |
1133 | ||
1134 | DEFUN ("delete-region", Fdelete_region, Sdelete_region, 2, 2, "r", | |
1135 | "Delete the text between point and mark.\n\ | |
1136 | When called from a program, expects two arguments,\n\ | |
1137 | positions (integers or markers) specifying the stretch to be deleted.") | |
1138 | (b, e) | |
1139 | Lisp_Object b, e; | |
1140 | { | |
1141 | validate_region (&b, &e); | |
1142 | del_range (XINT (b), XINT (e)); | |
1143 | return Qnil; | |
1144 | } | |
1145 | \f | |
1146 | DEFUN ("widen", Fwiden, Swiden, 0, 0, "", | |
1147 | "Remove restrictions (narrowing) from current buffer.\n\ | |
1148 | This allows the buffer's full text to be seen and edited.") | |
1149 | () | |
1150 | { | |
1151 | BEGV = BEG; | |
1152 | SET_BUF_ZV (current_buffer, Z); | |
1153 | clip_changed = 1; | |
52b14ac0 JB |
1154 | /* Changing the buffer bounds invalidates any recorded current column. */ |
1155 | invalidate_current_column (); | |
35692fe0 JB |
1156 | return Qnil; |
1157 | } | |
1158 | ||
1159 | DEFUN ("narrow-to-region", Fnarrow_to_region, Snarrow_to_region, 2, 2, "r", | |
1160 | "Restrict editing in this buffer to the current region.\n\ | |
1161 | The rest of the text becomes temporarily invisible and untouchable\n\ | |
1162 | but is not deleted; if you save the buffer in a file, the invisible\n\ | |
1163 | text is included in the file. \\[widen] makes all visible again.\n\ | |
1164 | See also `save-restriction'.\n\ | |
1165 | \n\ | |
1166 | When calling from a program, pass two arguments; positions (integers\n\ | |
1167 | or markers) bounding the text that should remain visible.") | |
1168 | (b, e) | |
1169 | register Lisp_Object b, e; | |
1170 | { | |
1171 | register int i; | |
1172 | ||
1173 | CHECK_NUMBER_COERCE_MARKER (b, 0); | |
1174 | CHECK_NUMBER_COERCE_MARKER (e, 1); | |
1175 | ||
1176 | if (XINT (b) > XINT (e)) | |
1177 | { | |
1178 | i = XFASTINT (b); | |
1179 | b = e; | |
1180 | XFASTINT (e) = i; | |
1181 | } | |
1182 | ||
1183 | if (!(BEG <= XINT (b) && XINT (b) <= XINT (e) && XINT (e) <= Z)) | |
1184 | args_out_of_range (b, e); | |
1185 | ||
1186 | BEGV = XFASTINT (b); | |
1187 | SET_BUF_ZV (current_buffer, XFASTINT (e)); | |
1188 | if (point < XFASTINT (b)) | |
1189 | SET_PT (XFASTINT (b)); | |
1190 | if (point > XFASTINT (e)) | |
1191 | SET_PT (XFASTINT (e)); | |
1192 | clip_changed = 1; | |
52b14ac0 JB |
1193 | /* Changing the buffer bounds invalidates any recorded current column. */ |
1194 | invalidate_current_column (); | |
35692fe0 JB |
1195 | return Qnil; |
1196 | } | |
1197 | ||
1198 | Lisp_Object | |
1199 | save_restriction_save () | |
1200 | { | |
1201 | register Lisp_Object bottom, top; | |
1202 | /* Note: I tried using markers here, but it does not win | |
1203 | because insertion at the end of the saved region | |
1204 | does not advance mh and is considered "outside" the saved region. */ | |
1205 | XFASTINT (bottom) = BEGV - BEG; | |
1206 | XFASTINT (top) = Z - ZV; | |
1207 | ||
1208 | return Fcons (Fcurrent_buffer (), Fcons (bottom, top)); | |
1209 | } | |
1210 | ||
1211 | Lisp_Object | |
1212 | save_restriction_restore (data) | |
1213 | Lisp_Object data; | |
1214 | { | |
1215 | register struct buffer *buf; | |
1216 | register int newhead, newtail; | |
1217 | register Lisp_Object tem; | |
1218 | ||
1219 | buf = XBUFFER (XCONS (data)->car); | |
1220 | ||
1221 | data = XCONS (data)->cdr; | |
1222 | ||
1223 | tem = XCONS (data)->car; | |
1224 | newhead = XINT (tem); | |
1225 | tem = XCONS (data)->cdr; | |
1226 | newtail = XINT (tem); | |
1227 | if (newhead + newtail > BUF_Z (buf) - BUF_BEG (buf)) | |
1228 | { | |
1229 | newhead = 0; | |
1230 | newtail = 0; | |
1231 | } | |
1232 | BUF_BEGV (buf) = BUF_BEG (buf) + newhead; | |
1233 | SET_BUF_ZV (buf, BUF_Z (buf) - newtail); | |
1234 | clip_changed = 1; | |
1235 | ||
1236 | /* If point is outside the new visible range, move it inside. */ | |
1237 | SET_BUF_PT (buf, | |
1238 | clip_to_bounds (BUF_BEGV (buf), BUF_PT (buf), BUF_ZV (buf))); | |
1239 | ||
1240 | return Qnil; | |
1241 | } | |
1242 | ||
1243 | DEFUN ("save-restriction", Fsave_restriction, Ssave_restriction, 0, UNEVALLED, 0, | |
1244 | "Execute BODY, saving and restoring current buffer's restrictions.\n\ | |
1245 | The buffer's restrictions make parts of the beginning and end invisible.\n\ | |
1246 | \(They are set up with `narrow-to-region' and eliminated with `widen'.)\n\ | |
1247 | This special form, `save-restriction', saves the current buffer's restrictions\n\ | |
1248 | when it is entered, and restores them when it is exited.\n\ | |
1249 | So any `narrow-to-region' within BODY lasts only until the end of the form.\n\ | |
1250 | The old restrictions settings are restored\n\ | |
1251 | even in case of abnormal exit (throw or error).\n\ | |
1252 | \n\ | |
1253 | The value returned is the value of the last form in BODY.\n\ | |
1254 | \n\ | |
1255 | `save-restriction' can get confused if, within the BODY, you widen\n\ | |
1256 | and then make changes outside the area within the saved restrictions.\n\ | |
1257 | \n\ | |
1258 | Note: if you are using both `save-excursion' and `save-restriction',\n\ | |
1259 | use `save-excursion' outermost:\n\ | |
1260 | (save-excursion (save-restriction ...))") | |
1261 | (body) | |
1262 | Lisp_Object body; | |
1263 | { | |
1264 | register Lisp_Object val; | |
1265 | int count = specpdl_ptr - specpdl; | |
1266 | ||
1267 | record_unwind_protect (save_restriction_restore, save_restriction_save ()); | |
1268 | val = Fprogn (body); | |
1269 | return unbind_to (count, val); | |
1270 | } | |
1271 | \f | |
1272 | DEFUN ("message", Fmessage, Smessage, 1, MANY, 0, | |
1273 | "Print a one-line message at the bottom of the screen.\n\ | |
1274 | The first argument is a control string.\n\ | |
1275 | It may contain %s or %d or %c to print successive following arguments.\n\ | |
1276 | %s means print an argument as a string, %d means print as number in decimal,\n\ | |
1277 | %c means print a number as a single character.\n\ | |
1278 | The argument used by %s must be a string or a symbol;\n\ | |
ccdac5be JB |
1279 | the argument used by %d or %c must be a number.\n\ |
1280 | If the first argument is nil, clear any existing message; let the\n\ | |
1281 | minibuffer contents show.") | |
35692fe0 JB |
1282 | (nargs, args) |
1283 | int nargs; | |
1284 | Lisp_Object *args; | |
1285 | { | |
ccdac5be | 1286 | if (NILP (args[0])) |
f0250249 JB |
1287 | { |
1288 | message (0); | |
1289 | return Qnil; | |
1290 | } | |
ccdac5be JB |
1291 | else |
1292 | { | |
1293 | register Lisp_Object val; | |
1294 | val = Fformat (nargs, args); | |
1295 | message ("%s", XSTRING (val)->data); | |
1296 | return val; | |
1297 | } | |
35692fe0 JB |
1298 | } |
1299 | ||
1300 | DEFUN ("format", Fformat, Sformat, 1, MANY, 0, | |
1301 | "Format a string out of a control-string and arguments.\n\ | |
1302 | The first argument is a control string.\n\ | |
1303 | The other arguments are substituted into it to make the result, a string.\n\ | |
1304 | It may contain %-sequences meaning to substitute the next argument.\n\ | |
1305 | %s means print a string argument. Actually, prints any object, with `princ'.\n\ | |
1306 | %d means print as number in decimal (%o octal, %x hex).\n\ | |
1307 | %c means print a number as a single character.\n\ | |
1308 | %S means print any object as an s-expression (using prin1).\n\ | |
52b14ac0 JB |
1309 | The argument used for %d, %o, %x or %c must be a number.\n\ |
1310 | Use %% to put a single % into the output.") | |
35692fe0 JB |
1311 | (nargs, args) |
1312 | int nargs; | |
1313 | register Lisp_Object *args; | |
1314 | { | |
1315 | register int n; /* The number of the next arg to substitute */ | |
1316 | register int total = 5; /* An estimate of the final length */ | |
1317 | char *buf; | |
1318 | register unsigned char *format, *end; | |
1319 | int length; | |
1320 | extern char *index (); | |
1321 | /* It should not be necessary to GCPRO ARGS, because | |
1322 | the caller in the interpreter should take care of that. */ | |
1323 | ||
1324 | CHECK_STRING (args[0], 0); | |
1325 | format = XSTRING (args[0])->data; | |
1326 | end = format + XSTRING (args[0])->size; | |
1327 | ||
1328 | n = 0; | |
1329 | while (format != end) | |
1330 | if (*format++ == '%') | |
1331 | { | |
1332 | int minlen; | |
1333 | ||
1334 | /* Process a numeric arg and skip it. */ | |
1335 | minlen = atoi (format); | |
1336 | if (minlen > 0) | |
1337 | total += minlen; | |
1338 | else | |
1339 | total -= minlen; | |
1340 | while ((*format >= '0' && *format <= '9') | |
1341 | || *format == '-' || *format == ' ' || *format == '.') | |
1342 | format++; | |
1343 | ||
1344 | if (*format == '%') | |
1345 | format++; | |
1346 | else if (++n >= nargs) | |
1347 | ; | |
1348 | else if (*format == 'S') | |
1349 | { | |
1350 | /* For `S', prin1 the argument and then treat like a string. */ | |
1351 | register Lisp_Object tem; | |
1352 | tem = Fprin1_to_string (args[n], Qnil); | |
1353 | args[n] = tem; | |
1354 | goto string; | |
1355 | } | |
1356 | else if (XTYPE (args[n]) == Lisp_Symbol) | |
1357 | { | |
1358 | XSET (args[n], Lisp_String, XSYMBOL (args[n])->name); | |
1359 | goto string; | |
1360 | } | |
1361 | else if (XTYPE (args[n]) == Lisp_String) | |
1362 | { | |
1363 | string: | |
1364 | total += XSTRING (args[n])->size; | |
1365 | } | |
1366 | /* Would get MPV otherwise, since Lisp_Int's `point' to low memory. */ | |
1367 | else if (XTYPE (args[n]) == Lisp_Int && *format != 's') | |
1368 | { | |
4746118a | 1369 | #ifdef LISP_FLOAT_TYPE |
eb8c3be9 | 1370 | /* The following loop assumes the Lisp type indicates |
35692fe0 JB |
1371 | the proper way to pass the argument. |
1372 | So make sure we have a flonum if the argument should | |
1373 | be a double. */ | |
1374 | if (*format == 'e' || *format == 'f' || *format == 'g') | |
1375 | args[n] = Ffloat (args[n]); | |
4746118a | 1376 | #endif |
35692fe0 JB |
1377 | total += 10; |
1378 | } | |
4746118a | 1379 | #ifdef LISP_FLOAT_TYPE |
35692fe0 JB |
1380 | else if (XTYPE (args[n]) == Lisp_Float && *format != 's') |
1381 | { | |
1382 | if (! (*format == 'e' || *format == 'f' || *format == 'g')) | |
1383 | args[n] = Ftruncate (args[n]); | |
1384 | total += 20; | |
1385 | } | |
4746118a | 1386 | #endif |
35692fe0 JB |
1387 | else |
1388 | { | |
1389 | /* Anything but a string, convert to a string using princ. */ | |
1390 | register Lisp_Object tem; | |
1391 | tem = Fprin1_to_string (args[n], Qt); | |
1392 | args[n] = tem; | |
1393 | goto string; | |
1394 | } | |
1395 | } | |
1396 | ||
1397 | { | |
1398 | register int nstrings = n + 1; | |
50aa2f90 JB |
1399 | |
1400 | /* Allocate twice as many strings as we have %-escapes; floats occupy | |
1401 | two slots, and we're not sure how many of those we have. */ | |
35692fe0 | 1402 | register unsigned char **strings |
50aa2f90 JB |
1403 | = (unsigned char **) alloca (2 * nstrings * sizeof (unsigned char *)); |
1404 | int i; | |
35692fe0 | 1405 | |
50aa2f90 | 1406 | i = 0; |
35692fe0 JB |
1407 | for (n = 0; n < nstrings; n++) |
1408 | { | |
1409 | if (n >= nargs) | |
50aa2f90 | 1410 | strings[i++] = (unsigned char *) ""; |
35692fe0 JB |
1411 | else if (XTYPE (args[n]) == Lisp_Int) |
1412 | /* We checked above that the corresponding format effector | |
1413 | isn't %s, which would cause MPV. */ | |
50aa2f90 | 1414 | strings[i++] = (unsigned char *) XINT (args[n]); |
4746118a | 1415 | #ifdef LISP_FLOAT_TYPE |
35692fe0 JB |
1416 | else if (XTYPE (args[n]) == Lisp_Float) |
1417 | { | |
1418 | union { double d; int half[2]; } u; | |
1419 | ||
1420 | u.d = XFLOAT (args[n])->data; | |
50aa2f90 JB |
1421 | strings[i++] = (unsigned char *) u.half[0]; |
1422 | strings[i++] = (unsigned char *) u.half[1]; | |
35692fe0 | 1423 | } |
4746118a | 1424 | #endif |
35692fe0 | 1425 | else |
50aa2f90 | 1426 | strings[i++] = XSTRING (args[n])->data; |
35692fe0 JB |
1427 | } |
1428 | ||
1429 | /* Format it in bigger and bigger buf's until it all fits. */ | |
1430 | while (1) | |
1431 | { | |
1432 | buf = (char *) alloca (total + 1); | |
1433 | buf[total - 1] = 0; | |
1434 | ||
50aa2f90 | 1435 | length = doprnt (buf, total + 1, strings[0], end, i-1, strings + 1); |
35692fe0 JB |
1436 | if (buf[total - 1] == 0) |
1437 | break; | |
1438 | ||
1439 | total *= 2; | |
1440 | } | |
1441 | } | |
1442 | ||
1443 | /* UNGCPRO; */ | |
1444 | return make_string (buf, length); | |
1445 | } | |
1446 | ||
1447 | /* VARARGS 1 */ | |
1448 | Lisp_Object | |
1449 | #ifdef NO_ARG_ARRAY | |
1450 | format1 (string1, arg0, arg1, arg2, arg3, arg4) | |
1451 | int arg0, arg1, arg2, arg3, arg4; | |
1452 | #else | |
1453 | format1 (string1) | |
1454 | #endif | |
1455 | char *string1; | |
1456 | { | |
1457 | char buf[100]; | |
1458 | #ifdef NO_ARG_ARRAY | |
1459 | int args[5]; | |
1460 | args[0] = arg0; | |
1461 | args[1] = arg1; | |
1462 | args[2] = arg2; | |
1463 | args[3] = arg3; | |
1464 | args[4] = arg4; | |
1465 | doprnt (buf, sizeof buf, string1, 0, 5, args); | |
1466 | #else | |
1467 | doprnt (buf, sizeof buf, string1, 0, 5, &string1 + 1); | |
1468 | #endif | |
1469 | return build_string (buf); | |
1470 | } | |
1471 | \f | |
1472 | DEFUN ("char-equal", Fchar_equal, Schar_equal, 2, 2, 0, | |
1473 | "Return t if two characters match, optionally ignoring case.\n\ | |
1474 | Both arguments must be characters (i.e. integers).\n\ | |
1475 | Case is ignored if `case-fold-search' is non-nil in the current buffer.") | |
1476 | (c1, c2) | |
1477 | register Lisp_Object c1, c2; | |
1478 | { | |
1479 | unsigned char *downcase = DOWNCASE_TABLE; | |
1480 | CHECK_NUMBER (c1, 0); | |
1481 | CHECK_NUMBER (c2, 1); | |
1482 | ||
56a98455 | 1483 | if (!NILP (current_buffer->case_fold_search) |
c34beca9 RS |
1484 | ? (downcase[0xff & XFASTINT (c1)] == downcase[0xff & XFASTINT (c2)] |
1485 | && (XFASTINT (c1) & ~0xff) == (XFASTINT (c2) & ~0xff)) | |
35692fe0 JB |
1486 | : XINT (c1) == XINT (c2)) |
1487 | return Qt; | |
1488 | return Qnil; | |
1489 | } | |
1490 | ||
35692fe0 JB |
1491 | \f |
1492 | void | |
1493 | syms_of_editfns () | |
1494 | { | |
1495 | DEFVAR_LISP ("system-name", &Vsystem_name, | |
1496 | "The name of the machine Emacs is running on."); | |
1497 | ||
1498 | DEFVAR_LISP ("user-full-name", &Vuser_full_name, | |
1499 | "The full name of the user logged in."); | |
1500 | ||
1501 | DEFVAR_LISP ("user-name", &Vuser_name, | |
1502 | "The user's name, based on the effective uid."); | |
1503 | ||
1504 | DEFVAR_LISP ("user-real-name", &Vuser_real_name, | |
1505 | "The user's name, base upon the real uid."); | |
1506 | ||
1507 | defsubr (&Schar_equal); | |
1508 | defsubr (&Sgoto_char); | |
1509 | defsubr (&Sstring_to_char); | |
1510 | defsubr (&Schar_to_string); | |
1511 | defsubr (&Sbuffer_substring); | |
1512 | defsubr (&Sbuffer_string); | |
1513 | ||
1514 | defsubr (&Spoint_marker); | |
1515 | defsubr (&Smark_marker); | |
1516 | defsubr (&Spoint); | |
1517 | defsubr (&Sregion_beginning); | |
1518 | defsubr (&Sregion_end); | |
1519 | /* defsubr (&Smark); */ | |
1520 | /* defsubr (&Sset_mark); */ | |
1521 | defsubr (&Ssave_excursion); | |
1522 | ||
1523 | defsubr (&Sbufsize); | |
1524 | defsubr (&Spoint_max); | |
1525 | defsubr (&Spoint_min); | |
1526 | defsubr (&Spoint_min_marker); | |
1527 | defsubr (&Spoint_max_marker); | |
1528 | ||
1529 | defsubr (&Sbobp); | |
1530 | defsubr (&Seobp); | |
1531 | defsubr (&Sbolp); | |
1532 | defsubr (&Seolp); | |
850a8179 JB |
1533 | defsubr (&Sfollowing_char); |
1534 | defsubr (&Sprevious_char); | |
35692fe0 JB |
1535 | defsubr (&Schar_after); |
1536 | defsubr (&Sinsert); | |
1537 | defsubr (&Sinsert_before_markers); | |
1538 | defsubr (&Sinsert_char); | |
1539 | ||
1540 | defsubr (&Suser_login_name); | |
1541 | defsubr (&Suser_real_login_name); | |
1542 | defsubr (&Suser_uid); | |
1543 | defsubr (&Suser_real_uid); | |
1544 | defsubr (&Suser_full_name); | |
d940e0e4 | 1545 | defsubr (&Scurrent_time); |
35692fe0 | 1546 | defsubr (&Scurrent_time_string); |
c2662aea | 1547 | defsubr (&Scurrent_time_zone); |
35692fe0 | 1548 | defsubr (&Ssystem_name); |
35692fe0 JB |
1549 | defsubr (&Smessage); |
1550 | defsubr (&Sformat); | |
35692fe0 JB |
1551 | |
1552 | defsubr (&Sinsert_buffer_substring); | |
e9cf2084 | 1553 | defsubr (&Scompare_buffer_substrings); |
35692fe0 JB |
1554 | defsubr (&Ssubst_char_in_region); |
1555 | defsubr (&Stranslate_region); | |
1556 | defsubr (&Sdelete_region); | |
1557 | defsubr (&Swiden); | |
1558 | defsubr (&Snarrow_to_region); | |
1559 | defsubr (&Ssave_restriction); | |
1560 | } |