diff options
Diffstat (limited to 'src/undo.c')
| -rw-r--r-- | src/undo.c | 62 |
1 files changed, 31 insertions, 31 deletions
diff --git a/src/undo.c b/src/undo.c index 933982ec30c..f6953fabfec 100644 --- a/src/undo.c +++ b/src/undo.c | |||
| @@ -73,12 +73,12 @@ record_point (EMACS_INT pt) | |||
| 73 | Fundo_boundary (); | 73 | Fundo_boundary (); |
| 74 | last_undo_buffer = current_buffer; | 74 | last_undo_buffer = current_buffer; |
| 75 | 75 | ||
| 76 | if (CONSP (current_buffer->undo_list)) | 76 | if (CONSP (B_ (current_buffer, undo_list))) |
| 77 | { | 77 | { |
| 78 | /* Set AT_BOUNDARY to 1 only when we have nothing other than | 78 | /* Set AT_BOUNDARY to 1 only when we have nothing other than |
| 79 | marker adjustment before undo boundary. */ | 79 | marker adjustment before undo boundary. */ |
| 80 | 80 | ||
| 81 | Lisp_Object tail = current_buffer->undo_list, elt; | 81 | Lisp_Object tail = B_ (current_buffer, undo_list), elt; |
| 82 | 82 | ||
| 83 | while (1) | 83 | while (1) |
| 84 | { | 84 | { |
| @@ -103,8 +103,8 @@ record_point (EMACS_INT pt) | |||
| 103 | if (at_boundary | 103 | if (at_boundary |
| 104 | && current_buffer == last_boundary_buffer | 104 | && current_buffer == last_boundary_buffer |
| 105 | && last_boundary_position != pt) | 105 | && last_boundary_position != pt) |
| 106 | current_buffer->undo_list | 106 | B_ (current_buffer, undo_list) |
| 107 | = Fcons (make_number (last_boundary_position), current_buffer->undo_list); | 107 | = Fcons (make_number (last_boundary_position), B_ (current_buffer, undo_list)); |
| 108 | } | 108 | } |
| 109 | 109 | ||
| 110 | /* Record an insertion that just happened or is about to happen, | 110 | /* Record an insertion that just happened or is about to happen, |
| @@ -117,17 +117,17 @@ record_insert (EMACS_INT beg, EMACS_INT length) | |||
| 117 | { | 117 | { |
| 118 | Lisp_Object lbeg, lend; | 118 | Lisp_Object lbeg, lend; |
| 119 | 119 | ||
| 120 | if (EQ (current_buffer->undo_list, Qt)) | 120 | if (EQ (B_ (current_buffer, undo_list), Qt)) |
| 121 | return; | 121 | return; |
| 122 | 122 | ||
| 123 | record_point (beg); | 123 | record_point (beg); |
| 124 | 124 | ||
| 125 | /* If this is following another insertion and consecutive with it | 125 | /* If this is following another insertion and consecutive with it |
| 126 | in the buffer, combine the two. */ | 126 | in the buffer, combine the two. */ |
| 127 | if (CONSP (current_buffer->undo_list)) | 127 | if (CONSP (B_ (current_buffer, undo_list))) |
| 128 | { | 128 | { |
| 129 | Lisp_Object elt; | 129 | Lisp_Object elt; |
| 130 | elt = XCAR (current_buffer->undo_list); | 130 | elt = XCAR (B_ (current_buffer, undo_list)); |
| 131 | if (CONSP (elt) | 131 | if (CONSP (elt) |
| 132 | && INTEGERP (XCAR (elt)) | 132 | && INTEGERP (XCAR (elt)) |
| 133 | && INTEGERP (XCDR (elt)) | 133 | && INTEGERP (XCDR (elt)) |
| @@ -140,8 +140,8 @@ record_insert (EMACS_INT beg, EMACS_INT length) | |||
| 140 | 140 | ||
| 141 | XSETFASTINT (lbeg, beg); | 141 | XSETFASTINT (lbeg, beg); |
| 142 | XSETINT (lend, beg + length); | 142 | XSETINT (lend, beg + length); |
| 143 | current_buffer->undo_list = Fcons (Fcons (lbeg, lend), | 143 | B_ (current_buffer, undo_list) = Fcons (Fcons (lbeg, lend), |
| 144 | current_buffer->undo_list); | 144 | B_ (current_buffer, undo_list)); |
| 145 | } | 145 | } |
| 146 | 146 | ||
| 147 | /* Record that a deletion is about to take place, | 147 | /* Record that a deletion is about to take place, |
| @@ -152,7 +152,7 @@ record_delete (EMACS_INT beg, Lisp_Object string) | |||
| 152 | { | 152 | { |
| 153 | Lisp_Object sbeg; | 153 | Lisp_Object sbeg; |
| 154 | 154 | ||
| 155 | if (EQ (current_buffer->undo_list, Qt)) | 155 | if (EQ (B_ (current_buffer, undo_list), Qt)) |
| 156 | return; | 156 | return; |
| 157 | 157 | ||
| 158 | if (PT == beg + SCHARS (string)) | 158 | if (PT == beg + SCHARS (string)) |
| @@ -166,8 +166,8 @@ record_delete (EMACS_INT beg, Lisp_Object string) | |||
| 166 | record_point (beg); | 166 | record_point (beg); |
| 167 | } | 167 | } |
| 168 | 168 | ||
| 169 | current_buffer->undo_list | 169 | B_ (current_buffer, undo_list) |
| 170 | = Fcons (Fcons (string, sbeg), current_buffer->undo_list); | 170 | = Fcons (Fcons (string, sbeg), B_ (current_buffer, undo_list)); |
| 171 | } | 171 | } |
| 172 | 172 | ||
| 173 | /* Record the fact that MARKER is about to be adjusted by ADJUSTMENT. | 173 | /* Record the fact that MARKER is about to be adjusted by ADJUSTMENT. |
| @@ -178,7 +178,7 @@ record_delete (EMACS_INT beg, Lisp_Object string) | |||
| 178 | void | 178 | void |
| 179 | record_marker_adjustment (Lisp_Object marker, EMACS_INT adjustment) | 179 | record_marker_adjustment (Lisp_Object marker, EMACS_INT adjustment) |
| 180 | { | 180 | { |
| 181 | if (EQ (current_buffer->undo_list, Qt)) | 181 | if (EQ (B_ (current_buffer, undo_list), Qt)) |
| 182 | return; | 182 | return; |
| 183 | 183 | ||
| 184 | /* Allocate a cons cell to be the undo boundary after this command. */ | 184 | /* Allocate a cons cell to be the undo boundary after this command. */ |
| @@ -189,9 +189,9 @@ record_marker_adjustment (Lisp_Object marker, EMACS_INT adjustment) | |||
| 189 | Fundo_boundary (); | 189 | Fundo_boundary (); |
| 190 | last_undo_buffer = current_buffer; | 190 | last_undo_buffer = current_buffer; |
| 191 | 191 | ||
| 192 | current_buffer->undo_list | 192 | B_ (current_buffer, undo_list) |
| 193 | = Fcons (Fcons (marker, make_number (adjustment)), | 193 | = Fcons (Fcons (marker, make_number (adjustment)), |
| 194 | current_buffer->undo_list); | 194 | B_ (current_buffer, undo_list)); |
| 195 | } | 195 | } |
| 196 | 196 | ||
| 197 | /* Record that a replacement is about to take place, | 197 | /* Record that a replacement is about to take place, |
| @@ -215,7 +215,7 @@ record_first_change (void) | |||
| 215 | Lisp_Object high, low; | 215 | Lisp_Object high, low; |
| 216 | struct buffer *base_buffer = current_buffer; | 216 | struct buffer *base_buffer = current_buffer; |
| 217 | 217 | ||
| 218 | if (EQ (current_buffer->undo_list, Qt)) | 218 | if (EQ (B_ (current_buffer, undo_list), Qt)) |
| 219 | return; | 219 | return; |
| 220 | 220 | ||
| 221 | if (current_buffer != last_undo_buffer) | 221 | if (current_buffer != last_undo_buffer) |
| @@ -227,7 +227,7 @@ record_first_change (void) | |||
| 227 | 227 | ||
| 228 | XSETFASTINT (high, (base_buffer->modtime >> 16) & 0xffff); | 228 | XSETFASTINT (high, (base_buffer->modtime >> 16) & 0xffff); |
| 229 | XSETFASTINT (low, base_buffer->modtime & 0xffff); | 229 | XSETFASTINT (low, base_buffer->modtime & 0xffff); |
| 230 | current_buffer->undo_list = Fcons (Fcons (Qt, Fcons (high, low)), current_buffer->undo_list); | 230 | B_ (current_buffer, undo_list) = Fcons (Fcons (Qt, Fcons (high, low)), B_ (current_buffer, undo_list)); |
| 231 | } | 231 | } |
| 232 | 232 | ||
| 233 | /* Record a change in property PROP (whose old value was VAL) | 233 | /* Record a change in property PROP (whose old value was VAL) |
| @@ -242,7 +242,7 @@ record_property_change (EMACS_INT beg, EMACS_INT length, | |||
| 242 | struct buffer *obuf = current_buffer, *buf = XBUFFER (buffer); | 242 | struct buffer *obuf = current_buffer, *buf = XBUFFER (buffer); |
| 243 | int boundary = 0; | 243 | int boundary = 0; |
| 244 | 244 | ||
| 245 | if (EQ (buf->undo_list, Qt)) | 245 | if (EQ (B_ (buf, undo_list), Qt)) |
| 246 | return; | 246 | return; |
| 247 | 247 | ||
| 248 | /* Allocate a cons cell to be the undo boundary after this command. */ | 248 | /* Allocate a cons cell to be the undo boundary after this command. */ |
| @@ -265,7 +265,7 @@ record_property_change (EMACS_INT beg, EMACS_INT length, | |||
| 265 | XSETINT (lbeg, beg); | 265 | XSETINT (lbeg, beg); |
| 266 | XSETINT (lend, beg + length); | 266 | XSETINT (lend, beg + length); |
| 267 | entry = Fcons (Qnil, Fcons (prop, Fcons (value, Fcons (lbeg, lend)))); | 267 | entry = Fcons (Qnil, Fcons (prop, Fcons (value, Fcons (lbeg, lend)))); |
| 268 | current_buffer->undo_list = Fcons (entry, current_buffer->undo_list); | 268 | B_ (current_buffer, undo_list) = Fcons (entry, B_ (current_buffer, undo_list)); |
| 269 | 269 | ||
| 270 | current_buffer = obuf; | 270 | current_buffer = obuf; |
| 271 | } | 271 | } |
| @@ -277,9 +277,9 @@ but another undo command will undo to the previous boundary. */) | |||
| 277 | (void) | 277 | (void) |
| 278 | { | 278 | { |
| 279 | Lisp_Object tem; | 279 | Lisp_Object tem; |
| 280 | if (EQ (current_buffer->undo_list, Qt)) | 280 | if (EQ (B_ (current_buffer, undo_list), Qt)) |
| 281 | return Qnil; | 281 | return Qnil; |
| 282 | tem = Fcar (current_buffer->undo_list); | 282 | tem = Fcar (B_ (current_buffer, undo_list)); |
| 283 | if (!NILP (tem)) | 283 | if (!NILP (tem)) |
| 284 | { | 284 | { |
| 285 | /* One way or another, cons nil onto the front of the undo list. */ | 285 | /* One way or another, cons nil onto the front of the undo list. */ |
| @@ -287,12 +287,12 @@ but another undo command will undo to the previous boundary. */) | |||
| 287 | { | 287 | { |
| 288 | /* If we have preallocated the cons cell to use here, | 288 | /* If we have preallocated the cons cell to use here, |
| 289 | use that one. */ | 289 | use that one. */ |
| 290 | XSETCDR (pending_boundary, current_buffer->undo_list); | 290 | XSETCDR (pending_boundary, B_ (current_buffer, undo_list)); |
| 291 | current_buffer->undo_list = pending_boundary; | 291 | B_ (current_buffer, undo_list) = pending_boundary; |
| 292 | pending_boundary = Qnil; | 292 | pending_boundary = Qnil; |
| 293 | } | 293 | } |
| 294 | else | 294 | else |
| 295 | current_buffer->undo_list = Fcons (Qnil, current_buffer->undo_list); | 295 | B_ (current_buffer, undo_list) = Fcons (Qnil, B_ (current_buffer, undo_list)); |
| 296 | } | 296 | } |
| 297 | last_boundary_position = PT; | 297 | last_boundary_position = PT; |
| 298 | last_boundary_buffer = current_buffer; | 298 | last_boundary_buffer = current_buffer; |
| @@ -321,7 +321,7 @@ truncate_undo_list (struct buffer *b) | |||
| 321 | record_unwind_protect (set_buffer_if_live, Fcurrent_buffer ()); | 321 | record_unwind_protect (set_buffer_if_live, Fcurrent_buffer ()); |
| 322 | set_buffer_internal (b); | 322 | set_buffer_internal (b); |
| 323 | 323 | ||
| 324 | list = b->undo_list; | 324 | list = B_ (b, undo_list); |
| 325 | 325 | ||
| 326 | prev = Qnil; | 326 | prev = Qnil; |
| 327 | next = list; | 327 | next = list; |
| @@ -433,7 +433,7 @@ truncate_undo_list (struct buffer *b) | |||
| 433 | XSETCDR (last_boundary, Qnil); | 433 | XSETCDR (last_boundary, Qnil); |
| 434 | /* There's nothing we decided to keep, so clear it out. */ | 434 | /* There's nothing we decided to keep, so clear it out. */ |
| 435 | else | 435 | else |
| 436 | b->undo_list = Qnil; | 436 | B_ (b, undo_list) = Qnil; |
| 437 | 437 | ||
| 438 | unbind_to (count, Qnil); | 438 | unbind_to (count, Qnil); |
| 439 | } | 439 | } |
| @@ -470,13 +470,13 @@ Return what remains of the list. */) | |||
| 470 | 470 | ||
| 471 | /* In a writable buffer, enable undoing read-only text that is so | 471 | /* In a writable buffer, enable undoing read-only text that is so |
| 472 | because of text properties. */ | 472 | because of text properties. */ |
| 473 | if (NILP (current_buffer->read_only)) | 473 | if (NILP (B_ (current_buffer, read_only))) |
| 474 | specbind (Qinhibit_read_only, Qt); | 474 | specbind (Qinhibit_read_only, Qt); |
| 475 | 475 | ||
| 476 | /* Don't let `intangible' properties interfere with undo. */ | 476 | /* Don't let `intangible' properties interfere with undo. */ |
| 477 | specbind (Qinhibit_point_motion_hooks, Qt); | 477 | specbind (Qinhibit_point_motion_hooks, Qt); |
| 478 | 478 | ||
| 479 | oldlist = current_buffer->undo_list; | 479 | oldlist = B_ (current_buffer, undo_list); |
| 480 | 480 | ||
| 481 | while (arg > 0) | 481 | while (arg > 0) |
| 482 | { | 482 | { |
| @@ -631,9 +631,9 @@ Return what remains of the list. */) | |||
| 631 | so the test in `undo' for continuing an undo series | 631 | so the test in `undo' for continuing an undo series |
| 632 | will work right. */ | 632 | will work right. */ |
| 633 | if (did_apply | 633 | if (did_apply |
| 634 | && EQ (oldlist, current_buffer->undo_list)) | 634 | && EQ (oldlist, B_ (current_buffer, undo_list))) |
| 635 | current_buffer->undo_list | 635 | B_ (current_buffer, undo_list) |
| 636 | = Fcons (list3 (Qapply, Qcdr, Qnil), current_buffer->undo_list); | 636 | = Fcons (list3 (Qapply, Qcdr, Qnil), B_ (current_buffer, undo_list)); |
| 637 | 637 | ||
| 638 | UNGCPRO; | 638 | UNGCPRO; |
| 639 | return unbind_to (count, list); | 639 | return unbind_to (count, list); |