diff options
| author | Joseph Arceneaux | 1992-10-02 22:33:18 +0000 |
|---|---|---|
| committer | Joseph Arceneaux | 1992-10-02 22:33:18 +0000 |
| commit | 249a6da95492d146cb1d97e9454198b2deb49e53 (patch) | |
| tree | 3ad1c4aa8568912a2ece7df52834b26d11b4ef8a /src | |
| parent | cde20f4168f268865b5eabb956f69a8291a7bdfa (diff) | |
| download | emacs-249a6da95492d146cb1d97e9454198b2deb49e53.tar.gz emacs-249a6da95492d146cb1d97e9454198b2deb49e53.zip | |
Fixed typos.
Diffstat (limited to 'src')
| -rw-r--r-- | src/intervals.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/src/intervals.c b/src/intervals.c index 20c304d48ba..f1fdd9ed2cc 100644 --- a/src/intervals.c +++ b/src/intervals.c | |||
| @@ -650,7 +650,7 @@ adjust_intervals_for_insertion (tree, position, length) | |||
| 650 | if (position == i->position | 650 | if (position == i->position |
| 651 | && position != 1) | 651 | && position != 1) |
| 652 | { | 652 | { |
| 653 | register prev = previous_interval (i); | 653 | register INTERVAL prev = previous_interval (i); |
| 654 | 654 | ||
| 655 | /* If both intervals are sticky here, then default to the | 655 | /* If both intervals are sticky here, then default to the |
| 656 | left-most one. But perhaps we should create a new | 656 | left-most one. But perhaps we should create a new |
| @@ -662,7 +662,7 @@ adjust_intervals_for_insertion (tree, position, length) | |||
| 662 | while (! NULL_INTERVAL_P (i)) | 662 | while (! NULL_INTERVAL_P (i)) |
| 663 | { | 663 | { |
| 664 | i->total_length += length; | 664 | i->total_length += length; |
| 665 | i = i->parent | 665 | i = i->parent; |
| 666 | } | 666 | } |
| 667 | 667 | ||
| 668 | return tree; | 668 | return tree; |
| @@ -1126,7 +1126,7 @@ graft_intervals_into_buffer (source, position, buffer) | |||
| 1126 | { | 1126 | { |
| 1127 | /* The inserted text constitutes the whole buffer, so | 1127 | /* The inserted text constitutes the whole buffer, so |
| 1128 | simply copy over the interval structure. */ | 1128 | simply copy over the interval structure. */ |
| 1129 | if (BUF_Z (b) == TOTAL_LENGTH (source)) | 1129 | if (BUF_Z (buffer) == TOTAL_LENGTH (source)) |
| 1130 | { | 1130 | { |
| 1131 | buffer->intervals = reproduce_tree (source, tree->parent); | 1131 | buffer->intervals = reproduce_tree (source, tree->parent); |
| 1132 | /* Explicitly free the old tree here. */ | 1132 | /* Explicitly free the old tree here. */ |
| @@ -1137,8 +1137,8 @@ graft_intervals_into_buffer (source, position, buffer) | |||
| 1137 | /* Create an interval tree in which to place a copy | 1137 | /* Create an interval tree in which to place a copy |
| 1138 | of the intervals of the inserted string. */ | 1138 | of the intervals of the inserted string. */ |
| 1139 | { | 1139 | { |
| 1140 | Lisp_Object buffer; | 1140 | Lisp_Object buf; |
| 1141 | XSET (buffer, Lisp_Buffer, b); | 1141 | XSET (buf, Lisp_Buffer, buffer); |
| 1142 | create_root_interval (buffer); | 1142 | create_root_interval (buffer); |
| 1143 | } | 1143 | } |
| 1144 | } | 1144 | } |
| @@ -1393,7 +1393,7 @@ verify_interval_modification (buf, start, end) | |||
| 1393 | { | 1393 | { |
| 1394 | register INTERVAL intervals = buf->intervals; | 1394 | register INTERVAL intervals = buf->intervals; |
| 1395 | register INTERVAL i; | 1395 | register INTERVAL i; |
| 1396 | register Lisp_Object hooks = Qnil; | 1396 | Lisp_Object hooks = Qnil; |
| 1397 | register prev_mod_hook = Qnil; | 1397 | register prev_mod_hook = Qnil; |
| 1398 | register Lisp_Object mod_hook; | 1398 | register Lisp_Object mod_hook; |
| 1399 | struct gcpro gcpro1; | 1399 | struct gcpro gcpro1; |