Mercurial > projects > ldc
view lphobos/typeinfo2/ti_Areal.d @ 1064:f0b6549055ab
Make LDC work with LLVM trunk (s/LinkOnceLinkage/LinkOnceOdrLinkage/)
Also moved the #defines for linkage types into a separate header instead of
mars.h so we can #include revisions.h without having to rebuild the entire
frontend every time we update.
(I'm using revisions.h to get the LLVM revision for use in preprocessor
conditionals. It should work with LLVM release 2.5, old trunk and new trunk)
author | Frits van Bommel <fvbommel wxs.nl> |
---|---|
date | Sun, 08 Mar 2009 16:13:10 +0100 |
parents | b86e00b938a5 |
children |
line wrap: on
line source
/* * Copyright (C) 2004-2006 by Digital Mars, www.digitalmars.com * Written by Walter Bright * * This software is provided 'as-is', without any express or implied * warranty. In no event will the authors be held liable for any damages * arising from the use of this software. * * Permission is granted to anyone to use this software for any purpose, * including commercial applications, and to alter it and redistribute it * freely, in both source and binary form, subject to the following * restrictions: * * o The origin of this software must not be misrepresented; you must not * claim that you wrote the original software. If you use this software * in a product, an acknowledgment in the product documentation would be * appreciated but is not required. * o Altered source versions must be plainly marked as such, and must not * be misrepresented as being the original software. * o This notice may not be removed or altered from any source * distribution. */ module typeinfo2.ti_Areal; private import typeinfo1.ti_real; // real[] class TypeInfo_Ae : TypeInfo { char[] toString() { return "real[]"; } hash_t getHash(void *p) { real[] s = *cast(real[]*)p; size_t len = s.length; auto str = s.ptr; hash_t hash = 0; while (len) { hash *= 9; hash += (cast(uint *)str)[0]; hash += (cast(uint *)str)[1]; hash += (cast(ushort *)str)[4]; str++; len--; } return hash; } int equals(void *p1, void *p2) { real[] s1 = *cast(real[]*)p1; real[] s2 = *cast(real[]*)p2; size_t len = s1.length; if (len != s2.length) return 0; for (size_t u = 0; u < len; u++) { int c = TypeInfo_e._equals(s1[u], s2[u]); if (c == 0) return 0; } return 1; } int compare(void *p1, void *p2) { real[] s1 = *cast(real[]*)p1; real[] s2 = *cast(real[]*)p2; size_t len = s1.length; if (s2.length < len) len = s2.length; for (size_t u = 0; u < len; u++) { int c = TypeInfo_e._compare(s1[u], s2[u]); if (c) return c; } return cast(int)s1.length - cast(int)s2.length; } size_t tsize() { return (real[]).sizeof; } uint flags() { return 1; } TypeInfo next() { return typeid(real); } } // ireal[] class TypeInfo_Aj : TypeInfo_Ae { char[] toString() { return "ireal[]"; } TypeInfo next() { return typeid(ireal); } }