summaryrefslogtreecommitdiff
path: root/src/region-cache.c
diff options
context:
space:
mode:
authorPaul Eggert <eggert@cs.ucla.edu>2011-07-28 18:10:08 -0700
committerPaul Eggert <eggert@cs.ucla.edu>2011-07-28 18:10:08 -0700
commit7d56f940979701a930cf9a7bc753fb9f39ce508b (patch)
tree84c43a98f09f4fca9179e4ab2aac7f1391df53e0 /src/region-cache.c
parentbf2da747e95a3902bf715076aeee947d657c94cd (diff)
downloademacs-7d56f940979701a930cf9a7bc753fb9f39ce508b.tar.gz
* region-cache.c (move_cache_gap): Check for size calculation overflow.
Diffstat (limited to 'src/region-cache.c')
-rw-r--r--src/region-cache.c13
1 files changed, 9 insertions, 4 deletions
diff --git a/src/region-cache.c b/src/region-cache.c
index d701f4d71b0..e6cec96171d 100644
--- a/src/region-cache.c
+++ b/src/region-cache.c
@@ -247,11 +247,16 @@ move_cache_gap (struct region_cache *c, EMACS_INT pos, EMACS_INT min_size)
if (gap_len < min_size)
{
EMACS_INT i;
+ ptrdiff_t cache_len_max =
+ min (PTRDIFF_MAX, SIZE_MAX) / sizeof *c->boundaries;
+ ptrdiff_t min_size_max = cache_len_max - c->cache_len;
- /* Always make at least NEW_CACHE_GAP elements, as long as we're
- expanding anyway. */
- if (min_size < NEW_CACHE_GAP)
- min_size = NEW_CACHE_GAP;
+ if (min_size_max < min_size)
+ memory_full (SIZE_MAX);
+
+ /* Unless running out of space, make at least NEW_CACHE_GAP
+ elements, as long as we're expanding anyway. */
+ min_size = max (min_size, min (min_size_max, NEW_CACHE_GAP));
c->boundaries =
(struct boundary *) xrealloc (c->boundaries,