diff options
| author | Ken Raeburn | 2001-10-16 09:09:51 +0000 |
|---|---|---|
| committer | Ken Raeburn | 2001-10-16 09:09:51 +0000 |
| commit | f3fbd1553534bb85c75baf891c0ca9aaa4c3fa6f (patch) | |
| tree | 43eb51ff0ca4af1705387403827ef210098f2da8 /src/search.c | |
| parent | 018ba359ab456f6a43f3acea0c15df616aa0ad02 (diff) | |
| download | emacs-f3fbd1553534bb85c75baf891c0ca9aaa4c3fa6f.tar.gz emacs-f3fbd1553534bb85c75baf891c0ca9aaa4c3fa6f.zip | |
Avoid (most) uses of XCAR/XCDR as lvalues, for flexibility in experimenting
with lisp system changes.
Diffstat (limited to 'src/search.c')
| -rw-r--r-- | src/search.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/search.c b/src/search.c index f05f2cc0bf3..519a7b48665 100644 --- a/src/search.c +++ b/src/search.c | |||
| @@ -2691,16 +2691,16 @@ to hold all the values, and if INTEGERS is non-nil, no consing is done.") | |||
| 2691 | i++, tail = XCDR (tail)) | 2691 | i++, tail = XCDR (tail)) |
| 2692 | { | 2692 | { |
| 2693 | if (i < 2 * len + 2) | 2693 | if (i < 2 * len + 2) |
| 2694 | XCAR (tail) = data[i]; | 2694 | XSETCAR (tail, data[i]); |
| 2695 | else | 2695 | else |
| 2696 | XCAR (tail) = Qnil; | 2696 | XSETCAR (tail, Qnil); |
| 2697 | prev = tail; | 2697 | prev = tail; |
| 2698 | } | 2698 | } |
| 2699 | 2699 | ||
| 2700 | /* If we couldn't fit all value elements into REUSE, | 2700 | /* If we couldn't fit all value elements into REUSE, |
| 2701 | cons up the rest of them and add them to the end of REUSE. */ | 2701 | cons up the rest of them and add them to the end of REUSE. */ |
| 2702 | if (i < 2 * len + 2) | 2702 | if (i < 2 * len + 2) |
| 2703 | XCDR (prev) = Flist (2 * len + 2 - i, data + i); | 2703 | XSETCDR (prev, Flist (2 * len + 2 - i, data + i)); |
| 2704 | 2704 | ||
| 2705 | return reuse; | 2705 | return reuse; |
| 2706 | } | 2706 | } |