]> git.saurik.com Git - cycript.git/blob - sig/copy.cpp
Evil magic juju FTW!
[cycript.git] / sig / copy.cpp
1 /* Cycript - Inlining/Optimizing JavaScript Compiler
2 * Copyright (C) 2009 Jay Freeman (saurik)
3 */
4
5 /* Modified BSD License {{{ */
6 /*
7 * Redistribution and use in source and binary
8 * forms, with or without modification, are permitted
9 * provided that the following conditions are met:
10 *
11 * 1. Redistributions of source code must retain the
12 * above copyright notice, this list of conditions
13 * and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the
15 * above copyright notice, this list of conditions
16 * and the following disclaimer in the documentation
17 * and/or other materials provided with the
18 * distribution.
19 * 3. The name of the author may not be used to endorse
20 * or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS''
24 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING,
25 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
26 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
29 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
30 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
31 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
34 * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
35 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
36 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 */
38 /* }}} */
39
40 #ifndef _GNU_SOURCE
41 #define _GNU_SOURCE
42 #endif
43
44 #include <apr_strings.h>
45 #include "Pooling.hpp"
46 #include "sig/parse.hpp"
47
48 #ifdef HAVE_FFI_FFI_H
49 #include <ffi/ffi.h>
50 #else
51 #include <ffi.h>
52 #endif
53
54 namespace sig {
55
56 void Copy(apr_pool_t *pool, Element &lhs, Element &rhs) {
57 lhs.name = apr_pstrdup(pool, rhs.name);
58 if (rhs.type == NULL)
59 lhs.type = NULL;
60 else {
61 lhs.type = new(pool) Type;
62 Copy(pool, *lhs.type, *rhs.type);
63 }
64 lhs.offset = rhs.offset;
65 }
66
67 void Copy(apr_pool_t *pool, Signature &lhs, Signature &rhs) {
68 size_t count(rhs.count);
69 lhs.count = count;
70 lhs.elements = new(pool) Element[count];
71 for (size_t index(0); index != count; ++index)
72 Copy(pool, lhs.elements[index], rhs.elements[index]);
73 }
74
75 void Copy(apr_pool_t *pool, Type &lhs, Type &rhs) {
76 lhs.primitive = rhs.primitive;
77 lhs.name = apr_pstrdup(pool, rhs.name);
78 lhs.flags = rhs.flags;
79
80 if (sig::IsAggregate(rhs.primitive))
81 Copy(pool, lhs.data.signature, rhs.data.signature);
82 else {
83 sig::Type *&lht(lhs.data.data.type);
84 sig::Type *&rht(rhs.data.data.type);
85
86 if (rht == NULL)
87 lht = NULL;
88 else {
89 lht = new(pool) Type;
90 Copy(pool, *lht, *rht);
91 }
92
93 lhs.data.data.size = rhs.data.data.size;
94 }
95 }
96
97 void Copy(apr_pool_t *pool, ffi_type &lhs, ffi_type &rhs) {
98 lhs.size = rhs.size;
99 lhs.alignment = rhs.alignment;
100 lhs.type = rhs.type;
101 if (rhs.elements == NULL)
102 lhs.elements = NULL;
103 else {
104 size_t count(0);
105 while (rhs.elements[count] != NULL)
106 ++count;
107
108 lhs.elements = new(pool) ffi_type *[count + 1];
109 lhs.elements[count] = NULL;
110
111 for (size_t index(0); index != count; ++index) {
112 // XXX: if these are libffi native then you can just take them
113 ffi_type *ffi(new(pool) ffi_type);
114 lhs.elements[index] = ffi;
115 sig::Copy(pool, *ffi, *rhs.elements[index]);
116 }
117 }
118 }
119
120 }