/src/vlc/contrib/contrib-build/libkate/src/kate_decode.c

Source
/* Copyright (C) 2008, 2009 Vincent Penquerc'h.
   This file is part of the Kate codec library.
   Written by Vincent Penquerc'h.

   Use, distribution and reproduction of this library is governed
   by a BSD style source license included with this source in the
   file 'COPYING'. Please read these terms before distributing. */


#define KATE_INTERNAL
#include "kate_internal.h"

#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#include "kate/kate.h"
#include "kate_decode_state.h"
#include "kate_fp.h"
#include "kate_rle.h"

typedef struct kate_memory_guard {
  size_t size;
  void **pointers;
} kate_memory_guard;

static void *kate_memory_guard_malloc(kate_memory_guard *kmg,size_t size)
{
  void **new_pointers;
  void *ptr;
  int ret;

  ret=kate_check_add_overflow(kmg->size,1,NULL);
  if (ret<0) return NULL;

  ptr=kate_malloc(size);
  if (!ptr) return NULL;
  new_pointers=(void**)kate_checked_realloc(kmg->pointers,(kmg->size+1),sizeof(void*));
  if (!new_pointers) {
    kate_free(ptr);
    return NULL;
  }
  kmg->pointers=new_pointers;
  kmg->pointers[kmg->size++]=ptr;
  return ptr;
}

static void *kate_memory_guard_checked_malloc(kate_memory_guard *kmg,size_t size1,size_t size2)
{
  size_t size;
  int ret=kate_check_mul_overflow(size1,size2,&size);
  if (ret<0) return NULL;
  return kate_memory_guard_malloc(kmg,size);
}

static void kate_memory_guard_flush(kate_memory_guard *kmg,int free_pointers)
{
  size_t n;
  if (free_pointers) {
    for (n=0;n<kmg->size;++n) kate_free(kmg->pointers[n]);
  }
  kmg->size=0;
}

static void kate_memory_guard_destroy(kate_memory_guard *kmg,int free_pointers)
{
  kate_memory_guard_flush(kmg,free_pointers);
  if (kmg->pointers) kate_free(kmg->pointers);
}

static int kate_memory_guard_merge(kate_memory_guard *kmg,kate_memory_guard *parent_kmg)
{
  void **new_pointers;
  int ret;
  size_t new_size;

  ret=kate_check_add_overflow(parent_kmg->size,kmg->size,&new_size);
  if (ret<0) return ret;

  new_pointers=(void**)kate_checked_realloc(parent_kmg->pointers,new_size,sizeof(void*));
  if (!new_pointers) {
    kate_memory_guard_destroy(kmg,1);
    return KATE_E_OUT_OF_MEMORY;
  }
  parent_kmg->pointers=new_pointers;
  memcpy(parent_kmg->pointers+parent_kmg->size,kmg->pointers,kmg->size*sizeof(void*));
  parent_kmg->size=new_size;
  kate_memory_guard_destroy(kmg,0);
  return 0;
}

#define KMG_GUARD() kate_memory_guard kmg={0,NULL}
#define KMG_MALLOC(size) kate_memory_guard_malloc(&kmg,size)
#define KMG_CHECKED_MALLOC(size1,size2) kate_memory_guard_checked_malloc(&kmg,size1,size2)
#define KMG_MERGE(parent_kmg) kate_memory_guard_merge(&kmg,parent_kmg)
#define KMG_ERROR(ret) (kate_memory_guard_destroy(&kmg,1),ret)
#define KMG_OK() (kate_memory_guard_destroy(&kmg,0),0)
#define KMG_FLUSH(free_pointers) kate_memory_guard_flush(&kmg,free_pointers)



static int kate_readbuf(kate_pack_buffer *kpb,char *s,int len)
{
  if (len<0) return KATE_E_INVALID_PARAMETER;
  if ((kate_pack_readable_bits(kpb)+7)/8<len) return KATE_E_BAD_PACKET;
  while (len--) *s++=kate_pack_read(kpb,8);
  return 0;
}

static kate_int32_t kate_read32(kate_pack_buffer *kpb)
{
  kate_int32_t v=0;
  v|=kate_pack_read(kpb,8);
  v|=(kate_pack_read(kpb,8)<<8);
  v|=(kate_pack_read(kpb,8)<<16);
  v|=(kate_pack_read(kpb,8)<<24);
  return v;
}

static kate_int32_t kate_read32v(kate_pack_buffer *kpb)
{
  /* an error (negative) will be returned as negative, propagating the error
     to the caller even though the expected range for 4 bits is 0-15 */
  int smallv=kate_pack_read(kpb,4);
  if (smallv==15) {
    int sign=kate_pack_read1(kpb);
    int bits=kate_pack_read(kpb,5)+1;
    kate_int32_t v=kate_pack_read(kpb,bits);
    if (sign) v=-v;
    return v;
  }
  else return smallv;
}

static kate_int64_t kate_read64(kate_pack_buffer *kpb)
{
  kate_int32_t vl=kate_read32(kpb);
  kate_int32_t vh=kate_read32(kpb);
  return (0xffffffff&(kate_int64_t)vl)|(((kate_int64_t)vh)<<32);
}

static int kate_overread(kate_pack_buffer *kpb)
{
  return kate_pack_look(kpb,0)<0;
}

static int kate_warp(kate_pack_buffer *kpb)
{
  while (1) {
    kate_int32_t bits=kate_read32v(kpb);
    if (!bits) break;
    if (bits<0) return KATE_E_BAD_PACKET;
    kate_pack_adv(kpb,bits);
  }
  return 0;
}

static int kate_read_metadata(kate_pack_buffer *kpb,kate_meta **km)
{
  KMG_GUARD();
  kate_meta *tmp;
  size_t n,nmeta;
  char *tag,*value;
  int len;
  int ret;

  *km=NULL;
  if (!kate_pack_read1(kpb)) return 0;

  ret=kate_meta_create(&tmp);
  if (ret<0) return ret;
  nmeta=kate_read32v(kpb);
  for (n=0;n<nmeta;++n) {
    len=kate_read32v(kpb);
    if (len<=0) goto error_bad_packet;
    tag=(char*)KMG_MALLOC(len+1);
    if (!tag) goto error_out_of_memory;
    kate_readbuf(kpb,tag,len);
    tag[len]=0;

    len=kate_read32v(kpb);
    if (len<0) goto error_bad_packet;
    value=(char*)KMG_MALLOC(len+1);
    if (!value) goto error_out_of_memory;
    kate_readbuf(kpb,value,len);
    value[len]=0;

    kate_warp(kpb);

    ret=kate_meta_add(tmp,tag,value,len);
    if (ret<0) goto error;

    KMG_FLUSH(1); /* TODO: unnecessary temporary allocations */
  }

  kate_warp(kpb);

  *km=tmp;
  return KMG_OK();

error_bad_packet:
  ret=KATE_E_BAD_PACKET;
  goto error;

error_out_of_memory:
  ret=KATE_E_OUT_OF_MEMORY;
  goto error;

error:
  kate_meta_destroy(tmp);
  return KMG_ERROR(ret);
}

static int kate_decode_check_magic(kate_pack_buffer *kpb)
{
  char magic[8];
  int ret;

  if (!kpb) return KATE_E_INVALID_PARAMETER;

  ret=kate_readbuf(kpb,magic,7);
  if (ret<0) return KATE_E_NOT_KATE;
  if (memcmp(magic,"kate\0\0\0",7)) return KATE_E_NOT_KATE;

  return 0;
}

/**
  \ingroup decoding
  Checks if a packet is a Kate ID header
  \param kp the packet to inspect
  \returns 0 the packet is not an ID header
  \returns !=0 the packet is an ID header
  */
int kate_decode_is_idheader(const kate_packet *kp)
{
  kate_pack_buffer kpb;
  unsigned char headerid;

  if (!kp) return 0;

  kate_pack_readinit(&kpb,kp->data,kp->nbytes);
  headerid=kate_pack_read(&kpb,8);
  if (headerid!=0x80) return 0;

  return !kate_decode_check_magic(&kpb);
}

static int kate_check_eop(kate_pack_buffer *kpb)
{
  int bits;

  if (!kpb) return KATE_E_INVALID_PARAMETER;

  /* ensure any remaining bits in the current byte are zero (reading 0 bytes yields zero) */
  bits=7&(8-(kate_pack_bits(kpb)&7));
  if (bits>0) {
    if (kate_pack_read(kpb,bits)) return KATE_E_BAD_PACKET;
  }
  if (kate_pack_look1(kpb)>=0) return KATE_E_BAD_PACKET; /* no more data expected */

  return 0;
}

static int kate_decode_read_canvas_size(kate_pack_buffer *kpb)
{
  size_t base,shift;

  if (!kpb) return KATE_E_INVALID_PARAMETER;

  shift=kate_pack_read(kpb,4);
  base=kate_pack_read(kpb,4);
  base|=(kate_pack_read(kpb,8)<<4);

  return base<<shift;
}

#define KATE_IS_BITSTREAM_LOE(major,minor) (major)

static int kate_decode_info_header(kate_info *ki,kate_pack_buffer *kpb)
{
  KMG_GUARD();
  int len;
  int ret;
  char *language,*category;
  int reserved;

  if (!ki || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  ki->bitstream_version_major=kate_pack_read(kpb,8);
  ki->bitstream_version_minor=kate_pack_read(kpb,8);
  if (ki->bitstream_version_major>KATE_BITSTREAM_VERSION_MAJOR) return KMG_ERROR(KATE_E_VERSION);

  ki->num_headers=kate_pack_read(kpb,8);
  if (ki->num_headers<1) return KMG_ERROR(KATE_E_BAD_PACKET);
  ki->text_encoding=kate_pack_read(kpb,8);
  ki->text_directionality=kate_pack_read(kpb,8);
  reserved=kate_pack_read(kpb,8);
  if (ki->bitstream_version_major==0 && ki->bitstream_version_minor<3) {
    if (reserved!=0) return KMG_ERROR(KATE_E_BAD_PACKET); /* reserved - 0 */
  }
  ki->granule_shift=kate_pack_read(kpb,8);

  ret=kate_decode_read_canvas_size(kpb);
  if (ret<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  ki->original_canvas_width=ret;
  ret=kate_decode_read_canvas_size(kpb);
  if (ret<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  ki->original_canvas_height=ret;

  reserved=kate_read32(kpb);
  if (ki->bitstream_version_major==0 && ki->bitstream_version_minor<3) {
    if (reserved!=0) return KMG_ERROR(KATE_E_BAD_PACKET); /* reserved - 0 */
  }

  ki->gps_numerator=kate_read32(kpb);
  ki->gps_denominator=kate_read32(kpb);

  if (ki->granule_shift>=64) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (ki->gps_numerator==0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (ki->gps_denominator==0) return KMG_ERROR(KATE_E_BAD_PACKET);
  /*
  should not be needed anymore, calculations on these should be ok with full 32 bit range
  if ((ki->gps_numerator^ki->gps_denominator)<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  */

  len=16;
  language=(char*)KMG_MALLOC(len);
  if (!language) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
  ret=kate_readbuf(kpb,language,len); /* a terminating null is included */
  if (ret<0) return KMG_ERROR(ret);
  if (language[len-1]) return KMG_ERROR(KATE_E_BAD_PACKET); /* but do check it to be sure */

  len=16;
  category=(char*)KMG_MALLOC(len);
  if (!category) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
  ret=kate_readbuf(kpb,category,len); /* a terminating null is included */
  if (ret<0) return KMG_ERROR(ret);
  if (category[len-1]) return KMG_ERROR(KATE_E_BAD_PACKET); /* but do check it to be sure */

  ret=kate_check_eop(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ki->language=language;
  ki->category=category;

  return KMG_OK();
}

static int kate_decode_comment_packet(const kate_info *ki,kate_comment *kc,kate_pack_buffer *kpb)
{
  KMG_GUARD();
  int ret,len,nc;
  char **user_comments,*vendor;
  int comments,*comment_lengths;

  if (!ki || !kc || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  len=kate_read32(kpb);
  if (len<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (!ki->no_limits && len>KATE_LIMIT_COMMENT_LENGTH) return KMG_ERROR(KATE_E_LIMIT);
  vendor=(char*)KMG_MALLOC(len+1);
  if (!vendor) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
  ret=kate_readbuf(kpb,vendor,len);
  if (ret<0) return KMG_ERROR(ret);
  vendor[len]=0;

  comments=kate_read32(kpb);
  if (comments<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (!ki->no_limits && len>KATE_LIMIT_COMMENTS) return KMG_ERROR(KATE_E_LIMIT);
  user_comments=(char**)KMG_CHECKED_MALLOC(comments,sizeof(char*));
  comment_lengths=(int*)KMG_CHECKED_MALLOC(comments,sizeof(int));
  if (!user_comments || !comment_lengths) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);

  for (nc=0;nc<comments;++nc) user_comments[nc]=NULL;
  for (nc=0;nc<comments;++nc) {
    len=kate_read32(kpb);
    if (len<0) return KMG_ERROR(KATE_E_BAD_PACKET);
    if (!ki->no_limits && len>KATE_LIMIT_COMMENT_LENGTH) return KMG_ERROR(KATE_E_LIMIT);
    user_comments[nc]=(char*)KMG_MALLOC(len+1);
    if (!user_comments[nc]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
    if (len) {
      ret=kate_readbuf(kpb,user_comments[nc],len);
      if (ret<0) return KMG_ERROR(ret);
    }
    user_comments[nc][len]=0;
    comment_lengths[nc]=len;
  }

  ret=kate_check_eop(kpb);
  if (ret<0) return KMG_ERROR(ret);

  kc->user_comments=user_comments;
  kc->comment_lengths=comment_lengths;
  kc->comments=comments;
  kc->vendor=vendor;

  return KMG_OK();
}

static int kate_decode_region(const kate_info *ki,kate_region *kr,kate_pack_buffer *kpb)
{
  int ret;

  if (!kr || !kpb) return KATE_E_INVALID_PARAMETER;

  kr->metric=kate_pack_read(kpb,8);
  kr->x=kate_read32v(kpb);
  kr->y=kate_read32v(kpb);
  kr->w=kate_read32v(kpb);
  kr->h=kate_read32v(kpb);
  kr->style=kate_read32v(kpb);

  if (((ki->bitstream_version_major<<8)|ki->bitstream_version_minor)>=0x0002) {
    /* 0.2 adds a warp for clip */
    kate_read32v(kpb); /* the size of the warp */
    kr->clip=kate_pack_read1(kpb);
  }
  else {
    kr->clip=0;
  }

  if (((ki->bitstream_version_major<<8)|ki->bitstream_version_minor)>=0x0006) {
    /* 0.6 adds a warp for metadata */
    kate_read32v(kpb); /* the size of the warp */
    ret=kate_read_metadata(kpb,&kr->meta);
    if (ret<0) return ret;
  }
  else {
    kr->meta=NULL;
  }

  return kate_warp(kpb);
}

static int kate_decode_regions_packet(kate_info *ki,kate_pack_buffer *kpb)
{
  KMG_GUARD();
  int ret,n,nregions;
  kate_region **regions;

  if (!ki || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  nregions=kate_read32v(kpb);
  if (nregions<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (!ki->no_limits && nregions>KATE_LIMIT_REGIONS) return KMG_ERROR(KATE_E_LIMIT);
  regions=(kate_region**)KMG_CHECKED_MALLOC(nregions,sizeof(kate_region*));
  if (!regions) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
  for (n=0;n<nregions;++n) {
    regions[n]=(kate_region*)KMG_MALLOC(sizeof(kate_region));
    if (!regions[n]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
    ret=kate_decode_region(ki,regions[n],kpb);
    if (kate_overread(kpb)) return KMG_ERROR(KATE_E_BAD_PACKET);
    if (ret<0) return KMG_ERROR(ret);
  }

  ret=kate_warp(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ret=kate_check_eop(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ki->nregions=nregions;
  ki->regions=regions;

  return KMG_OK();
}

static int kate_decode_color(kate_color *kc,kate_pack_buffer *kpb)
{
  if (!kc || !kpb) return KATE_E_INVALID_PARAMETER;
  kc->r=kate_pack_read(kpb,8);
  kc->g=kate_pack_read(kpb,8);
  kc->b=kate_pack_read(kpb,8);
  kc->a=kate_pack_read(kpb,8);
  return 0;
}

static int kate_decode_style(const kate_info *ki,kate_style *ks,kate_pack_buffer *kpb,kate_memory_guard *parent_kmg)
{
  KMG_GUARD();
  int ret;
  kate_float d[8];
  size_t idx;
  int len;

  if (!ks || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  ret=kate_fp_decode_kate_float(sizeof(d)/sizeof(d[0]),d,1,kpb);
  if (ret<0) return KMG_ERROR(ret);

  idx=0;
  ks->halign=d[idx++];
  ks->valign=d[idx++];
  ks->font_width=d[idx++];
  ks->font_height=d[idx++];
  ks->left_margin=d[idx++];
  ks->top_margin=d[idx++];
  ks->right_margin=d[idx++];
  ks->bottom_margin=d[idx++];
  ret=kate_decode_color(&ks->text_color,kpb);
  if (ret<0) return KMG_ERROR(ret);
  ret=kate_decode_color(&ks->background_color,kpb);
  if (ret<0) return KMG_ERROR(ret);
  ret=kate_decode_color(&ks->draw_color,kpb);
  if (ret<0) return KMG_ERROR(ret);
  ks->font_metric=kate_pack_read(kpb,8);
  ks->margin_metric=kate_pack_read(kpb,8);
  ks->bold=kate_pack_read1(kpb);
  ks->italics=kate_pack_read1(kpb);
  ks->underline=kate_pack_read1(kpb);
  ks->strike=kate_pack_read1(kpb);

  if (((ki->bitstream_version_major<<8)|ki->bitstream_version_minor)>=0x0002) {
    /* 0.2 adds a warp for justify and font */
    kate_read32v(kpb); /* the size of the warp */
    ks->justify=kate_pack_read1(kpb);
    len=kate_read32v(kpb);
    if (len<0) {
      return KMG_ERROR(KATE_E_BAD_PACKET);
    }
    else if (len>0) {
      ks->font=(char*)KMG_MALLOC(len+1);
      if (!ks->font) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
      ret=kate_readbuf(kpb,ks->font,len);
      if (ret<0) return KMG_ERROR(ret);
      ks->font[len]=0;
    }
    else {
      ks->font=NULL;
    }
  }
  else {
    ks->justify=0;
    ks->font=NULL;
  }

  if (((ki->bitstream_version_major<<8)|ki->bitstream_version_minor)>=0x0004) {
    /* 0.4 adds a warp for wrap mode */
    kate_read32v(kpb); /* the size of the warp */
    ks->wrap_mode=kate_read32v(kpb);
  }
  else {
    ks->wrap_mode=kate_wrap_word;
  }

  if (((ki->bitstream_version_major<<8)|ki->bitstream_version_minor)>=0x0006) {
    /* 0.6 adds a warp for metadata */
    kate_read32v(kpb); /* the size of the warp */
    ret=kate_read_metadata(kpb,&ks->meta);
    if (ret<0) return KMG_ERROR(ret);
  }
  else {
    ks->meta=NULL;
  }

  ret=kate_warp(kpb);
  if (ret<0) return KMG_ERROR(ret);

  return KMG_MERGE(parent_kmg);
}

static int kate_decode_styles_packet(kate_info *ki,kate_pack_buffer *kpb)
{
  KMG_GUARD();
  int ret,n,nstyles;
  kate_style **styles;

  if (!ki || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  nstyles=kate_read32v(kpb);
  if (nstyles<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (!ki->no_limits && nstyles>KATE_LIMIT_STYLES) return KMG_ERROR(KATE_E_LIMIT);
  styles=(kate_style**)KMG_CHECKED_MALLOC(nstyles,sizeof(kate_style*));
  if (!styles) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
  for (n=0;n<nstyles;++n) {
    styles[n]=(kate_style*)KMG_MALLOC(sizeof(kate_style));
    if (!styles[n]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
    ret=kate_decode_style(ki,styles[n],kpb,&kmg);
    if (kate_overread(kpb)) return KMG_ERROR(KATE_E_BAD_PACKET);
    if (ret<0) return KMG_ERROR(ret);
  }

  ret=kate_warp(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ret=kate_check_eop(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ki->nstyles=nstyles;
  ki->styles=styles;

  return KMG_OK();
}

static int kate_decode_curve(const kate_info *ki,kate_curve *kc,kate_pack_buffer *kpb,kate_memory_guard *parent_kmg)
{
  KMG_GUARD();
  int ret;

  if (!ki || !kc || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  kc->type=kate_pack_read(kpb,8);
  kc->npts=kate_read32v(kpb);
  ret=kate_warp(kpb);
  if (ret<0) return KMG_ERROR(ret);
  if (!ki->no_limits && kc->npts>KATE_LIMIT_CURVE_POINTS) return KMG_ERROR(KATE_E_LIMIT);
  kc->pts=(kate_float*)KMG_CHECKED_MALLOC(kc->npts,2*sizeof(kate_float));
  if (!kc->pts) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);

  ret=kate_fp_decode_kate_float(kc->npts,kc->pts,2,kpb);
  if (ret<0) return KMG_ERROR(ret);

  /* on success, add our memory to the parent guard */
  return KMG_MERGE(parent_kmg);
}

static int kate_decode_curves_packet(kate_info *ki,kate_pack_buffer *kpb)
{
  KMG_GUARD();
  int ret,n,ncurves;
  kate_curve **curves=NULL;

  if (!ki || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  ncurves=kate_read32v(kpb);
  if (ncurves<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (!ki->no_limits && ncurves>KATE_LIMIT_CURVES) return KMG_ERROR(KATE_E_LIMIT);

  if (ncurves>0) {
    curves=(kate_curve**)KMG_CHECKED_MALLOC(ncurves,sizeof(kate_curve*));
    if (!curves) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
    for (n=0;n<ncurves;++n) {
      curves[n]=(kate_curve*)KMG_MALLOC(sizeof(kate_curve));
      if (!curves[n]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
      ret=kate_decode_curve(ki,curves[n],kpb,&kmg);
      if (kate_overread(kpb)) return KMG_ERROR(KATE_E_BAD_PACKET);
      if (ret<0) return KMG_ERROR(ret);
    }
  }

  ret=kate_warp(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ret=kate_check_eop(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ki->ncurves=ncurves;
  ki->curves=curves;

  return KMG_OK();
}

static int kate_decode_motion(const kate_info *ki,kate_motion *km,kate_pack_buffer *kpb,kate_memory_guard *parent_kmg)
{
  KMG_GUARD();
  size_t n;
  int ret;

  if (!ki || !km || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  km->ncurves=kate_read32v(kpb);
  if (!ki->no_limits && km->ncurves>KATE_LIMIT_MOTION_CURVES) return KMG_ERROR(KATE_E_LIMIT);
  km->curves=(kate_curve**)KMG_CHECKED_MALLOC(km->ncurves,sizeof(kate_curve*));
  if (!km->curves) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
  km->durations=(kate_float*)KMG_CHECKED_MALLOC(km->ncurves,sizeof(kate_float));
  if (!km->durations) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);

  for (n=0;n<km->ncurves;++n) {
    if (kate_pack_read1(kpb)) {
      size_t idx=kate_read32v(kpb);
      if (idx>=ki->ncurves) return KMG_ERROR(KATE_E_BAD_PACKET);
      km->curves[n]=ki->curves[idx];
    }
    else {
      km->curves[n]=(kate_curve*)KMG_MALLOC(sizeof(kate_curve));
      if (!km->curves[n]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
      ret=kate_decode_curve(ki,km->curves[n],kpb,&kmg);
      if (kate_overread(kpb)) return KMG_ERROR(KATE_E_BAD_PACKET);
      if (ret<0) return KMG_ERROR(ret);
    }
  }
  ret=kate_fp_decode_kate_float(km->ncurves,km->durations,1,kpb);
  if (ret<0) return KMG_ERROR(ret);
  km->x_mapping=kate_pack_read(kpb,8);
  km->y_mapping=kate_pack_read(kpb,8);
  km->semantics=kate_pack_read(kpb,8);
  km->periodic=kate_pack_read1(kpb);

  if (((ki->bitstream_version_major<<8)|ki->bitstream_version_minor)>=0x0006) {
    /* 0.6 adds a warp for metadata */
    kate_read32v(kpb); /* the size of the warp */
    ret=kate_read_metadata(kpb,&km->meta);
    if (ret<0) return KMG_ERROR(ret);
  }
  else {
    km->meta=NULL;
  }

  ret=kate_warp(kpb);
  if (ret<0) return KMG_ERROR(ret);

  return KMG_MERGE(parent_kmg);
}

static int kate_decode_motions_packet(kate_info *ki,kate_pack_buffer *kpb)
{
  KMG_GUARD();
  int ret,n,nmotions;
  kate_motion **motions=NULL;

  if (!ki || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  nmotions=kate_read32v(kpb);
  if (nmotions<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (!ki->no_limits && nmotions>KATE_LIMIT_MOTIONS) return KMG_ERROR(KATE_E_LIMIT);

  if (nmotions>0) {
    motions=(kate_motion**)KMG_CHECKED_MALLOC(nmotions,sizeof(kate_motion*));
    if (!motions) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
    for (n=0;n<nmotions;++n) {
      motions[n]=(kate_motion*)KMG_MALLOC(sizeof(kate_motion));
      if (!motions[n]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
      ret=kate_decode_motion(ki,motions[n],kpb,&kmg);
      if (kate_overread(kpb)) return KMG_ERROR(KATE_E_BAD_PACKET);
      if (ret<0) return KMG_ERROR(ret);
    }
  }

  ret=kate_warp(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ret=kate_check_eop(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ki->nmotions=nmotions;
  ki->motions=motions;

  return KMG_OK();
}

static int kate_decode_palette(const kate_info *ki,kate_palette *kp,kate_pack_buffer *kpb)
{
  kate_color *colors;
  size_t n;
  int ret;

  if (!ki || !kp || !kpb) return KATE_E_INVALID_PARAMETER;

  kp->ncolors=kate_pack_read(kpb,8)+1;

  colors=(kate_color*)kate_checked_malloc(kp->ncolors,sizeof(kate_color));
  if (!colors) return KATE_E_OUT_OF_MEMORY;

  for (n=0;n<kp->ncolors;++n) {
    ret=kate_decode_color(colors+n,kpb);
    if (kate_overread(kpb)) {
      kate_free(colors);
      return ret;
    }
    if (ret<0) {
      kate_free(colors);
      return ret;
    }
  }

  if (((ki->bitstream_version_major<<8)|ki->bitstream_version_minor)>=0x0006) {
    /* 0.6 adds a warp for metadata */
    kate_read32v(kpb); /* the size of the warp */
    ret=kate_read_metadata(kpb,&kp->meta);
    if (ret<0) return ret;
  }
  else {
    kp->meta=NULL;
  }

  ret=kate_warp(kpb);
  if (ret<0) return ret;

  kp->colors=colors;

  return 0;
}

static int kate_decode_palettes_packet(kate_info *ki,kate_pack_buffer *kpb)
{
  KMG_GUARD();
  int ret,n,npalettes;
  kate_palette **palettes=NULL;

  if (!ki || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  npalettes=kate_read32v(kpb);
  if (npalettes<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (!ki->no_limits && npalettes>KATE_LIMIT_PALETTES) return KMG_ERROR(KATE_E_LIMIT);

  if (npalettes>0) {
    palettes=(kate_palette**)KMG_CHECKED_MALLOC(npalettes,sizeof(kate_palette*));
    if (!palettes) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
    for (n=0;n<npalettes;++n) {
      palettes[n]=(kate_palette*)KMG_MALLOC(sizeof(kate_palette));
      if (!palettes[n]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
      ret=kate_decode_palette(ki,palettes[n],kpb);
      if (kate_overread(kpb)) return KMG_ERROR(ret);
      if (ret<0) return KMG_ERROR(ret);
    }
  }

  ret=kate_warp(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ret=kate_check_eop(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ki->npalettes=npalettes;
  ki->palettes=palettes;

  return KMG_OK();
}

static int kate_decode_bitmap(const kate_info *ki,kate_bitmap *kb,kate_pack_buffer *kpb)
{
  size_t n,npixels;
  unsigned char *pixels;
  int ret,encoding;

  if (!ki || !kb || !kpb) return KATE_E_INVALID_PARAMETER;

  kb->width=kate_read32v(kpb);
  kb->height=kate_read32v(kpb);
  kb->bpp=kate_pack_read(kpb,8);
  if (kb->width<=0 || kb->height<=0 || kb->bpp>8) return KATE_E_BAD_PACKET;
  if (!ki->no_limits && (kb->width>KATE_LIMIT_BITMAP_SIZE || kb->height>KATE_LIMIT_BITMAP_SIZE)) return KATE_E_LIMIT;

  if (kb->bpp==0) {
    /* raw bitmap */
    kb->type=kate_pack_read(kpb,8);
    kb->palette=-1;
    switch (kb->type) {
      case kate_bitmap_type_paletted:
        encoding=kate_pack_read(kpb,8);
        switch (encoding) {
          case 1: /* RLE encoded */
            kb->bpp=kate_read32v(kpb);
            kb->palette=kate_read32v(kpb);
            pixels=(unsigned char*)kate_checked_malloc(kb->width,kb->height);
            if (!pixels) return KATE_E_OUT_OF_MEMORY;
            ret=kate_rle_decode(kb->width,kb->height,pixels,kb->bpp,kpb);
            if (ret<0) return ret;
            break;
          default:
            return KATE_E_BAD_PACKET;
        }
        break;
      case kate_bitmap_type_png:
        kb->size=kate_read32(kpb);
        if (!ki->no_limits && kb->size>KATE_LIMIT_BITMAP_RAW_SIZE) return KATE_E_LIMIT;
        pixels=(unsigned char*)kate_malloc(kb->size);
        if (!pixels) return KATE_E_OUT_OF_MEMORY;
        ret=kate_readbuf(kpb,(char*)pixels,kb->size);
        if (ret<0) {
          kate_free(pixels);
          return ret;
        }
        break;
      default:
        return KATE_E_BAD_PACKET;
    }
  }
  else {
    /* paletted bitmap */
    kb->type=kate_bitmap_type_paletted;
    kb->palette=kate_read32v(kpb);

    ret=kate_check_mul_overflow(kb->width,kb->height,&npixels);
    if (ret<0) return ret;
    pixels=(unsigned char*)kate_malloc(npixels);
    if (!pixels) return KATE_E_OUT_OF_MEMORY;
    if ((size_t)kate_pack_bits(kpb)<npixels*kb->bpp) {
      kate_free(pixels);
      return KATE_E_BAD_PACKET;
    }

    for (n=0;n<npixels;++n) {
      pixels[n]=kate_pack_read(kpb,kb->bpp);
    }
    if (kate_overread(kpb)) {
      kate_free(pixels);
      return KATE_E_BAD_PACKET;
    }
  }

  if (((ki->bitstream_version_major<<8)|ki->bitstream_version_minor)>=0x0004) {
    /* 0.4 adds a warp for x/y offset */
    kate_read32v(kpb); /* the size of the warp */
    kb->x_offset=kate_read32v(kpb);
    kb->y_offset=kate_read32v(kpb);
  }
  else {
    kb->x_offset=0;
    kb->y_offset=0;
  }

  if (((ki->bitstream_version_major<<8)|ki->bitstream_version_minor)>=0x0006) {
    /* 0.6 adds a warp for metadata */
    kate_read32v(kpb); /* the size of the warp */
    ret=kate_read_metadata(kpb,&kb->meta);
    if (ret<0) return ret;
  }
  else {
    kb->meta=NULL;
  }
  kb->internal=1;

  ret=kate_warp(kpb);
  if (ret<0) return ret;

  kb->pixels=pixels;

  return 0;
}

static int kate_decode_bitmaps_packet(kate_info *ki,kate_pack_buffer *kpb)
{
  KMG_GUARD();
  int ret,n,nbitmaps;
  kate_bitmap **bitmaps=NULL;

  if (!ki || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  nbitmaps=kate_read32v(kpb);
  if (nbitmaps<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (!ki->no_limits && nbitmaps>KATE_LIMIT_BITMAPS) return KMG_ERROR(KATE_E_LIMIT);

  if (nbitmaps>0) {
    bitmaps=(kate_bitmap**)KMG_CHECKED_MALLOC(nbitmaps,sizeof(kate_bitmap*));
    if (!bitmaps) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
    for (n=0;n<nbitmaps;++n) {
      bitmaps[n]=(kate_bitmap*)KMG_MALLOC(sizeof(kate_bitmap));
      if (!bitmaps[n]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
      ret=kate_decode_bitmap(ki,bitmaps[n],kpb);
      if (kate_overread(kpb)) return KMG_ERROR(KATE_E_BAD_PACKET);
      if (ret<0) return KMG_ERROR(ret);
    }
  }

  ret=kate_warp(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ret=kate_check_eop(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ki->nbitmaps=nbitmaps;
  ki->bitmaps=bitmaps;

  return KMG_OK();
}

static int kate_decode_font_range(const kate_info *ki,kate_font_range *kfr,kate_pack_buffer *kpb)
{
  if (!ki || !kfr || !kpb) return KATE_E_INVALID_PARAMETER;

  kfr->first_code_point=kate_read32v(kpb);
  kfr->last_code_point=kate_read32v(kpb);
  kfr->first_bitmap=kate_read32v(kpb);

  return kate_warp(kpb);
}

static int kate_decode_font_ranges_packet(kate_info *ki,kate_pack_buffer *kpb)
{
  KMG_GUARD();
  int l,n,ret;
  int nfont_ranges,nfont_mappings;
  kate_font_range **font_ranges=NULL;
  kate_font_mapping **font_mappings=NULL;

  if (!ki || !kpb) return KMG_ERROR(KATE_E_INVALID_PARAMETER);

  nfont_ranges=kate_read32v(kpb);
  if (nfont_ranges<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (!ki->no_limits && nfont_ranges>KATE_LIMIT_FONT_RANGES) return KMG_ERROR(KATE_E_LIMIT);

  if (nfont_ranges>0) {
    font_ranges=(kate_font_range**)KMG_CHECKED_MALLOC(nfont_ranges,sizeof(kate_font_range*));
    if (!font_ranges) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
    for (n=0;n<nfont_ranges;++n) {
      font_ranges[n]=(kate_font_range*)KMG_MALLOC(sizeof(kate_font_range));
      if (!font_ranges[n]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
      ret=kate_decode_font_range(ki,font_ranges[n],kpb);
      if (kate_overread(kpb)) return KMG_ERROR(KATE_E_BAD_PACKET);
      if (ret<0) return KMG_ERROR(ret);
    }
  }

  /* these may now be used by the mappings */
  ki->nfont_ranges=nfont_ranges;
  ki->font_ranges=font_ranges;

  /* now, the mappings */
  nfont_mappings=kate_read32v(kpb);
  if (nfont_mappings<0) return KMG_ERROR(KATE_E_BAD_PACKET);
  if (!ki->no_limits && nfont_mappings>KATE_LIMIT_FONT_MAPPINGS) return KMG_ERROR(KATE_E_LIMIT);

  if (nfont_mappings>0) {
    font_mappings=(kate_font_mapping**)KMG_CHECKED_MALLOC(nfont_mappings,sizeof(kate_font_mapping*));
    if (!font_mappings) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
    for (n=0;n<nfont_mappings;++n) {
      font_mappings[n]=(kate_font_mapping*)KMG_MALLOC(sizeof(kate_font_mapping));
      if (!font_mappings[n]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);

      nfont_ranges=kate_read32v(kpb);
      if (nfont_ranges<0) return KMG_ERROR(KATE_E_BAD_PACKET);
      if (!ki->no_limits && nfont_ranges>KATE_LIMIT_FONT_MAPPING_RANGES) return KMG_ERROR(KATE_E_LIMIT);

      if (nfont_ranges>0) {
        font_ranges=(kate_font_range**)KMG_CHECKED_MALLOC(nfont_ranges,sizeof(kate_font_range*));
        if (!font_ranges) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);

        for (l=0;l<nfont_ranges;++l) {
          if (kate_pack_read1(kpb)) {
            size_t idx=kate_read32v(kpb);
            if (idx>=ki->nfont_ranges) return KMG_ERROR(KATE_E_BAD_PACKET);
            font_ranges[l]=ki->font_ranges[idx];
          }
          else {
            font_ranges[l]=(kate_font_range*)KMG_MALLOC(sizeof(kate_font_range));
            if (!font_ranges[l]) return KMG_ERROR(KATE_E_OUT_OF_MEMORY);
            ret=kate_decode_font_range(ki,font_ranges[l],kpb);
            if (kate_overread(kpb)) return KMG_ERROR(KATE_E_BAD_PACKET);
            if (ret<0) return KMG_ERROR(ret);
          }
        }
        font_mappings[n]->nranges=nfont_ranges;
        font_mappings[n]->ranges=font_ranges;
      }
      else {
        font_mappings[n]->nranges=0;
        font_mappings[n]->ranges=NULL;
      }
    }
  }

  ret=kate_warp(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ret=kate_check_eop(kpb);
  if (ret<0) return KMG_ERROR(ret);

  ki->nfont_mappings=nfont_mappings;
  ki->font_mappings=font_mappings;

  return KMG_OK();
}

/**
  \ingroup decoding
  Decodes a header packet, and updates the kate_info and kate_comment structures
  from the decoded data.
  \param ki the kate_info structure to update
  \param kc the kate_comment structure to update
  \param kp the packet to decode
  \returns 0 success
  \returns 1 success, and all headers have been decoded
  \returns KATE_E_* error
  */
int kate_decode_headerin(kate_info *ki,kate_comment *kc,kate_packet *kp)
{
  kate_pack_buffer kpb;
  unsigned char headerid;
  int ret;
  int packetno;

  if (!ki || !kc || !kp) return KATE_E_INVALID_PARAMETER;

  kate_pack_readinit(&kpb,kp->data,kp->nbytes);
  headerid=kate_pack_read(&kpb,8);

  ret=kate_decode_check_magic(&kpb);
  if (ret<0) return ret;

  if (!(headerid&0x80)) return KATE_E_BAD_PACKET;
  packetno=headerid&~0x80;
  if (packetno<ki->num_headers) {
    if (ki->probe!=packetno) return KATE_E_BAD_PACKET;
  }

  /* starting with 0.1.4 (bitstream version 0.2, unchanged), there
     was a change in the interpretation of the Kate magic, at the
     request of Xiph, to limit signature length to 8 bytes. So the
     signature (from byte offset 1, after the packet type byte) is
     now only 7 bytes rather than 8, but all headers packets have
     a reserved 0 byte after the signature, so the actual bitstream
     format is left unchanged */
  if (kate_pack_read(&kpb,8)!=0) return KATE_E_BAD_PACKET;

  switch (packetno) {
    case 0: /* this is the info packet */
      ret=kate_decode_info_header(ki,&kpb);
      break;

    case 1: /* this is the comments packet */
      ret=kate_decode_comment_packet(ki,kc,&kpb);
      break;

    case 2: /* this is the region list packet */
      ret=kate_decode_regions_packet(ki,&kpb);
      break;

    case 3: /* this is the style list packet */
      ret=kate_decode_styles_packet(ki,&kpb);
      break;

    case 4: /* this is the curve list packet */
      ret=kate_decode_curves_packet(ki,&kpb);
      break;

    case 5: /* this is the motion list packet */
      ret=kate_decode_motions_packet(ki,&kpb);
      break;

    case 6: /* this is the palette list packet */
      ret=kate_decode_palettes_packet(ki,&kpb);
      break;

    case 7: /* this is the bitmap list packet */
      ret=kate_decode_bitmaps_packet(ki,&kpb);
      break;

    case 8: /* this is the font ranges list packet */
      ret=kate_decode_font_ranges_packet(ki,&kpb);
      if (ret==0) ret=1; /* we're done, we know of no more headers to come */
      break;

    default:
      /* we ignore extra header packets for future proofing */
      ret=0;
      break;
  }

  if (ret>=0) {
    /* if the header was parsed successfully, we're ready for the next one */
    ki->probe++;
  }

  return ret;
}

/**
  \ingroup decoding
  Initializes a kate_state structure for decoding using the supplied kate_info structure.
  When done, the kate_state should be cleared using kate_clear.
  \param k the kate_state to initialize for decoding
  \param ki the kate_info structure initialized from the decoded headers
  \returns 0 success
  \returns KATE_E_* error
  */
int kate_decode_init(kate_state *k,kate_info *ki)
{
  if (!k || !ki) return KATE_E_INVALID_PARAMETER;

  k->ki=ki;
  k->kes=NULL;
  k->kds=kate_decode_state_create();
  if (!k->kds) return KATE_E_OUT_OF_MEMORY;

  return 0;
}

#define READ_OVERRIDE(read) \
  do { \
    if (kate_pack_read1(kpb)) { read; } \
  } while(0)

#if 0 && defined DEBUG
#include <unistd.h>
#include <sys/types.h>
#include <time.h>
#include <stdlib.h>
#define RNDERR(label) \
  do { \
    static int seed=0; \
    if (!seed) { \
      const char *env=getenv("KATE_RAND_SEED"); \
      if (env) srand(atoi(env)); else srand(time(NULL)^getpid()); \
      seed=1; \
    } \
    if (((rand()>>8)&0xff)==0) { \
      ret=KATE_E_OUT_OF_MEMORY; \
      goto label; \
    } \
  } while(0)
#else
#define RNDERR(label) ((void)0)
#endif

static int kate_decode_text_packet(kate_state *k,kate_pack_buffer *kpb,int repeat)
{
  KMG_GUARD();
  int ret,n;
  int len;
  char *text;
  kate_decode_state *kds;
  kate_event *ev;

  if (!k || !kpb) return KATE_E_INVALID_PARAMETER;
  if (!k->kds) return KATE_E_INIT;

  ret=kate_decode_state_clear(k->kds,k->ki,1);
  if (ret<0) return ret;

  kds=k->kds;
  ev=kds->event;

  ev->start=kate_read64(kpb);
  ev->duration=kate_read64(kpb);
  ev->backlink=kate_read64(kpb);
  if (ev->start<0 || ev->duration<0) goto error_bad_packet;
  if (ev->backlink<0 || ev->backlink>ev->start) goto error_bad_packet;
  RNDERR(error_bad_packet);

  ev->start_time=kate_granule_duration(k->ki,ev->start);
  ev->end_time=ev->start_time+kate_granule_duration(k->ki,ev->duration);

  len=kate_read32(kpb);
  if (len<0) goto error_bad_packet;
  RNDERR(error_bad_packet);
  if (!k->ki->no_limits && len>KATE_LIMIT_TEXT_LENGTH) goto error_limit;
  RNDERR(error_limit);

  /* read the text, and null terminate it - 4 characters for UTF-32 */
  if (kate_check_add_overflow(len,4,NULL)) goto error_out_of_memory;
  text=(char*)KMG_MALLOC(len+4);
  if (!text) goto error_out_of_memory;
  RNDERR(error_out_of_memory);
  ret=kate_readbuf(kpb,text,len);
  if (ret<0) goto error_bad_packet;
  text[len]=0;
  text[len+1]=0;
  text[len+2]=0;
  text[len+3]=0;
  /* we can't validate the text yet, as we don't know whether there's a text encoding override later,
     so we delay validation till we've read the overrides */

  ev->text=text;
  ev->len=len;
  ev->len0=len+4;

  if (kate_pack_read1(kpb)) {
    ev->id=kate_read32v(kpb);
  }

  if (repeat && ev->id>=0) {
    /* if this is a repeat, check if we have this event already */
    ret=kate_decode_state_find_event(k->kds,ev->id);
    if (ret<0 && ret!=KATE_E_NOT_FOUND) goto error;
    if (ret>=0) goto ignore;
  }

  if (kate_pack_read1(kpb)) {
    kate_motion **motions=NULL;
    size_t nmotions=0;

    len=kate_read32v(kpb);
    if (len<=0) goto error_bad_packet; /* if the flag was set, there's at least one */
    if (!k->ki->no_limits && len>KATE_LIMIT_TEXT_MOTIONS) goto error_limit;
    RNDERR(error_limit);
    motions=(kate_motion**)KMG_CHECKED_MALLOC(len,sizeof(kate_motion*));
    if (!motions) goto error_out_of_memory;
    RNDERR(error_out_of_memory);
    nmotions=0;
    for (n=0;n<len;++n) {
      if (kate_pack_read1(kpb)) {
        size_t idx=kate_read32v(kpb);
        if (idx>=k->ki->nmotions) goto error_bad_packet;
        RNDERR(error_bad_packet);
        motions[n]=k->ki->motions[idx];
      }
      else {
        motions[n]=KMG_MALLOC(sizeof(kate_motion));
        if (!motions[n]) goto error_out_of_memory;
        RNDERR(error_out_of_memory);
        ret=kate_decode_motion(k->ki,motions[n],kpb,&kmg);
        if (kate_overread(kpb)) goto error_bad_packet;
        if (ret<0) goto error;
        RNDERR(error);
      }
      ++nmotions;
    }

    ev->motions=motions;
    ev->nmotions=nmotions;
  }

  if (kate_pack_read1(kpb)) {
    READ_OVERRIDE(ev->text_encoding=kate_pack_read(kpb,8));
    READ_OVERRIDE(ev->text_directionality=kate_pack_read(kpb,8));
    READ_OVERRIDE(
      do {
        len=kate_read32v(kpb);
        if (len<0) goto error_bad_packet;
        RNDERR(error_bad_packet);
        if (!k->ki->no_limits && len>KATE_LIMIT_LANGUAGE_LENGTH) goto error_limit;
        RNDERR(error_limit);
        if (len>0) {
          ev->language=(char*)KMG_MALLOC(len+1);
          if (!ev->language) goto error_out_of_memory;
        RNDERR(error_out_of_memory);
          ret=kate_readbuf(kpb,ev->language,len);
          if (ret<0) goto error_bad_packet;
          ev->language[len]=0;
        }
      } while(0)
    );
    READ_OVERRIDE(
      size_t idx=kate_read32v(kpb);
      if (idx>=k->ki->nregions) goto error_bad_packet;
      RNDERR(error_bad_packet);
      ev->region=k->ki->regions[idx];
    );
    READ_OVERRIDE(
      ev->region=KMG_MALLOC(sizeof(kate_region));
      if (!ev->region) goto error_out_of_memory;
      RNDERR(error_out_of_memory);
      ret=kate_decode_region(k->ki,ev->region,kpb);
      if (ret<0) goto error;
    );
    READ_OVERRIDE(
      size_t idx=kate_read32v(kpb);
      if (idx>=k->ki->nstyles) goto error_bad_packet;
      RNDERR(error_bad_packet);
      ev->style=k->ki->styles[idx]
    );
    READ_OVERRIDE(
      ev->style=KMG_MALLOC(sizeof(kate_style));
      if (!ev->style) goto error_out_of_memory;
      RNDERR(error_out_of_memory);
      ret=kate_decode_style(k->ki,ev->style,kpb,&kmg);
      if (ret<0) goto error;
    );
    READ_OVERRIDE(
      size_t idx=kate_read32v(kpb);
      if (idx>=k->ki->nstyles) goto error_bad_packet;
      RNDERR(error_bad_packet);
      ev->secondary_style=k->ki->styles[idx]
    );
    READ_OVERRIDE(
      ev->secondary_style=KMG_MALLOC(sizeof(kate_style));
      if (!ev->secondary_style) goto error_out_of_memory;
      RNDERR(error_out_of_memory);
      ret=kate_decode_style(k->ki,ev->secondary_style,kpb,&kmg);
      if (ret<0) goto error;
      RNDERR(error);
    );
    READ_OVERRIDE(
      size_t idx=kate_read32v(kpb);
      if (idx>=k->ki->nfont_mappings) goto error_bad_packet;
      RNDERR(error_bad_packet);
      ev->font_mapping=k->ki->font_mappings[idx]
    );
  }

  if (((k->ki->bitstream_version_major<<8)|k->ki->bitstream_version_minor)>=0x0002) {
    /* 0.2 adds a warp for palette, bitmap, markup type */
    kate_read32v(kpb); /* the size of the warp */
    if (kate_pack_read1(kpb)) {
      READ_OVERRIDE(
        size_t idx=kate_read32v(kpb);
        if (idx>=k->ki->npalettes) goto error_bad_packet;
        RNDERR(error_bad_packet);
        ev->palette=k->ki->palettes[idx];
      );
      READ_OVERRIDE(
        ev->palette=KMG_MALLOC(sizeof(kate_palette));
        if (!ev->palette) goto error_out_of_memory;
        ret=kate_decode_palette(k->ki,ev->palette,kpb);
        if (ret<0) goto error;
        RNDERR(error);
      );
      READ_OVERRIDE(
        size_t idx=kate_read32v(kpb);
        if (idx>=k->ki->nbitmaps) goto error_bad_packet;
        ev->bitmap=k->ki->bitmaps[idx];
      );
      READ_OVERRIDE(
        ev->bitmap=KMG_MALLOC(sizeof(kate_bitmap));
        if (!ev->bitmap) goto error_out_of_memory;
        RNDERR(error_out_of_memory);
        ret=kate_decode_bitmap(k->ki,ev->bitmap,kpb);
        if (ret<0) goto error;
        RNDERR(error);
      );
      READ_OVERRIDE(ev->text_markup_type=kate_pack_read(kpb,8));
    }
  }

  if (((k->ki->bitstream_version_major<<8)|k->ki->bitstream_version_minor)>=0x0004) {
    /* 0.4 adds a warp for bitmaps */
    kate_bitmap **bitmaps=NULL;
    size_t nbitmaps=0;

    kate_read32v(kpb); /* the size of the warp */

    len=kate_read32v(kpb);
    if (len<0) goto error_bad_packet;
    RNDERR(error_bad_packet);
    if (len>0) {
      if (!k->ki->no_limits && len>KATE_LIMIT_BITMAPS) goto error_limit;
      bitmaps=(kate_bitmap**)KMG_CHECKED_MALLOC(len,sizeof(kate_bitmap*));
      if (!bitmaps) goto error_out_of_memory;
      RNDERR(error_out_of_memory);
      nbitmaps=0;
      for (n=0;n<len;++n) {
        if (kate_pack_read1(kpb)) {
          size_t idx=kate_read32v(kpb);
          if (idx>=k->ki->nbitmaps) goto error_bad_packet;
          RNDERR(error_bad_packet);
          bitmaps[n]=k->ki->bitmaps[idx];
        }
        else {
          bitmaps[n]=KMG_MALLOC(sizeof(kate_bitmap));
          if (!bitmaps[n]) goto error_out_of_memory;
          RNDERR(error_out_of_memory);
          ret=kate_decode_bitmap(k->ki,bitmaps[n],kpb);
          if (kate_overread(kpb)) goto error_bad_packet;
          if (ret<0) goto error;
        }
        ++nbitmaps;
      }
    }

    ev->bitmaps=bitmaps;
    ev->nbitmaps=nbitmaps;
  }
  else {
    ev->bitmaps=NULL;
    ev->nbitmaps=0;
  }

  if (((k->ki->bitstream_version_major<<8)|k->ki->bitstream_version_minor)>=0x0006) {
    /* 0.6 adds a warp for metadata */
    kate_read32v(kpb); /* the size of the warp */

    ret=kate_read_metadata(kpb,&ev->meta);
    if (ret<0) goto error;
  }

  ret=kate_warp(kpb);
  if (ret<0) goto error;
  RNDERR(error);

  /* validate text, and reject invalid encodings */
  ret=kate_text_validate(ev->text_encoding,ev->text,ev->len0);
  RNDERR(error);
  if (ret<0) goto error;

  if (ev->text_markup_type!=kate_markup_none && k->ki->remove_markup) {
    size_t zero_size=ev->len0-ev->len;
    ret=kate_text_remove_markup(ev->text_encoding,ev->text,&ev->len0);
    if (ret<0) goto error;
    if (ev->len0<zero_size) goto error_bad_packet; /* can't happen, but let's be safe */
    ev->len=ev->len0-zero_size;
    RNDERR(error);
    ev->text_markup_type=kate_markup_none;
  }

  /* if no style, use the region (if any) default style */
  if (!ev->style && ev->region) {
    if (ev->region->style>=0) {
      size_t idx=ev->region->style;
      if (idx<k->ki->nstyles) {
        ev->style=k->ki->styles[idx];
      }
    }
  }

  if (ev->id>=0) {
    /* register the event as active */
    ret=kate_decode_state_add_event(k->kds,ev);
    RNDERR(error);
    if (ret<0) goto error;
  }

  ret=kate_decode_state_flush_events(k->kds,ev->start);
  RNDERR(error);
  if (ret<0) goto error;

  return KMG_OK();

error_limit:
  ret=KATE_E_LIMIT;
  goto error;

error_bad_packet:
  ret=KATE_E_BAD_PACKET;
  goto error;

error_out_of_memory:
  ret=KATE_E_OUT_OF_MEMORY;
  goto error;

ignore:
  /* special case where we need to destroy the event as we're not interested in it,
     but we do not want an error to be raised */
  ret=0;
  goto error;

error:
  /* all the memory allocated for the event should be freed by the kate_memory_guard,
     so we just unlink and jettison it */
  kate_free(kds->event);
  kds->event=NULL;
  return KMG_ERROR(ret);
}

static int kate_decode_repeat_packet(kate_state *k,kate_pack_buffer *kpb)
{
  return kate_decode_text_packet(k,kpb,1);
}

static int kate_decode_keepalive_packet(kate_state *k,kate_pack_buffer *kpb)
{
  if (!k || !kpb) return KATE_E_INVALID_PARAMETER;
  if (!k->kds) return KATE_E_INIT;

  return 0;
}

static int kate_decode_end_packet(kate_state *k,kate_pack_buffer *kpb)
{
  if (!k || !kpb) return KATE_E_INVALID_PARAMETER;
  if (!k->kds) return KATE_E_INIT;

  return 1;
}

/**
  \ingroup decoding
  Decodes a data packet.
  \param k the kate_state to decode to
  \param kp the packet to decode
  \returns 0 success
  \returns 1 success, and we're at end of stream
  \returns KATE_E_* error
  */
int kate_decode_packetin(kate_state *k,kate_packet *kp)
{
  kate_pack_buffer kpb;
  int ret,id;

  if (!k || !kp) return KATE_E_INVALID_PARAMETER;
  if (!k->ki) return KATE_E_INIT;
  if (!k->kds) return KATE_E_INIT;

  ret=kate_decode_state_clear(k->kds,k->ki,0);
  if (ret<0) return ret;

  kate_pack_readinit(&kpb,kp->data,kp->nbytes);
  id=kate_pack_read(&kpb,8);
  if (id&0x80) {
    /* we have a header - we'll ignore it
       it may have happened either because we seeked to the beginning of the stream
       or because we're parsing a stream that has more headers than we know about */
    return 0;
  }

  switch (id) {
    case 0x00: return kate_decode_text_packet(k,&kpb,0);
    case 0x01: return kate_decode_keepalive_packet(k,&kpb);
    case 0x02: return kate_decode_repeat_packet(k,&kpb);
    case 0x7f: return kate_decode_end_packet(k,&kpb);
    default: return 0; /* unknown data packets are ignored, for future proofing */
  }

  return 0;
}

/**
  \ingroup decoding
  Requests a pointer to the event decoded by the last packet, if there is one.
  \param k the kate_state to get the event from
  \param event a pointer to where to place the pointer to the event, if any
  \returns 0 success, an event was returned
  \returns 1 success, but there was no event to return
  \returns KATE_E_* error
  */
int kate_decode_eventout(kate_state *k,kate_const kate_event **event)
{
  if (!k) return KATE_E_INVALID_PARAMETER;
  if (!k->kds) return KATE_E_INIT;

  if (!k->kds->event) return 1;

  if (event) *event=k->kds->event;

  return 0;
}

/**
  \ingroup decoding
  Informs the Kate decoder that seeking has occured.
  This will cause the decoder to use any future repeat packets to recover
  data from past events which are still active, but which original packets
  were before the seek point, and therefore unavailable.
  \param k the kate_state for which a seek occured
  \returns 0 success
  \returns KATE_E_* error
  */
int kate_decode_seek(kate_state *k)
{
  if (!k) return KATE_E_INVALID_PARAMETER;
  if (!k->kds) return KATE_E_INIT;

  return kate_decode_state_flush_events(k->kds,-1);
}


Coverage Report

Created: 2026-09-01 07:42