tools/dtdesc/c_iff/endchunk.c

   1 /*
   2  *  c_iff - a portable IFF-parser
   3  *
   4  *  Copyright (C) 2000, 2001 Joerg Dietrich
   5  *
   6  *  This is the AROS-version of c_iff.
   7  *  It is distributed under the AROS Public License.
   8  *  But I reserve the right to distribute
   9  *  my own version under other licenses.
  10  */
  11
  12 /*
  13  *  endchunk.c - finish writing a chunk
  14  */
  15
  16 #include "c_iff.h"
  17
  18 /****** c_iff/EndChunk ******************************************************
  19 *
  20 *   NAME
  21 *       EndChunk -- Finish writing a chunk
  22 *
  23 *   SYNOPSIS
  24 *       EndChunk( TheHandle )
  25 *
  26 *       void EndChunk( struct IFFHandle * )
  27 *
  28 *   FUNCTION
  29 *       Finishes the actual chunk startet with NewChunk() .
  30 *       Mainly this means writing the chunksize.
  31 *
  32 *   INPUTS
  33 *       TheHandle   - the IFFHandle to write to
  34 *
  35 *   RESULT
  36 *
  37 *   EXAMPLE
  38 *
  39 *   NOTES
  40 *
  41 *   BUGS
  42 *
  43 *   SEE ALSO
  44 *       NewChunk()
  45 *
  46 *****************************************************************************
  47 *
  48 *       Private notes:
  49 */
  50
  51 void EndChunk(struct IFFHandle *TheHandle)
  52 {
  53  uint32_t Buffer;
  54  long CurPos;
  55  struct ChunkNode *CN, *PN;
  56
  57  if(!TheHandle)
  58  {
  59   return;
  60  }
  61
  62  CN=TheHandle->LastNode;
  63  if(!CN)
  64  {
  65   return;
  66  }
  67
  68  Buffer=CN->Size;
  69  Buffer=Swap32IfLE(Buffer);
  70
  71  CurPos=ftell(TheHandle->TheFile);
  72  if(CurPos<0)
  73  {
  74   return;
  75  }
  76
  77  if(fseek(TheHandle->TheFile, TheHandle->LastNode->FilePos, SEEK_SET))
  78  {
  79   return;
  80  }
  81
  82  if(!(fwrite((void *) &Buffer, sizeof(uint32_t), 1, TheHandle->TheFile)==1))
  83  {
  84   return;
  85  }
  86
  87  if(fseek(TheHandle->TheFile, CurPos, SEEK_SET))
  88  {
  89   return;
  90  }
  91
  92  if(CN->Size&0x1)
  93  {
  94   if(!(fwrite("\0", 1, 1, TheHandle->TheFile)==1))
  95   {
  96    return;
  97   }
  98
  99   PN=CN->Previous;
 100
 101   while(PN)
 102   {
 103    PN->Size++;
 104
 105    PN=PN->Previous;
 106   }
 107
 108   TheHandle->IFFSize++;
 109  }
 110
 111  TheHandle->LastNode=CN->Previous;
 112  free((void *) CN);
 113 }
 114
 115