diff options
| author | Paul Eggert | 2015-04-19 13:13:13 -0700 |
|---|---|---|
| committer | Paul Eggert | 2015-04-19 13:13:52 -0700 |
| commit | 62e170072e6000b30c37792227dc34e71a31d797 (patch) | |
| tree | 6a97f0018e883b3daa0ca6d0f1f8f1d29ad89d17 /src | |
| parent | b5b0e0500eb6fac1b0b2e9ca4da08826225b010b (diff) | |
| download | emacs-62e170072e6000b30c37792227dc34e71a31d797.tar.gz emacs-62e170072e6000b30c37792227dc34e71a31d797.zip | |
Use bool for boolean in textprop.c, undo.c
* src/textprop.c (soft, hard): Now constants instead of macros.
(validate_plist): Rewrite to avoid need for boolean local.
(interval_has_all_properties, interval_has_some_properties)
(interval_has_some_properties_list, add_properties)
(remove_properties, get_char_property_and_overlay)
(Fnext_single_char_property_change)
(Fprevious_single_char_property_change, add_text_properties_1)
(Fremove_text_properties, Fremove_list_of_text_properties)
(copy_text_properties):
* src/tparam.c (tparam1):
* src/undo.c (record_change, record_property_change)
(syms_of_undo):
Use 'true' and 'false' for booleans.
Diffstat (limited to 'src')
| -rw-r--r-- | src/textprop.c | 111 | ||||
| -rw-r--r-- | src/tparam.c | 8 | ||||
| -rw-r--r-- | src/undo.c | 8 |
3 files changed, 61 insertions, 66 deletions
diff --git a/src/textprop.c b/src/textprop.c index 740b96227cf..108c226a432 100644 --- a/src/textprop.c +++ b/src/textprop.c | |||
| @@ -52,8 +52,8 @@ enum property_set_type | |||
| 52 | TEXT_PROPERTY_APPEND | 52 | TEXT_PROPERTY_APPEND |
| 53 | }; | 53 | }; |
| 54 | 54 | ||
| 55 | /* If o1 is a cons whose cdr is a cons, return non-zero and set o2 to | 55 | /* If o1 is a cons whose cdr is a cons, return true and set o2 to |
| 56 | the o1's cdr. Otherwise, return zero. This is handy for | 56 | the o1's cdr. Otherwise, return false. This is handy for |
| 57 | traversing plists. */ | 57 | traversing plists. */ |
| 58 | #define PLIST_ELT_P(o1, o2) (CONSP (o1) && ((o2)=XCDR (o1), CONSP (o2))) | 58 | #define PLIST_ELT_P(o1, o2) (CONSP (o1) && ((o2)=XCDR (o1), CONSP (o2))) |
| 59 | 59 | ||
| @@ -123,13 +123,12 @@ CHECK_STRING_OR_BUFFER (Lisp_Object x) | |||
| 123 | Fprevious_property_change which call this function with BEGIN == END. | 123 | Fprevious_property_change which call this function with BEGIN == END. |
| 124 | Handle this case specially. | 124 | Handle this case specially. |
| 125 | 125 | ||
| 126 | If FORCE is soft (0), it's OK to return NULL. Otherwise, | 126 | If FORCE is soft (false), it's OK to return NULL. Otherwise, |
| 127 | create an interval tree for OBJECT if one doesn't exist, provided | 127 | create an interval tree for OBJECT if one doesn't exist, provided |
| 128 | the object actually contains text. In the current design, if there | 128 | the object actually contains text. In the current design, if there |
| 129 | is no text, there can be no text properties. */ | 129 | is no text, there can be no text properties. */ |
| 130 | 130 | ||
| 131 | #define soft 0 | 131 | enum { soft = false, hard = true }; |
| 132 | #define hard 1 | ||
| 133 | 132 | ||
| 134 | INTERVAL | 133 | INTERVAL |
| 135 | validate_interval_range (Lisp_Object object, Lisp_Object *begin, | 134 | validate_interval_range (Lisp_Object object, Lisp_Object *begin, |
| @@ -206,15 +205,17 @@ validate_plist (Lisp_Object list) | |||
| 206 | 205 | ||
| 207 | if (CONSP (list)) | 206 | if (CONSP (list)) |
| 208 | { | 207 | { |
| 209 | bool odd_length = 0; | 208 | Lisp_Object tail = list; |
| 210 | Lisp_Object tail; | 209 | do |
| 211 | for (tail = list; CONSP (tail); tail = XCDR (tail)) | ||
| 212 | { | 210 | { |
| 213 | odd_length ^= 1; | 211 | tail = XCDR (tail); |
| 212 | if (! CONSP (tail)) | ||
| 213 | error ("Odd length text property list"); | ||
| 214 | tail = XCDR (tail); | ||
| 214 | QUIT; | 215 | QUIT; |
| 215 | } | 216 | } |
| 216 | if (odd_length) | 217 | while (CONSP (tail)); |
| 217 | error ("Odd length text property list"); | 218 | |
| 218 | return list; | 219 | return list; |
| 219 | } | 220 | } |
| 220 | 221 | ||
| @@ -233,27 +234,27 @@ interval_has_all_properties (Lisp_Object plist, INTERVAL i) | |||
| 233 | for (tail1 = plist; CONSP (tail1); tail1 = Fcdr (XCDR (tail1))) | 234 | for (tail1 = plist; CONSP (tail1); tail1 = Fcdr (XCDR (tail1))) |
| 234 | { | 235 | { |
| 235 | Lisp_Object sym1 = XCAR (tail1); | 236 | Lisp_Object sym1 = XCAR (tail1); |
| 236 | bool found = 0; | 237 | bool found = false; |
| 237 | 238 | ||
| 238 | /* Go through I's plist, looking for sym1 */ | 239 | /* Go through I's plist, looking for sym1 */ |
| 239 | for (tail2 = i->plist; CONSP (tail2); tail2 = Fcdr (XCDR (tail2))) | 240 | for (tail2 = i->plist; CONSP (tail2); tail2 = Fcdr (XCDR (tail2))) |
| 240 | if (EQ (sym1, XCAR (tail2))) | 241 | if (EQ (sym1, XCAR (tail2))) |
| 241 | { | 242 | { |
| 242 | /* Found the same property on both lists. If the | 243 | /* Found the same property on both lists. If the |
| 243 | values are unequal, return zero. */ | 244 | values are unequal, return false. */ |
| 244 | if (! EQ (Fcar (XCDR (tail1)), Fcar (XCDR (tail2)))) | 245 | if (! EQ (Fcar (XCDR (tail1)), Fcar (XCDR (tail2)))) |
| 245 | return 0; | 246 | return false; |
| 246 | 247 | ||
| 247 | /* Property has same value on both lists; go to next one. */ | 248 | /* Property has same value on both lists; go to next one. */ |
| 248 | found = 1; | 249 | found = true; |
| 249 | break; | 250 | break; |
| 250 | } | 251 | } |
| 251 | 252 | ||
| 252 | if (! found) | 253 | if (! found) |
| 253 | return 0; | 254 | return false; |
| 254 | } | 255 | } |
| 255 | 256 | ||
| 256 | return 1; | 257 | return true; |
| 257 | } | 258 | } |
| 258 | 259 | ||
| 259 | /* Return true if the plist of interval I has any of the | 260 | /* Return true if the plist of interval I has any of the |
| @@ -272,13 +273,13 @@ interval_has_some_properties (Lisp_Object plist, INTERVAL i) | |||
| 272 | /* Go through i's plist, looking for tail1 */ | 273 | /* Go through i's plist, looking for tail1 */ |
| 273 | for (tail2 = i->plist; CONSP (tail2); tail2 = Fcdr (XCDR (tail2))) | 274 | for (tail2 = i->plist; CONSP (tail2); tail2 = Fcdr (XCDR (tail2))) |
| 274 | if (EQ (sym, XCAR (tail2))) | 275 | if (EQ (sym, XCAR (tail2))) |
| 275 | return 1; | 276 | return true; |
| 276 | } | 277 | } |
| 277 | 278 | ||
| 278 | return 0; | 279 | return false; |
| 279 | } | 280 | } |
| 280 | 281 | ||
| 281 | /* Return nonzero if the plist of interval I has any of the | 282 | /* Return true if the plist of interval I has any of the |
| 282 | property names in LIST, regardless of their values. */ | 283 | property names in LIST, regardless of their values. */ |
| 283 | 284 | ||
| 284 | static bool | 285 | static bool |
| @@ -294,10 +295,10 @@ interval_has_some_properties_list (Lisp_Object list, INTERVAL i) | |||
| 294 | /* Go through i's plist, looking for tail1 */ | 295 | /* Go through i's plist, looking for tail1 */ |
| 295 | for (tail2 = i->plist; CONSP (tail2); tail2 = XCDR (XCDR (tail2))) | 296 | for (tail2 = i->plist; CONSP (tail2); tail2 = XCDR (XCDR (tail2))) |
| 296 | if (EQ (sym, XCAR (tail2))) | 297 | if (EQ (sym, XCAR (tail2))) |
| 297 | return 1; | 298 | return true; |
| 298 | } | 299 | } |
| 299 | 300 | ||
| 300 | return 0; | 301 | return false; |
| 301 | } | 302 | } |
| 302 | 303 | ||
| 303 | /* Changing the plists of individual intervals. */ | 304 | /* Changing the plists of individual intervals. */ |
| @@ -373,7 +374,7 @@ add_properties (Lisp_Object plist, INTERVAL i, Lisp_Object object, | |||
| 373 | enum property_set_type set_type) | 374 | enum property_set_type set_type) |
| 374 | { | 375 | { |
| 375 | Lisp_Object tail1, tail2, sym1, val1; | 376 | Lisp_Object tail1, tail2, sym1, val1; |
| 376 | bool changed = 0; | 377 | bool changed = false; |
| 377 | struct gcpro gcpro1, gcpro2, gcpro3; | 378 | struct gcpro gcpro1, gcpro2, gcpro3; |
| 378 | 379 | ||
| 379 | tail1 = plist; | 380 | tail1 = plist; |
| @@ -387,7 +388,7 @@ add_properties (Lisp_Object plist, INTERVAL i, Lisp_Object object, | |||
| 387 | /* Go through each element of PLIST. */ | 388 | /* Go through each element of PLIST. */ |
| 388 | for (tail1 = plist; CONSP (tail1); tail1 = Fcdr (XCDR (tail1))) | 389 | for (tail1 = plist; CONSP (tail1); tail1 = Fcdr (XCDR (tail1))) |
| 389 | { | 390 | { |
| 390 | bool found = 0; | 391 | bool found = false; |
| 391 | sym1 = XCAR (tail1); | 392 | sym1 = XCAR (tail1); |
| 392 | val1 = Fcar (XCDR (tail1)); | 393 | val1 = Fcar (XCDR (tail1)); |
| 393 | 394 | ||
| @@ -401,7 +402,7 @@ add_properties (Lisp_Object plist, INTERVAL i, Lisp_Object object, | |||
| 401 | 402 | ||
| 402 | this_cdr = XCDR (tail2); | 403 | this_cdr = XCDR (tail2); |
| 403 | /* Found the property. Now check its value. */ | 404 | /* Found the property. Now check its value. */ |
| 404 | found = 1; | 405 | found = true; |
| 405 | 406 | ||
| 406 | /* The properties have the same value on both lists. | 407 | /* The properties have the same value on both lists. |
| 407 | Continue to the next property. */ | 408 | Continue to the next property. */ |
| @@ -438,7 +439,7 @@ add_properties (Lisp_Object plist, INTERVAL i, Lisp_Object object, | |||
| 438 | Fsetcar (this_cdr, list2 (Fcar (this_cdr), val1)); | 439 | Fsetcar (this_cdr, list2 (Fcar (this_cdr), val1)); |
| 439 | } | 440 | } |
| 440 | } | 441 | } |
| 441 | changed = 1; | 442 | changed = true; |
| 442 | break; | 443 | break; |
| 443 | } | 444 | } |
| 444 | 445 | ||
| @@ -451,7 +452,7 @@ add_properties (Lisp_Object plist, INTERVAL i, Lisp_Object object, | |||
| 451 | sym1, Qnil, object); | 452 | sym1, Qnil, object); |
| 452 | } | 453 | } |
| 453 | set_interval_plist (i, Fcons (sym1, Fcons (val1, i->plist))); | 454 | set_interval_plist (i, Fcons (sym1, Fcons (val1, i->plist))); |
| 454 | changed = 1; | 455 | changed = true; |
| 455 | } | 456 | } |
| 456 | } | 457 | } |
| 457 | 458 | ||
| @@ -468,23 +469,18 @@ add_properties (Lisp_Object plist, INTERVAL i, Lisp_Object object, | |||
| 468 | static bool | 469 | static bool |
| 469 | remove_properties (Lisp_Object plist, Lisp_Object list, INTERVAL i, Lisp_Object object) | 470 | remove_properties (Lisp_Object plist, Lisp_Object list, INTERVAL i, Lisp_Object object) |
| 470 | { | 471 | { |
| 471 | Lisp_Object tail1, tail2, sym, current_plist; | 472 | bool changed = false; |
| 472 | bool changed = 0; | ||
| 473 | 473 | ||
| 474 | /* True means tail1 is a plist, otherwise it is a list. */ | 474 | /* True means tail1 is a plist, otherwise it is a list. */ |
| 475 | bool use_plist; | 475 | bool use_plist = ! NILP (plist); |
| 476 | Lisp_Object tail1 = use_plist ? plist : list; | ||
| 476 | 477 | ||
| 477 | current_plist = i->plist; | 478 | Lisp_Object current_plist = i->plist; |
| 478 | |||
| 479 | if (! NILP (plist)) | ||
| 480 | tail1 = plist, use_plist = 1; | ||
| 481 | else | ||
| 482 | tail1 = list, use_plist = 0; | ||
| 483 | 479 | ||
| 484 | /* Go through each element of LIST or PLIST. */ | 480 | /* Go through each element of LIST or PLIST. */ |
| 485 | while (CONSP (tail1)) | 481 | while (CONSP (tail1)) |
| 486 | { | 482 | { |
| 487 | sym = XCAR (tail1); | 483 | Lisp_Object sym = XCAR (tail1); |
| 488 | 484 | ||
| 489 | /* First, remove the symbol if it's at the head of the list */ | 485 | /* First, remove the symbol if it's at the head of the list */ |
| 490 | while (CONSP (current_plist) && EQ (sym, XCAR (current_plist))) | 486 | while (CONSP (current_plist) && EQ (sym, XCAR (current_plist))) |
| @@ -495,15 +491,14 @@ remove_properties (Lisp_Object plist, Lisp_Object list, INTERVAL i, Lisp_Object | |||
| 495 | object); | 491 | object); |
| 496 | 492 | ||
| 497 | current_plist = XCDR (XCDR (current_plist)); | 493 | current_plist = XCDR (XCDR (current_plist)); |
| 498 | changed = 1; | 494 | changed = true; |
| 499 | } | 495 | } |
| 500 | 496 | ||
| 501 | /* Go through I's plist, looking for SYM. */ | 497 | /* Go through I's plist, looking for SYM. */ |
| 502 | tail2 = current_plist; | 498 | Lisp_Object tail2 = current_plist; |
| 503 | while (! NILP (tail2)) | 499 | while (! NILP (tail2)) |
| 504 | { | 500 | { |
| 505 | register Lisp_Object this; | 501 | Lisp_Object this = XCDR (XCDR (tail2)); |
| 506 | this = XCDR (XCDR (tail2)); | ||
| 507 | if (CONSP (this) && EQ (sym, XCAR (this))) | 502 | if (CONSP (this) && EQ (sym, XCAR (this))) |
| 508 | { | 503 | { |
| 509 | if (BUFFERP (object)) | 504 | if (BUFFERP (object)) |
| @@ -511,7 +506,7 @@ remove_properties (Lisp_Object plist, Lisp_Object list, INTERVAL i, Lisp_Object | |||
| 511 | sym, XCAR (XCDR (this)), object); | 506 | sym, XCAR (XCDR (this)), object); |
| 512 | 507 | ||
| 513 | Fsetcdr (XCDR (tail2), XCDR (XCDR (this))); | 508 | Fsetcdr (XCDR (tail2), XCDR (XCDR (this))); |
| 514 | changed = 1; | 509 | changed = true; |
| 515 | } | 510 | } |
| 516 | tail2 = this; | 511 | tail2 = this; |
| 517 | } | 512 | } |
| @@ -643,7 +638,7 @@ get_char_property_and_overlay (Lisp_Object position, register Lisp_Object prop, | |||
| 643 | set_buffer_temp (XBUFFER (object)); | 638 | set_buffer_temp (XBUFFER (object)); |
| 644 | 639 | ||
| 645 | USE_SAFE_ALLOCA; | 640 | USE_SAFE_ALLOCA; |
| 646 | GET_OVERLAYS_AT (XINT (position), overlay_vec, noverlays, NULL, 0); | 641 | GET_OVERLAYS_AT (XINT (position), overlay_vec, noverlays, NULL, false); |
| 647 | noverlays = sort_overlays (overlay_vec, noverlays, w); | 642 | noverlays = sort_overlays (overlay_vec, noverlays, w); |
| 648 | 643 | ||
| 649 | set_buffer_temp (obuf); | 644 | set_buffer_temp (obuf); |
| @@ -824,7 +819,7 @@ past position LIMIT; return LIMIT if nothing is found before LIMIT. */) | |||
| 824 | XSETFASTINT (position, ZV); | 819 | XSETFASTINT (position, ZV); |
| 825 | } | 820 | } |
| 826 | else | 821 | else |
| 827 | while (1) | 822 | while (true) |
| 828 | { | 823 | { |
| 829 | position = Fnext_char_property_change (position, limit); | 824 | position = Fnext_char_property_change (position, limit); |
| 830 | if (XFASTINT (position) >= XFASTINT (limit)) | 825 | if (XFASTINT (position) >= XFASTINT (limit)) |
| @@ -910,7 +905,7 @@ position LIMIT; return LIMIT if nothing is found before reaching LIMIT. */) | |||
| 910 | = Fget_char_property (make_number (XFASTINT (position) - 1), | 905 | = Fget_char_property (make_number (XFASTINT (position) - 1), |
| 911 | prop, object); | 906 | prop, object); |
| 912 | 907 | ||
| 913 | while (1) | 908 | while (true) |
| 914 | { | 909 | { |
| 915 | position = Fprevious_char_property_change (position, limit); | 910 | position = Fprevious_char_property_change (position, limit); |
| 916 | 911 | ||
| @@ -1156,9 +1151,9 @@ add_text_properties_1 (Lisp_Object start, Lisp_Object end, | |||
| 1156 | enum property_set_type set_type) { | 1151 | enum property_set_type set_type) { |
| 1157 | INTERVAL i, unchanged; | 1152 | INTERVAL i, unchanged; |
| 1158 | ptrdiff_t s, len; | 1153 | ptrdiff_t s, len; |
| 1159 | bool modified = 0; | 1154 | bool modified = false; |
| 1160 | struct gcpro gcpro1; | 1155 | struct gcpro gcpro1; |
| 1161 | bool first_time = 1; | 1156 | bool first_time = true; |
| 1162 | 1157 | ||
| 1163 | properties = validate_plist (properties); | 1158 | properties = validate_plist (properties); |
| 1164 | if (NILP (properties)) | 1159 | if (NILP (properties)) |
| @@ -1218,7 +1213,7 @@ add_text_properties_1 (Lisp_Object start, Lisp_Object end, | |||
| 1218 | if (TOTAL_LENGTH (i) != prev_total_length | 1213 | if (TOTAL_LENGTH (i) != prev_total_length |
| 1219 | || i->position != prev_pos) | 1214 | || i->position != prev_pos) |
| 1220 | { | 1215 | { |
| 1221 | first_time = 0; | 1216 | first_time = false; |
| 1222 | goto retry; | 1217 | goto retry; |
| 1223 | } | 1218 | } |
| 1224 | } | 1219 | } |
| @@ -1521,8 +1516,8 @@ Use `set-text-properties' if you want to remove all text properties. */) | |||
| 1521 | { | 1516 | { |
| 1522 | INTERVAL i, unchanged; | 1517 | INTERVAL i, unchanged; |
| 1523 | ptrdiff_t s, len; | 1518 | ptrdiff_t s, len; |
| 1524 | bool modified = 0; | 1519 | bool modified = false; |
| 1525 | bool first_time = 1; | 1520 | bool first_time = true; |
| 1526 | 1521 | ||
| 1527 | if (NILP (object)) | 1522 | if (NILP (object)) |
| 1528 | XSETBUFFER (object, current_buffer); | 1523 | XSETBUFFER (object, current_buffer); |
| @@ -1574,7 +1569,7 @@ Use `set-text-properties' if you want to remove all text properties. */) | |||
| 1574 | if (TOTAL_LENGTH (i) != prev_total_length | 1569 | if (TOTAL_LENGTH (i) != prev_total_length |
| 1575 | || i->position != prev_pos) | 1570 | || i->position != prev_pos) |
| 1576 | { | 1571 | { |
| 1577 | first_time = 0; | 1572 | first_time = false; |
| 1578 | goto retry; | 1573 | goto retry; |
| 1579 | } | 1574 | } |
| 1580 | } | 1575 | } |
| @@ -1633,7 +1628,7 @@ Return t if any property was actually removed, nil otherwise. */) | |||
| 1633 | { | 1628 | { |
| 1634 | INTERVAL i, unchanged; | 1629 | INTERVAL i, unchanged; |
| 1635 | ptrdiff_t s, len; | 1630 | ptrdiff_t s, len; |
| 1636 | bool modified = 0; | 1631 | bool modified = false; |
| 1637 | Lisp_Object properties; | 1632 | Lisp_Object properties; |
| 1638 | properties = list_of_properties; | 1633 | properties = list_of_properties; |
| 1639 | 1634 | ||
| @@ -1672,11 +1667,11 @@ Return t if any property was actually removed, nil otherwise. */) | |||
| 1672 | } | 1667 | } |
| 1673 | 1668 | ||
| 1674 | /* We are at the beginning of an interval, with len to scan. | 1669 | /* We are at the beginning of an interval, with len to scan. |
| 1675 | The flag `modified' records if changes have been made. | 1670 | The flag MODIFIED records if changes have been made. |
| 1676 | When object is a buffer, we must call modify_text_properties | 1671 | When object is a buffer, we must call modify_text_properties |
| 1677 | before changes are made and signal_after_change when we are done. | 1672 | before changes are made and signal_after_change when we are done. |
| 1678 | We call modify_text_properties before calling remove_properties if modified == 0, | 1673 | Call modify_text_properties before calling remove_properties if !MODIFIED, |
| 1679 | and we call signal_after_change before returning if modified != 0. */ | 1674 | and call signal_after_change before returning if MODIFIED. */ |
| 1680 | for (;;) | 1675 | for (;;) |
| 1681 | { | 1676 | { |
| 1682 | eassert (i != 0); | 1677 | eassert (i != 0); |
| @@ -1725,7 +1720,7 @@ Return t if any property was actually removed, nil otherwise. */) | |||
| 1725 | if (!modified && BUFFERP (object)) | 1720 | if (!modified && BUFFERP (object)) |
| 1726 | modify_text_properties (object, start, end); | 1721 | modify_text_properties (object, start, end); |
| 1727 | remove_properties (Qnil, properties, i, object); | 1722 | remove_properties (Qnil, properties, i, object); |
| 1728 | modified = 1; | 1723 | modified = true; |
| 1729 | } | 1724 | } |
| 1730 | len -= LENGTH (i); | 1725 | len -= LENGTH (i); |
| 1731 | i = next_interval (i); | 1726 | i = next_interval (i); |
| @@ -1902,7 +1897,7 @@ copy_text_properties (Lisp_Object start, Lisp_Object end, Lisp_Object src, | |||
| 1902 | Lisp_Object stuff; | 1897 | Lisp_Object stuff; |
| 1903 | Lisp_Object plist; | 1898 | Lisp_Object plist; |
| 1904 | ptrdiff_t s, e, e2, p, len; | 1899 | ptrdiff_t s, e, e2, p, len; |
| 1905 | bool modified = 0; | 1900 | bool modified = false; |
| 1906 | struct gcpro gcpro1, gcpro2; | 1901 | struct gcpro gcpro1, gcpro2; |
| 1907 | 1902 | ||
| 1908 | i = validate_interval_range (src, &start, &end, soft); | 1903 | i = validate_interval_range (src, &start, &end, soft); |
| @@ -1969,7 +1964,7 @@ copy_text_properties (Lisp_Object start, Lisp_Object end, Lisp_Object src, | |||
| 1969 | res = Fadd_text_properties (Fcar (res), Fcar (Fcdr (res)), | 1964 | res = Fadd_text_properties (Fcar (res), Fcar (Fcdr (res)), |
| 1970 | Fcar (Fcdr (Fcdr (res))), dest); | 1965 | Fcar (Fcdr (Fcdr (res))), dest); |
| 1971 | if (! NILP (res)) | 1966 | if (! NILP (res)) |
| 1972 | modified = 1; | 1967 | modified = true; |
| 1973 | stuff = Fcdr (stuff); | 1968 | stuff = Fcdr (stuff); |
| 1974 | } | 1969 | } |
| 1975 | 1970 | ||
diff --git a/src/tparam.c b/src/tparam.c index 538f26c83b6..02047db2095 100644 --- a/src/tparam.c +++ b/src/tparam.c | |||
| @@ -79,14 +79,14 @@ tparam1 (const char *string, char *outstring, int len, | |||
| 79 | register int tem; | 79 | register int tem; |
| 80 | int *old_argp = argp; /* can move */ | 80 | int *old_argp = argp; /* can move */ |
| 81 | int *fixed_argp = argp; /* never moves */ | 81 | int *fixed_argp = argp; /* never moves */ |
| 82 | bool explicit_param_p = 0; /* set by %p */ | 82 | bool explicit_param_p = false; /* set by %p */ |
| 83 | ptrdiff_t doleft = 0; | 83 | ptrdiff_t doleft = 0; |
| 84 | ptrdiff_t doup = 0; | 84 | ptrdiff_t doup = 0; |
| 85 | ptrdiff_t append_len = 0; | 85 | ptrdiff_t append_len = 0; |
| 86 | 86 | ||
| 87 | outend = outstring + len; | 87 | outend = outstring + len; |
| 88 | 88 | ||
| 89 | while (1) | 89 | while (true) |
| 90 | { | 90 | { |
| 91 | /* If the buffer might be too short, make it bigger. */ | 91 | /* If the buffer might be too short, make it bigger. */ |
| 92 | while (outend - op - append_len <= 5) | 92 | while (outend - op - append_len <= 5) |
| @@ -115,7 +115,7 @@ tparam1 (const char *string, char *outstring, int len, | |||
| 115 | { | 115 | { |
| 116 | c = *p++; | 116 | c = *p++; |
| 117 | if (explicit_param_p) | 117 | if (explicit_param_p) |
| 118 | explicit_param_p = 0; | 118 | explicit_param_p = false; |
| 119 | else | 119 | else |
| 120 | tem = *argp; | 120 | tem = *argp; |
| 121 | switch (c) | 121 | switch (c) |
| @@ -142,7 +142,7 @@ tparam1 (const char *string, char *outstring, int len, | |||
| 142 | break; | 142 | break; |
| 143 | case 'p': /* %pN means use param N for next subst. */ | 143 | case 'p': /* %pN means use param N for next subst. */ |
| 144 | tem = fixed_argp[(*p++) - '1']; | 144 | tem = fixed_argp[(*p++) - '1']; |
| 145 | explicit_param_p = 1; | 145 | explicit_param_p = true; |
| 146 | break; | 146 | break; |
| 147 | case 'C': | 147 | case 'C': |
| 148 | /* For c-100: print quotient of value by 96, if nonzero, | 148 | /* For c-100: print quotient of value by 96, if nonzero, |
diff --git a/src/undo.c b/src/undo.c index 948dcf9ec1a..750bc8afff2 100644 --- a/src/undo.c +++ b/src/undo.c | |||
| @@ -212,7 +212,7 @@ record_delete (ptrdiff_t beg, Lisp_Object string, bool record_markers) | |||
| 212 | void | 212 | void |
| 213 | record_change (ptrdiff_t beg, ptrdiff_t length) | 213 | record_change (ptrdiff_t beg, ptrdiff_t length) |
| 214 | { | 214 | { |
| 215 | record_delete (beg, make_buffer_string (beg, beg + length, 1), false); | 215 | record_delete (beg, make_buffer_string (beg, beg + length, true), false); |
| 216 | record_insert (beg, length); | 216 | record_insert (beg, length); |
| 217 | } | 217 | } |
| 218 | 218 | ||
| @@ -250,7 +250,7 @@ record_property_change (ptrdiff_t beg, ptrdiff_t length, | |||
| 250 | { | 250 | { |
| 251 | Lisp_Object lbeg, lend, entry; | 251 | Lisp_Object lbeg, lend, entry; |
| 252 | struct buffer *obuf = current_buffer, *buf = XBUFFER (buffer); | 252 | struct buffer *obuf = current_buffer, *buf = XBUFFER (buffer); |
| 253 | bool boundary = 0; | 253 | bool boundary = false; |
| 254 | 254 | ||
| 255 | if (EQ (BVAR (buf, undo_list), Qt)) | 255 | if (EQ (BVAR (buf, undo_list), Qt)) |
| 256 | return; | 256 | return; |
| @@ -260,7 +260,7 @@ record_property_change (ptrdiff_t beg, ptrdiff_t length, | |||
| 260 | pending_boundary = Fcons (Qnil, Qnil); | 260 | pending_boundary = Fcons (Qnil, Qnil); |
| 261 | 261 | ||
| 262 | if (buf != last_undo_buffer) | 262 | if (buf != last_undo_buffer) |
| 263 | boundary = 1; | 263 | boundary = true; |
| 264 | last_undo_buffer = buf; | 264 | last_undo_buffer = buf; |
| 265 | 265 | ||
| 266 | /* Switch temporarily to the buffer that was changed. */ | 266 | /* Switch temporarily to the buffer that was changed. */ |
| @@ -519,5 +519,5 @@ so it must make sure not to do a lot of consing. */); | |||
| 519 | 519 | ||
| 520 | DEFVAR_BOOL ("undo-inhibit-record-point", undo_inhibit_record_point, | 520 | DEFVAR_BOOL ("undo-inhibit-record-point", undo_inhibit_record_point, |
| 521 | doc: /* Non-nil means do not record `point' in `buffer-undo-list'. */); | 521 | doc: /* Non-nil means do not record `point' in `buffer-undo-list'. */); |
| 522 | undo_inhibit_record_point = 0; | 522 | undo_inhibit_record_point = false; |
| 523 | } | 523 | } |