Mercurial > projects > ldc
view runtime/internal/typeinfo/ti_Aint.d @ 1605:1d5721f9ae18
[WIP] Merge DMD r251: bugzilla 111 (appending a dchar to a char[])
This patch needs some work in the code generation, because of the runtime
changes (functions "_d_arrayappendcd" and "_d_arrayappendwd" are added).
This doesn't affect existing code though, it just makes with patch
a little useless, because something like this:
char [] s;
s ~= '\u6211';
That failed to compile with a nice error message previously to this
change, now fails with and ugly error message (a failed assertion).
Apparently there is a regression introduced by this patch too, when
compiling Dil I get this assertion message:
ldc: /home/luca/tesis/ldc/gen/statements.cpp:132: virtual void ReturnStatement::toIR(IRState*): Assertion `p->topfunc()->getReturnType() == llvm::Type::getVoidTy(gIR->context())' failed.
0 ldc 0x08a91628
Thank god we have bisecting capabilities in VCSs now ;)
---
dmd/expression.c | 47 +++++++++++++++++++++++++++++++++++++++++------
1 files changed, 41 insertions(+), 6 deletions(-)
author | Leandro Lucarella <llucax@gmail.com> |
---|---|
date | Wed, 06 Jan 2010 15:18:19 -0300 |
parents | 44f08170f4ef |
children |
line wrap: on
line source
module typeinfo.ti_Aint; private import tango.stdc.string; // int[] class TypeInfo_Ai : TypeInfo_Array { char[] toString() { return "int[]"; } hash_t getHash(void *p) { int[] s = *cast(int[]*)p; auto len = s.length; auto str = s.ptr; hash_t hash = 0; while (len) { hash *= 9; hash += *cast(uint *)str; str++; len--; } return hash; } int equals(void *p1, void *p2) { int[] s1 = *cast(int[]*)p1; int[] s2 = *cast(int[]*)p2; return s1.length == s2.length && memcmp(cast(void *)s1, cast(void *)s2, s1.length * int.sizeof) == 0; } int compare(void *p1, void *p2) { int[] s1 = *cast(int[]*)p1; int[] s2 = *cast(int[]*)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 (int[]).sizeof; } uint flags() { return 1; } TypeInfo next() { return typeid(int); } } // uint[] class TypeInfo_Ak : TypeInfo_Ai { char[] toString() { return "uint[]"; } int compare(void *p1, void *p2) { uint[] s1 = *cast(uint[]*)p1; uint[] s2 = *cast(uint[]*)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; } TypeInfo next() { return typeid(uint); } } // dchar[] class TypeInfo_Aw : TypeInfo_Ak { char[] toString() { return "dchar[]"; } TypeInfo next() { return typeid(dchar); } }