Mercurial > projects > ldc
view tango/lib/compiler/llvmdc/typeinfo/ti_Along.d @ 203:e881c9b1c738 trunk
[svn r219] Fixed: the tango/lib/gc/basic garbage collector now compiles and links into an executable (change in tango/lib/llvmdc-posix.mak), closes #5 .
Changed: removed the crappy realloc based dynamic memory runtime and started moving over to DMD style runtime support, part of moving to real GC.
Fixed: dynamic arrays now use GC runtime for allocating memory.
Fixed: new expression now use GC for allocating memory.
Changed: revamped the dynamic array support routines related to dynamic memory.
Fixed: assertions no longer create exsessive allocas.
Changed: misc. minor cleanups.
author | lindquist |
---|---|
date | Tue, 13 May 2008 14:42:09 +0200 |
parents | 1700239cab2e |
children | 7816aafeea3c |
line wrap: on
line source
module typeinfo.ti_Along; private import tango.stdc.string; // long[] class TypeInfo_Al : TypeInfo { char[] toString() { return "long[]"; } hash_t getHash(void *p) { long[] s = *cast(long[]*)p; size_t len = s.length; auto str = s.ptr; hash_t hash = 0; while (len) { hash *= 9; hash += *cast(uint *)str + *(cast(uint *)str + 1); str++; len--; } return hash; } int equals(void *p1, void *p2) { long[] s1 = *cast(long[]*)p1; long[] s2 = *cast(long[]*)p2; return s1.length == s2.length && memcmp(cast(void *)s1, cast(void *)s2, s1.length * long.sizeof) == 0; } int compare(void *p1, void *p2) { long[] s1 = *cast(long[]*)p1; long[] s2 = *cast(long[]*)p2; size_t len = s1.length; if (s2.length < len) len = s2.length; for (size_t u = 0; u < len; u++) { if (s1[u] < s2[u]) return -1; else if (s1[u] > s2[u]) return 1; } if (s1.length < s2.length) return -1; else if (s1.length > s2.length) return 1; return 0; } size_t tsize() { return (long[]).sizeof; } uint flags() { return 1; } TypeInfo next() { return typeid(long); } } // ulong[] class TypeInfo_Am : TypeInfo_Al { char[] toString() { return "ulong[]"; } int compare(void *p1, void *p2) { ulong[] s1 = *cast(ulong[]*)p1; ulong[] s2 = *cast(ulong[]*)p2; size_t len = s1.length; if (s2.length < len) len = s2.length; for (size_t u = 0; u < len; u++) { if (s1[u] < s2[u]) return -1; else if (s1[u] > s2[u]) return 1; } if (s1.length < s2.length) return -1; else if (s1.length > s2.length) return 1; return 0; } TypeInfo next() { return typeid(ulong); } }