-#include "minimal/stdlib.h"
+/* Cycript - Optimizing JavaScript Compiler/Runtime
+ * Copyright (C) 2009-2010 Jay Freeman (saurik)
+*/
+
+/* GNU Lesser General Public License, Version 3 {{{ */
+/*
+ * Cycript is free software: you can redistribute it and/or modify it under
+ * the terms of the GNU Lesser General Public License as published by the
+ * Free Software Foundation, either version 3 of the License, or (at your
+ * option) any later version.
+ *
+ * Cycript is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
+ * License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with Cycript. If not, see <http://www.gnu.org/licenses/>.
+**/
+/* }}} */
+
+#include "Error.hpp"
#include "sig/ffi_type.hpp"
#include "sig/types.hpp"
+#define ffi_type_slonglong ffi_type_sint64
+#define ffi_type_ulonglong ffi_type_uint64
+
namespace sig {
void sig_ffi_types(
case string_P: return &ffi_type_pointer;
case selector_P: return &ffi_type_pointer;
+ case block_P: return &ffi_type_pointer;
case object_P: return &ffi_type_pointer;
case boolean_P: return &ffi_type_uchar;
case uchar_P: return &ffi_type_uchar;
case uint_P: return &ffi_type_uint;
case ulong_P: return &ffi_type_ulong;
- case ulonglong_P: return &ffi_type_ulong;
+ case ulonglong_P: return &ffi_type_ulonglong;
case ushort_P: return &ffi_type_ushort;
- case array_P:
- /* XXX: implement */
- _assert(false);
- break;
+ case array_P: {
+ // XXX: this is really lame
+ ffi_type *aggregate(reinterpret_cast<ffi_type *>(apr_palloc(pool, sizeof(ffi_type))));
+ aggregate->size = 0;
+ aggregate->alignment = 0;
+ aggregate->type = FFI_TYPE_STRUCT;
+
+ ffi_type *element(ObjectiveC(pool, type->data.data.type));
+ size_t size(type->data.data.size);
+
+ aggregate->elements = reinterpret_cast<ffi_type **>(apr_palloc(pool, (size + 1) * sizeof(ffi_type *)));
+ for (size_t i(0); i != size; ++i)
+ aggregate->elements[i] = element;
+ aggregate->elements[size] = NULL;
+
+ return aggregate;
+ } break;
case pointer_P: return &ffi_type_pointer;
case double_P: return &ffi_type_double;
case float_P: return &ffi_type_float;
case int_P: return &ffi_type_sint;
- case long_P: return &ffi_type_sint;
- case longlong_P: return &ffi_type_slong;
+ case long_P: return &ffi_type_slong;
+ case longlong_P: return &ffi_type_slonglong;
case short_P: return &ffi_type_sshort;
case void_P: return &ffi_type_void;
case struct_P: {
- ffi_type *aggregate = reinterpret_cast<ffi_type *>(apr_palloc(pool, sizeof(ffi_type)));
+ ffi_type *aggregate(reinterpret_cast<ffi_type *>(apr_palloc(pool, sizeof(ffi_type))));
aggregate->size = 0;
aggregate->alignment = 0;
aggregate->type = FFI_TYPE_STRUCT;
case union_P: return &ffi_type_pointer;
case string_P: return &ffi_type_pointer;
case selector_P: return &ffi_type_pointer;
+ case block_P: return &ffi_type_pointer;
case object_P: return &ffi_type_pointer;
case boolean_P: return &ffi_type_uchar;
case uchar_P: return &ffi_type_uchar;
case uint_P: return &ffi_type_uint;
case ulong_P: return &ffi_type_ulong;
- case ulonglong_P: return &ffi_type_ulong;
+ case ulonglong_P: return &ffi_type_ulonglong;
case ushort_P: return &ffi_type_ushort;
case array_P: return &ffi_type_pointer;
case pointer_P: return &ffi_type_pointer;
case double_P: return &ffi_type_double;
case float_P: return &ffi_type_double;
case int_P: return &ffi_type_sint;
- case long_P: return &ffi_type_sint;
- case longlong_P: return &ffi_type_slong;
+ case long_P: return &ffi_type_slong;
+ case longlong_P: return &ffi_type_slonglong;
case short_P: return &ffi_type_sshort;
case void_P: return &ffi_type_void;
case struct_P: return &ffi_type_pointer;