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