-/* Cycript - Remove Execution Server and Disassembler
- * Copyright (C) 2009 Jay Freeman (saurik)
+/* Cycript - Optimizing JavaScript Compiler/Runtime
+ * Copyright (C) 2009-2015 Jay Freeman (saurik)
*/
-/* Modified BSD License {{{ */
+/* GNU Affero General Public License, Version 3 {{{ */
/*
- * Redistribution and use in source and binary
- * forms, with or without modification, are permitted
- * provided that the following conditions are met:
- *
- * 1. Redistributions of source code must retain the
- * above copyright notice, this list of conditions
- * and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the
- * above copyright notice, this list of conditions
- * and the following disclaimer in the documentation
- * and/or other materials provided with the
- * distribution.
- * 3. The name of the author may not be used to endorse
- * or promote products derived from this software
- * without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS''
- * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING,
- * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
- * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE
- * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
- * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
- * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
- * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
- * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
- * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
- * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-*/
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU Affero General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+
+ * This program 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 Affero General Public License for more details.
+
+ * You should have received a copy of the GNU Affero General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+**/
/* }}} */
-#include "minimal/stdlib.h"
+#include "Error.hpp"
#include "sig/ffi_type.hpp"
#include "sig/types.hpp"
namespace sig {
-void sig_ffi_types(
- apr_pool_t *pool,
- ffi_type *(*sig_ffi_type)(apr_pool_t *, struct Type *),
- struct Signature *signature,
- ffi_type **types,
- size_t skip = 0,
- size_t offset = 0
-) {
- _assert(signature->count >= skip);
- for (size_t index = skip; index != signature->count; ++index)
- types[index - skip + offset] = (*sig_ffi_type)(pool, signature->elements[index].type);
-}
-
-ffi_type *ObjectiveC(apr_pool_t *pool, struct Type *type) {
- switch (type->primitive) {
- case typename_P: return &ffi_type_pointer;
-
- case union_P:
- /* XXX: we can totally make this work */
- _assert(false);
- break;
-
- case string_P: return &ffi_type_pointer;
- case selector_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_ulonglong;
- case ushort_P: return &ffi_type_ushort;
-
- 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 bit_P:
- /* XXX: we can totally make this work */
- _assert(false);
- break;
-
- case char_P: return &ffi_type_schar;
- 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_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))));
- aggregate->size = 0;
- aggregate->alignment = 0;
- aggregate->type = FFI_TYPE_STRUCT;
-
- aggregate->elements = reinterpret_cast<ffi_type **>(apr_palloc(pool, (type->data.signature.count + 1) * sizeof(ffi_type *)));
- sig_ffi_types(pool, &ObjectiveC, &type->data.signature, aggregate->elements);
- aggregate->elements[type->data.signature.count] = NULL;
-
- return aggregate;
- } break;
-
- default:
- _assert(false);
- break;
- }
+template <>
+ffi_type *Primitive<bool>::GetFFI(CYPool &pool) const {
+ return &ffi_type_uchar;
+}
+
+template <>
+ffi_type *Primitive<char>::GetFFI(CYPool &pool) const {
+ return &ffi_type_schar;
+}
+
+template <>
+ffi_type *Primitive<float>::GetFFI(CYPool &pool) const {
+ return &ffi_type_float;
+}
+
+template <>
+ffi_type *Primitive<double>::GetFFI(CYPool &pool) const {
+ return &ffi_type_double;
+}
+
+template <>
+ffi_type *Primitive<signed char>::GetFFI(CYPool &pool) const {
+ return &ffi_type_schar;
+}
+
+template <>
+ffi_type *Primitive<signed int>::GetFFI(CYPool &pool) const {
+ return &ffi_type_sint;
+}
+
+template <>
+ffi_type *Primitive<signed long int>::GetFFI(CYPool &pool) const {
+ return &ffi_type_slong;
+}
+
+template <>
+ffi_type *Primitive<signed long long int>::GetFFI(CYPool &pool) const {
+ return &ffi_type_slonglong;
+}
+
+template <>
+ffi_type *Primitive<signed short int>::GetFFI(CYPool &pool) const {
+ return &ffi_type_sshort;
+}
+
+template <>
+ffi_type *Primitive<unsigned char>::GetFFI(CYPool &pool) const {
+ return &ffi_type_uchar;
+}
+
+template <>
+ffi_type *Primitive<unsigned int>::GetFFI(CYPool &pool) const {
+ return &ffi_type_uint;
+}
+
+template <>
+ffi_type *Primitive<unsigned long int>::GetFFI(CYPool &pool) const {
+ return &ffi_type_ulong;
+}
+
+template <>
+ffi_type *Primitive<unsigned long long int>::GetFFI(CYPool &pool) const {
+ return &ffi_type_ulonglong;
+}
+
+template <>
+ffi_type *Primitive<unsigned short int>::GetFFI(CYPool &pool) const {
+ return &ffi_type_ushort;
+}
+
+ffi_type *Void::GetFFI(CYPool &pool) const {
+ return &ffi_type_void;
+}
+
+ffi_type *Unknown::GetFFI(CYPool &pool) const {
+ _assert(false);
+}
+
+ffi_type *String::GetFFI(CYPool &pool) const {
+ return &ffi_type_pointer;
}
-ffi_type *Java(apr_pool_t *pool, struct Type *type) {
- switch (type->primitive) {
- case typename_P: return &ffi_type_pointer;
- case union_P: return &ffi_type_pointer;
- case string_P: return &ffi_type_pointer;
- case selector_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_ulonglong;
- case ushort_P: return &ffi_type_ushort;
- case array_P: return &ffi_type_pointer;
- case pointer_P: return &ffi_type_pointer;
-
- /* XXX: bit type */
- case bit_P: return &ffi_type_uint;
-
- case char_P: return &ffi_type_schar;
- 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_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;
-
- default:
- _assert(false);
- break;
+ffi_type *Meta::GetFFI(CYPool &pool) const {
+ return &ffi_type_pointer;
+}
+
+ffi_type *Selector::GetFFI(CYPool &pool) const {
+ return &ffi_type_pointer;
+}
+
+ffi_type *Bits::GetFFI(CYPool &pool) const {
+ /* XXX: we can totally make this work */
+ _assert(false);
+}
+
+ffi_type *Pointer::GetFFI(CYPool &pool) const {
+ return &ffi_type_pointer;
+}
+
+ffi_type *Array::GetFFI(CYPool &pool) const {
+ // XXX: this is really lame
+ ffi_type *ffi(new(pool) ffi_type());
+ ffi->size = 0;
+ ffi->alignment = 0;
+ ffi->type = FFI_TYPE_STRUCT;
+
+ ffi_type *element(type.GetFFI(pool));
+
+ ffi->elements = new(pool) ffi_type *[size + 1];
+ for (size_t i(0); i != size; ++i)
+ ffi->elements[i] = element;
+ ffi->elements[size] = NULL;
+
+ return ffi;
+}
+
+ffi_type *Object::GetFFI(CYPool &pool) const {
+ return &ffi_type_pointer;
+}
+
+ffi_type *Aggregate::GetFFI(CYPool &pool) const {
+ // XXX: we can totally make overlap work
+ _assert(!overlap);
+
+ ffi_type *ffi(new(pool) ffi_type());
+ ffi->size = 0;
+ ffi->alignment = 0;
+ ffi->type = FFI_TYPE_STRUCT;
+
+ if (signature.count == 0) {
+ // https://gcc.gnu.org/ml/gcc-patches/2015-01/msg01286.html
+ ffi->elements = new(pool) ffi_type *[2];
+ ffi->elements[0] = &ffi_type_void;
+ ffi->elements[1] = NULL;
+ } else {
+ ffi->elements = new(pool) ffi_type *[signature.count + 1];
+ for (size_t index(0); index != signature.count; ++index)
+ ffi->elements[index] = signature.elements[index].type->GetFFI(pool);
+ ffi->elements[signature.count] = NULL;
}
+
+ return ffi;
+}
+
+ffi_type *Function::GetFFI(CYPool &pool) const {
+ _assert(false);
+}
+
+ffi_type *Block::GetFFI(CYPool &pool) const {
+ return &ffi_type_pointer;
}
-void sig_ffi_cif(
- apr_pool_t *pool,
- ffi_type *(*sig_ffi_type)(apr_pool_t *, struct Type *),
- struct Signature *signature,
- ffi_cif *cif,
- size_t skip,
- ffi_type **types,
- size_t offset
-) {
- if (types == NULL)
- types = reinterpret_cast<ffi_type **>(apr_palloc(pool, (signature->count - 1) * sizeof(ffi_type *)));
- ffi_type *type = (*sig_ffi_type)(pool, signature->elements[0].type);
- sig_ffi_types(pool, sig_ffi_type, signature, types, 1 + skip, offset);
- ffi_status status = ffi_prep_cif(cif, FFI_DEFAULT_ABI, signature->count - 1 - skip + offset, type, types);
+void sig_ffi_cif(CYPool &pool, size_t variadic, const Signature &signature, ffi_cif *cif) {
+ _assert(signature.count != 0);
+ size_t count(signature.count - 1);
+ ffi_type *type(signature.elements[0].type->GetFFI(pool));
+
+ ffi_type **types(new(pool) ffi_type *[count]);
+ for (size_t index(0); index != count; ++index)
+ types[index] = signature.elements[index + 1].type->GetFFI(pool);
+
+ ffi_status status;
+#ifdef HAVE_FFI_PREP_CIF_VAR
+ if (variadic == 0)
+#endif
+ status = ffi_prep_cif(cif, FFI_DEFAULT_ABI, count, type, types);
+#ifdef HAVE_FFI_PREP_CIF_VAR
+ else
+ status = ffi_prep_cif_var(cif, FFI_DEFAULT_ABI, variadic - 1, count, type, types);
+#endif
_assert(status == FFI_OK);
}
projects / cycript.git / blobdiff