X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=lzindex%2Fbasics.c;fp=lzindex%2Fbasics.c;h=4e67ff31e9daadbbdfd75f3a91b313fa0efb063d;hb=5d74bc076c9d15d607d183c16ff8468ea961a0f9;hp=0000000000000000000000000000000000000000;hpb=5d47d1754b1df68fc1843989c3992df52025dfa4;p=SXSI%2FTextCollection.git

diff --git a/lzindex/basics.c b/lzindex/basics.c
new file mode 100644
index 0000000..4e67ff3
--- /dev/null
+++ b/lzindex/basics.c
@@ -0,0 +1,177 @@
+
+// Basics
+
+// #include "basics.h" included later to avoid macro recursion for malloc
+#include <sys/types.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+uint nbits_aux1, *e_aux1, p_aux1;
+uint nbits_aux2, *e_aux2, p_aux2;
+uint nbits_aux3, *e_aux3, p_aux3;
+
+	// Memory management
+
+#ifdef MEMCTRL
+int account = 1;
+int currmem = 0;
+int newmem;
+int maxmem = 0;
+#endif
+
+void *Malloc (int n)
+
+   { void *p;
+     if (n == 0) return NULL;
+#ifndef MEMCTRL
+     p = (void*) malloc (n);
+#else
+     p = (void*) (malloc (n+sizeof(int))+sizeof(int));
+#endif
+     if (p == NULL)
+        { fprintf (stderr,"Could not allocate %i bytes\n",n);
+          exit(1);
+        }
+#ifdef MEMCTRL
+     *(((int*)p)-1) = n;
+     if (account)
+        { newmem = currmem+n;
+          if (newmem > maxmem) maxmem = newmem;
+          if (currmem/1024 != newmem/1024)
+             printf ("Memory: %i Kb, maximum: %i Kb\n",newmem/1024,maxmem/1024);
+          currmem = newmem;
+	}
+#endif
+     return p;
+   }
+
+void Free (void *p)
+
+   { 
+#ifndef MEMCTRL
+     if (p) free (p);
+#else
+     if (!p) return;
+     if (account)
+        { newmem = currmem - *(((int*)p)-1);
+          free ((void*)(((int)p)-sizeof(int)));
+          if (currmem/1024 != newmem/1024)
+             printf ("Memory: %i Kb, maximum: %i Kb\n",newmem/1024,maxmem/1024);
+          currmem = newmem;
+	}
+#endif
+   }
+
+void *Realloc (void *p, int n)
+
+   { if (p == NULL) return Malloc (n);
+     if (n == 0) { Free(p); return NULL; }
+#ifndef MEMCTRL
+     p = (void*) realloc (p,n);
+#else
+     if (account)
+        newmem = currmem - *(((int*)p)-1);
+     p = (void*) (realloc ((void*)(((int)p)-sizeof(int)),n+sizeof(int))+sizeof(int));
+     *(((int*)p)-1) = n;
+#endif
+     if (p == NULL)
+        { fprintf (stderr,"Could not allocate %i bytes\n",n);
+          exit(1);
+        }
+#ifdef MEMCTRL
+     if (account)
+        { newmem = newmem + n;
+          if (newmem > maxmem) maxmem = newmem;
+          if (currmem/1024 != newmem/1024)
+             printf ("Memory: %i Kb, maximum: %i Kb\n",newmem/1024,maxmem/1024);
+          currmem = newmem;
+	}
+#endif
+     return p;
+   }
+
+#include "basics.h"
+
+        // bits needed to represent a number between 0 and n
+
+uint bits (uint n)
+
+   { uint b = 0;
+     while (n)
+	{ b++; n >>= 1; }
+     return b;
+   }
+
+
+uint bitget_aux1()
+ {
+     register uint i=(p_aux1>>5), j=p_aux1&0x1F, answ;
+     if (j+nbits_aux1 <= W)
+        answ = (e_aux1[i] << (W-j-nbits_aux1)) >> (W-nbits_aux1);
+     else {
+        answ = e_aux1[i] >> j;
+        answ = answ | ((e_aux1[i+1] << (W-j-nbits_aux1)) >> (W-nbits_aux1));
+     }
+     return answ;
+ }
+/* 
+uint bitget_aux2()
+ {
+     register uint i=(p_aux2>>5), j=p_aux2&0x1F, answ;
+     if (j+nbits_aux2 <= W)
+        answ = (e_aux2[i] << (W-j-nbits_aux2)) >> (W-nbits_aux2);
+     else {
+        answ = e_aux2[i] >> j;
+        answ = answ | ((e_aux2[i+1] << (W-j-nbits_aux2)) >> (W-nbits_aux2));
+     }
+     return answ;
+ }
+
+uint bitget_aux3()
+ {
+     register uint i=(p_aux3>>5), j=p_aux3&0x1F, answ;
+     if (j+nbits_aux3 <= W)
+        answ = (e_aux3[i] << (W-j-nbits_aux3)) >> (W-nbits_aux3);
+     else {
+        answ = e_aux3[i] >> j;
+        answ = answ | ((e_aux3[i+1] << (W-j-nbits_aux3)) >> (W-nbits_aux3));
+     }
+     return answ;
+ }*/
+
+
+        // returns e[p..p+len-1], assuming len <= W
+
+uint bitget (uint *e, uint p, uint len)
+ {
+    register uint i=(p>>5), j=p&0x1F, answ;
+    if (j+len <= W)
+       answ = (e[i] << (W-j-len)) >> (W-len);
+    else {
+       answ = e[i] >> j;
+       answ = answ | ((e[i+1] << (W-j-len)) >> (W-len));
+    }
+    return answ;
+ }
+
+  	// writes e[p..p+len-1] = s, len <= W
+
+void bitput (register uint *e, register uint p, 
+	     register uint len, register uint s)
+
+   { e += p >> bitsW; p &= (1<<bitsW)-1;
+     if (len == W)
+	  { *e |= (*e & ((1<<p)-1)) | (s << p);
+            if (!p) return;
+            e++;
+            *e = (*e & ~((1<<p)-1)) | (s >> (W-p));
+	  }
+     else { if (p+len <= W)
+	       { *e = (*e & ~(((1<<len)-1)<<p)) | (s << p);
+		 return;
+	       }
+	    *e = (*e & ((1<<p)-1)) | (s << p);
+            e++; len -= W-p;
+            *e = (*e & ~((1<<len)-1)) | (s >> (W-p));
+	  }
+   }