comparison src/region-cache.c @ 109126:aec1143e8d85

Convert (most) functions in src to standard C. * src/alloc.c: Convert function definitions to standard C. * src/atimer.c: * src/bidi.c: * src/bytecode.c: * src/callint.c: * src/callproc.c: * src/casefiddle.c: * src/casetab.c: * src/category.c: * src/ccl.c: * src/character.c: * src/charset.c: * src/chartab.c: * src/cmds.c: * src/coding.c: * src/composite.c: * src/data.c: * src/dbusbind.c: * src/dired.c: * src/dispnew.c: * src/doc.c: * src/doprnt.c: * src/ecrt0.c: * src/editfns.c: * src/fileio.c: * src/filelock.c: * src/filemode.c: * src/fns.c: * src/font.c: * src/fontset.c: * src/frame.c: * src/fringe.c: * src/ftfont.c: * src/ftxfont.c: * src/gtkutil.c: * src/indent.c: * src/insdel.c: * src/intervals.c: * src/keymap.c: * src/lread.c: * src/macros.c: * src/marker.c: * src/md5.c: * src/menu.c: * src/minibuf.c: * src/prefix-args.c: * src/print.c: * src/ralloc.c: * src/regex.c: * src/region-cache.c: * src/scroll.c: * src/search.c: * src/sound.c: * src/strftime.c: * src/syntax.c: * src/sysdep.c: * src/termcap.c: * src/terminal.c: * src/terminfo.c: * src/textprop.c: * src/tparam.c: * src/undo.c: * src/unexelf.c: * src/window.c: * src/xfaces.c: * src/xfns.c: * src/xfont.c: * src/xftfont.c: * src/xgselect.c: * src/xmenu.c: * src/xrdb.c: * src/xselect.c: * src/xsettings.c: * src/xsmfns.c: * src/xterm.c: Likewise.

109125:12b02558bf51

   information about this many characters, call
   revalidate_region_cache before doing the new invalidation, to
   preserve that information, instead of throwing it away.  */
#define PRESERVE_THRESHOLD (500)

static void revalidate_region_cache ();


/* Interface: Allocating, initializing, and disposing of region caches.  */

struct region_cache *
new_region_cache ()
{
  struct region_cache *c
    = (struct region_cache *) xmalloc (sizeof (struct region_cache));

  c->gap_start = 0;

  return c;
}

void
free_region_cache (c)
     struct region_cache *c;
{
  xfree (c->boundaries);
  xfree (c);
}

   This operation should be logarithmic in the number of cache
   entries.  It would be nice if it took advantage of locality of
   reference, too, by searching entries near the last entry found.  */
static int
find_cache_boundary (c, pos)
     struct region_cache *c;
     int pos;
{
  int low = 0, high = c->cache_len;

  while (low + 1 < high)
    {

/* Move the gap of cache C to index POS, and make sure it has space
   for at least MIN_SIZE boundaries.  */
static void
move_cache_gap (c, pos, min_size)
     struct region_cache *c;
     int pos;
     int min_size;
{
  /* Copy these out of the cache and into registers.  */
  int gap_start = c->gap_start;
  int gap_len = c->gap_len;
  int buffer_beg = c->buffer_beg;

/* Insert a new boundary in cache C; it will have cache index INDEX,
   and have the specified POS and VALUE.  */
static void
insert_cache_boundary (c, index, pos, value)
     struct region_cache *c;
     int index;
     int pos, value;
{
  /* index must be a valid cache index.  */
  if (index < 0 || index > c->cache_len)
    abort ();

/* Delete the i'th entry from cache C if START <= i < END.  */

static void
delete_cache_boundaries (c, start, end)
     struct region_cache *c;
     int start, end;
{
  int len = end - start;

  /* Gotta be in range.  */
  if (start < 0


/* Set the value for a region.  */

/* Set the value in cache C for the region START..END to VALUE.  */
static void
set_cache_region (c, start, end, value)
     struct region_cache *c;
     int start, end;
     int value;
{
  if (start > end)
    abort ();
  if (start < c->buffer_beg
      || end   > c->buffer_end)

      region.
   (This way of specifying regions makes more sense than absolute
   buffer positions in the presence of insertions and deletions; the
   args to pass are the same before and after such an operation.)  */
void
invalidate_region_cache (buf, c, head, tail)
     struct buffer *buf;
     struct region_cache *c;
     int head, tail;
{
  /* Let chead = c->beg_unchanged, and
         ctail = c->end_unchanged.
     If z-tail < beg+chead by a large amount, or
        z-ctail < beg+head by a large amount,

   Calling this function may be expensive; it does binary searches in
   the cache, and causes cache gap motion.  */

static void
revalidate_region_cache (buf, c)
     struct buffer *buf;
     struct region_cache *c;
{
  /* The boundaries now in the cache are expressed relative to the
     buffer_beg and buffer_end values stored in the cache.  Now,
     buffer_beg and buffer_end may not be the same as BUF_BEG (buf)
     and BUF_Z (buf), so we have two different "bases" to deal with

/* Assert that the region of BUF between START and END (absolute
   buffer positions) is "known," for the purposes of CACHE (e.g. "has
   no newlines", in the case of the line cache).  */
void
know_region_cache (buf, c, start, end)
     struct buffer *buf;
     struct region_cache *c;
     int start, end;
{
  revalidate_region_cache (buf, c);

  set_cache_region (c, start, end, 1);
}

/* Return true if the text immediately after POS in BUF is known, for
   the purposes of CACHE.  If NEXT is non-zero, set *NEXT to the nearest
   position after POS where the knownness changes.  */
int
region_cache_forward (buf, c, pos, next)
     struct buffer *buf;
     struct region_cache *c;
     int pos;
     int *next;
{
  revalidate_region_cache (buf, c);

  {
    int i = find_cache_boundary (c, pos);

}

/* Return true if the text immediately before POS in BUF is known, for
   the purposes of CACHE.  If NEXT is non-zero, set *NEXT to the nearest
   position before POS where the knownness changes.  */
int region_cache_backward (buf, c, pos, next)
     struct buffer *buf;
     struct region_cache *c;
     int pos;
     int *next;
{
  revalidate_region_cache (buf, c);

  /* Before the beginning of the buffer is unknown, by
     definition. */


/* Debugging: pretty-print a cache to the standard error output.  */

void
pp_cache (c)
     struct region_cache *c;
{
  int i;
  int beg_u = c->buffer_beg + c->beg_unchanged;
  int end_u = c->buffer_end - c->end_unchanged;

109126:aec1143e8d85

   information about this many characters, call
   revalidate_region_cache before doing the new invalidation, to
   preserve that information, instead of throwing it away.  */
#define PRESERVE_THRESHOLD (500)

static void revalidate_region_cache (struct buffer *buf, struct region_cache *c);


/* Interface: Allocating, initializing, and disposing of region caches.  */

struct region_cache *
new_region_cache (void)
{
  struct region_cache *c
    = (struct region_cache *) xmalloc (sizeof (struct region_cache));

  c->gap_start = 0;

  return c;
}

void
free_region_cache (struct region_cache *c)
{
  xfree (c->boundaries);
  xfree (c);
}

   This operation should be logarithmic in the number of cache
   entries.  It would be nice if it took advantage of locality of
   reference, too, by searching entries near the last entry found.  */
static int
find_cache_boundary (struct region_cache *c, int pos)
{
  int low = 0, high = c->cache_len;

  while (low + 1 < high)
    {

/* Move the gap of cache C to index POS, and make sure it has space
   for at least MIN_SIZE boundaries.  */
static void
move_cache_gap (struct region_cache *c, int pos, int min_size)
{
  /* Copy these out of the cache and into registers.  */
  int gap_start = c->gap_start;
  int gap_len = c->gap_len;
  int buffer_beg = c->buffer_beg;

/* Insert a new boundary in cache C; it will have cache index INDEX,
   and have the specified POS and VALUE.  */
static void
insert_cache_boundary (struct region_cache *c, int index, int pos, int value)
{
  /* index must be a valid cache index.  */
  if (index < 0 || index > c->cache_len)
    abort ();

/* Delete the i'th entry from cache C if START <= i < END.  */

static void
delete_cache_boundaries (struct region_cache *c, int start, int end)
{
  int len = end - start;

  /* Gotta be in range.  */
  if (start < 0


/* Set the value for a region.  */

/* Set the value in cache C for the region START..END to VALUE.  */
static void
set_cache_region (struct region_cache *c, int start, int end, int value)
{
  if (start > end)
    abort ();
  if (start < c->buffer_beg
      || end   > c->buffer_end)

      region.
   (This way of specifying regions makes more sense than absolute
   buffer positions in the presence of insertions and deletions; the
   args to pass are the same before and after such an operation.)  */
void
invalidate_region_cache (struct buffer *buf, struct region_cache *c, int head, int tail)
{
  /* Let chead = c->beg_unchanged, and
         ctail = c->end_unchanged.
     If z-tail < beg+chead by a large amount, or
        z-ctail < beg+head by a large amount,

   Calling this function may be expensive; it does binary searches in
   the cache, and causes cache gap motion.  */

static void
revalidate_region_cache (struct buffer *buf, struct region_cache *c)
{
  /* The boundaries now in the cache are expressed relative to the
     buffer_beg and buffer_end values stored in the cache.  Now,
     buffer_beg and buffer_end may not be the same as BUF_BEG (buf)
     and BUF_Z (buf), so we have two different "bases" to deal with

/* Assert that the region of BUF between START and END (absolute
   buffer positions) is "known," for the purposes of CACHE (e.g. "has
   no newlines", in the case of the line cache).  */
void
know_region_cache (struct buffer *buf, struct region_cache *c, int start, int end)
{
  revalidate_region_cache (buf, c);

  set_cache_region (c, start, end, 1);
}

/* Return true if the text immediately after POS in BUF is known, for
   the purposes of CACHE.  If NEXT is non-zero, set *NEXT to the nearest
   position after POS where the knownness changes.  */
int
region_cache_forward (struct buffer *buf, struct region_cache *c, int pos, int *next)
{
  revalidate_region_cache (buf, c);

  {
    int i = find_cache_boundary (c, pos);

}

/* Return true if the text immediately before POS in BUF is known, for
   the purposes of CACHE.  If NEXT is non-zero, set *NEXT to the nearest
   position before POS where the knownness changes.  */
int region_cache_backward (struct buffer *buf, struct region_cache *c, int pos, int *next)
{
  revalidate_region_cache (buf, c);

  /* Before the beginning of the buffer is unknown, by
     definition. */


/* Debugging: pretty-print a cache to the standard error output.  */

void
pp_cache (struct region_cache *c)
{
  int i;
  int beg_u = c->buffer_beg + c->beg_unchanged;
  int end_u = c->buffer_end - c->end_unchanged;