Code changes to get the code to compile under GCC....

courgette/third_party/bsdiff_create.cc

 /*
   bsdiff.c -- Binary patch generator.
 
   Copyright 2003 Colin Percival
 
   For the terms under which this work may be distributed, please see
   the adjoining file "LICENSE".
 
   ChangeLog:
   2005-05-05 - Use the modified header struct from bspatch.h; use 32-bit
@@ skipping 214 matching lines @@
             << (base::Time::Now() - q_start_time).InSecondsF();
   V.reset();
 
   const uint8* newbuf = new_stream->Buffer();
   const int newsize = new_stream->Remaining();
 
   int control_length = 0;
   int diff_bytes_length = 0;
   int diff_bytes_nonzero = 0;
   int extra_bytes_length = 0;
-  int eblen = 0;
 
   // The patch format is a sequence of triples <copy,extra,seek> where 'copy' is
   // the number of bytes to copy from the old file (possibly with mistakes),
   // 'extra' is the number of bytes to copy from a stream of fresh bytes, and
   // 'seek' is an offset to move to the position to copy for the next triple.
   //
   // The invariant at the top of this loop is that we are committed to emitting
   // a triple for the part of |newbuf| surrounding a 'seed' match near
   // |lastscan|.  We are searching for a second match that will be the 'seed' of
   // the next triple.  As we scan through |newbuf|, one of four things can
@@ skipping 176 matching lines @@
   LOG(INFO) << "Uncompressed bsdiff patch size "
             << patch_stream->Length() - initial_patch_stream_length;
 
   LOG(INFO) << "End bsdiff "
             << (base::Time::Now() - start_bsdiff_time).InSecondsF();
 
   return OK;
 }
 
 }  // namespace