X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;f=lib%2Ffb-mem.c;h=2b0d7e941fa6cf1c9e0e408efe02a3a184bb67d8;hb=a0de81cbe1f6282fdc13f6e61d07ebf0ae1c0f4c;hp=0f3158c379dbc9e7ae666c35d90e0d91c6bdfb32;hpb=cf83e06e4158617e981fef5bf3878315b23bf7f9;p=libucw.git

diff --git a/lib/fb-mem.c b/lib/fb-mem.c
index 0f3158c3..2b0d7e94 100644
--- a/lib/fb-mem.c
+++ b/lib/fb-mem.c
@@ -110,7 +110,7 @@ fbmem_seek(struct fastbuf *f, sh_off_t pos, int whence)
   /* Yes, this is linear. But considering the average number of buckets, it doesn't matter. */
   for (b=m->first; b; b=b->next)
     {
-      if (pos <= b->pos + b->size) /* <=, because we need to be able to seek just after file end */
+      if (pos <= b->pos + (sh_off_t)b->size) /* <=, because we need to be able to seek just after file end */
 	{
 	  f->buffer = b->data;
 	  f->bptr = b->data + (pos - b->pos);