diff options
| author | Paul Eggert | 2023-08-12 12:50:15 -0700 |
|---|---|---|
| committer | Paul Eggert | 2023-08-12 12:57:35 -0700 |
| commit | f3868cb9d1806b35186eabc0262393316ebe689a (patch) | |
| tree | b94176760150b6994aacf74292a12ba0890b9222 /lib/diffseq.h | |
| parent | b66c16c789d8046ff40c48b9346b26238b1b97e1 (diff) | |
| download | emacs-f3868cb9d1806b35186eabc0262393316ebe689a.tar.gz emacs-f3868cb9d1806b35186eabc0262393316ebe689a.zip | |
Update from Gnulib by running admin/merge-gnulib
Diffstat (limited to 'lib/diffseq.h')
| -rw-r--r-- | lib/diffseq.h | 24 |
1 files changed, 5 insertions, 19 deletions
diff --git a/lib/diffseq.h b/lib/diffseq.h index 06e1465bf1b..3f85ab2ec41 100644 --- a/lib/diffseq.h +++ b/lib/diffseq.h | |||
| @@ -92,20 +92,11 @@ | |||
| 92 | # define NOTE_ORDERED false | 92 | # define NOTE_ORDERED false |
| 93 | #endif | 93 | #endif |
| 94 | 94 | ||
| 95 | /* Use this to suppress gcc's "...may be used before initialized" warnings. | 95 | /* Suppress gcc's "...may be used before initialized" warnings, |
| 96 | Beware: The Code argument must not contain commas. */ | 96 | generated by GCC versions up to at least GCC 13.2. */ |
| 97 | #if __GNUC__ + (__GNUC_MINOR__ >= 7) > 4 | 97 | #if __GNUC__ + (__GNUC_MINOR__ >= 7) > 4 |
| 98 | # pragma GCC diagnostic push | 98 | # pragma GCC diagnostic push |
| 99 | #endif | 99 | # pragma GCC diagnostic ignored "-Wmaybe-uninitialized" |
| 100 | #ifndef IF_LINT | ||
| 101 | # if defined GCC_LINT || defined lint | ||
| 102 | # define IF_LINT(Code) Code | ||
| 103 | # else | ||
| 104 | # define IF_LINT(Code) /* empty */ | ||
| 105 | # if __GNUC__ + (__GNUC_MINOR__ >= 7) > 4 | ||
| 106 | # pragma GCC diagnostic ignored "-Wmaybe-uninitialized" | ||
| 107 | # endif | ||
| 108 | # endif | ||
| 109 | #endif | 100 | #endif |
| 110 | 101 | ||
| 111 | /* | 102 | /* |
| @@ -388,13 +379,8 @@ diag (OFFSET xoff, OFFSET xlim, OFFSET yoff, OFFSET ylim, bool find_minimal, | |||
| 388 | and report halfway between our best results so far. */ | 379 | and report halfway between our best results so far. */ |
| 389 | if (c >= ctxt->too_expensive) | 380 | if (c >= ctxt->too_expensive) |
| 390 | { | 381 | { |
| 391 | OFFSET fxybest; | ||
| 392 | OFFSET fxbest IF_LINT (= 0); | ||
| 393 | OFFSET bxybest; | ||
| 394 | OFFSET bxbest IF_LINT (= 0); | ||
| 395 | |||
| 396 | /* Find forward diagonal that maximizes X + Y. */ | 382 | /* Find forward diagonal that maximizes X + Y. */ |
| 397 | fxybest = -1; | 383 | OFFSET fxybest = -1, fxbest; |
| 398 | for (d = fmax; d >= fmin; d -= 2) | 384 | for (d = fmax; d >= fmin; d -= 2) |
| 399 | { | 385 | { |
| 400 | OFFSET x = MIN (fd[d], xlim); | 386 | OFFSET x = MIN (fd[d], xlim); |
| @@ -412,7 +398,7 @@ diag (OFFSET xoff, OFFSET xlim, OFFSET yoff, OFFSET ylim, bool find_minimal, | |||
| 412 | } | 398 | } |
| 413 | 399 | ||
| 414 | /* Find backward diagonal that minimizes X + Y. */ | 400 | /* Find backward diagonal that minimizes X + Y. */ |
| 415 | bxybest = OFFSET_MAX; | 401 | OFFSET bxybest = OFFSET_MAX, bxbest; |
| 416 | for (d = bmax; d >= bmin; d -= 2) | 402 | for (d = bmax; d >= bmin; d -= 2) |
| 417 | { | 403 | { |
| 418 | OFFSET x = MAX (xoff, bd[d]); | 404 | OFFSET x = MAX (xoff, bd[d]); |