diff options
| author | Paul Eggert | 2011-03-28 23:59:27 -0700 |
|---|---|---|
| committer | Paul Eggert | 2011-03-28 23:59:27 -0700 |
| commit | c499e55717190f3fcf46fd04cfead5bf31962ab2 (patch) | |
| tree | b446623ead86fd15691a49ec50679d69541dc5bd | |
| parent | b01a1c29127705cf435f02d50b48d6f85f5b2716 (diff) | |
| download | emacs-c499e55717190f3fcf46fd04cfead5bf31962ab2.tar.gz emacs-c499e55717190f3fcf46fd04cfead5bf31962ab2.zip | |
* window.c (shrink_windows): Omit unused local var.
| -rw-r--r-- | src/ChangeLog | 1 | ||||
| -rw-r--r-- | src/window.c | 6 |
2 files changed, 2 insertions, 5 deletions
diff --git a/src/ChangeLog b/src/ChangeLog index 1f636e0dde6..938619aa08f 100644 --- a/src/ChangeLog +++ b/src/ChangeLog | |||
| @@ -1,5 +1,6 @@ | |||
| 1 | 2011-03-29 Paul Eggert <eggert@cs.ucla.edu> | 1 | 2011-03-29 Paul Eggert <eggert@cs.ucla.edu> |
| 2 | 2 | ||
| 3 | * window.c (shrink_windows): Omit unused local var. | ||
| 3 | * menu.c (digest_single_submenu): Omit unused local var. | 4 | * menu.c (digest_single_submenu): Omit unused local var. |
| 4 | * dispnew.c (update_window) [PERIODIC_PREEMPTION_CHECKING]: | 5 | * dispnew.c (update_window) [PERIODIC_PREEMPTION_CHECKING]: |
| 5 | Omit unused local var. | 6 | Omit unused local var. |
diff --git a/src/window.c b/src/window.c index 9ab9fab2c13..b7747b5ad79 100644 --- a/src/window.c +++ b/src/window.c | |||
| @@ -2978,14 +2978,10 @@ shrink_windows (int total, int size, int nchildren, int shrinkable, | |||
| 2978 | while (total_shrink > total_removed) | 2978 | while (total_shrink > total_removed) |
| 2979 | { | 2979 | { |
| 2980 | int nonzero_sizes = 0; | 2980 | int nonzero_sizes = 0; |
| 2981 | int nonzero_idx = -1; | ||
| 2982 | 2981 | ||
| 2983 | for (i = 0; i < nchildren; ++i) | 2982 | for (i = 0; i < nchildren; ++i) |
| 2984 | if (new_sizes[i] > 0) | 2983 | if (new_sizes[i] > 0) |
| 2985 | { | 2984 | ++nonzero_sizes; |
| 2986 | ++nonzero_sizes; | ||
| 2987 | nonzero_idx = i; | ||
| 2988 | } | ||
| 2989 | 2985 | ||
| 2990 | for (i = 0; i < nchildren; ++i) | 2986 | for (i = 0; i < nchildren; ++i) |
| 2991 | if (new_sizes[i] > min_sizes[i]) | 2987 | if (new_sizes[i] > min_sizes[i]) |