Mercurial > projects > ldc
view tango/lib/compiler/llvmdc/typeinfo/ti_Ag.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_Ag; private import tango.stdc.string; private import util.string; // byte[] class TypeInfo_Ag : TypeInfo { char[] toString() { return "byte[]"; } hash_t getHash(void *p) { byte[] s = *cast(byte[]*)p; size_t len = s.length; byte *str = s.ptr; hash_t hash = 0; while (1) { switch (len) { case 0: return hash; case 1: hash *= 9; hash += *cast(ubyte *)str; return hash; case 2: hash *= 9; hash += *cast(ushort *)str; return hash; case 3: hash *= 9; hash += (*cast(ushort *)str << 8) + (cast(ubyte *)str)[2]; return hash; default: hash *= 9; hash += *cast(uint *)str; str += 4; len -= 4; break; } } return hash; } int equals(void *p1, void *p2) { byte[] s1 = *cast(byte[]*)p1; byte[] s2 = *cast(byte[]*)p2; return s1.length == s2.length && memcmp(cast(byte *)s1, cast(byte *)s2, s1.length) == 0; } int compare(void *p1, void *p2) { byte[] s1 = *cast(byte[]*)p1; byte[] s2 = *cast(byte[]*)p2; size_t len = s1.length; if (s2.length < len) len = s2.length; for (size_t u = 0; u < len; u++) { int result = s1[u] - s2[u]; if (result) return result; } if (s1.length < s2.length) return -1; else if (s1.length > s2.length) return 1; return 0; } size_t tsize() { return (byte[]).sizeof; } uint flags() { return 1; } TypeInfo next() { return typeid(byte); } } // ubyte[] class TypeInfo_Ah : TypeInfo_Ag { char[] toString() { return "ubyte[]"; } int compare(void *p1, void *p2) { char[] s1 = *cast(char[]*)p1; char[] s2 = *cast(char[]*)p2; return stringCompare(s1, s2); } TypeInfo next() { return typeid(ubyte); } } // void[] class TypeInfo_Av : TypeInfo_Ah { char[] toString() { return "void[]"; } TypeInfo next() { return typeid(void); } } // bool[] class TypeInfo_Ab : TypeInfo_Ah { char[] toString() { return "bool[]"; } TypeInfo next() { return typeid(bool); } } // char[] class TypeInfo_Aa : TypeInfo_Ag { char[] toString() { return "char[]"; } hash_t getHash(void *p) { char[] s = *cast(char[]*)p; hash_t hash = 0; version (all) { foreach (char c; s) hash = hash * 11 + c; } else { size_t len = s.length; char *str = s; while (1) { switch (len) { case 0: return hash; case 1: hash *= 9; hash += *cast(ubyte *)str; return hash; case 2: hash *= 9; hash += *cast(ushort *)str; return hash; case 3: hash *= 9; hash += (*cast(ushort *)str << 8) + (cast(ubyte *)str)[2]; return hash; default: hash *= 9; hash += *cast(uint *)str; str += 4; len -= 4; break; } } } return hash; } TypeInfo next() { return typeid(char); } }