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 #include <ffi.h>
  48
  49 namespace sig {
  50
  51 void Copy(apr_pool_t *pool, Element &lhs, Element &rhs) {
  52     lhs.name = apr_pstrdup(pool, rhs.name);
  53     if (rhs.type == NULL)
  54         lhs.type = NULL;
  55     else {
  56         lhs.type = new(pool) Type;
  57         Copy(pool, *lhs.type, *rhs.type);
  58     }
  59     lhs.offset = rhs.offset;
  60 }
  61
  62 void Copy(apr_pool_t *pool, Signature &lhs, Signature &rhs) {
  63     size_t count(rhs.count);
  64     lhs.count = count;
  65     lhs.elements = new(pool) Element[count];
  66     for (size_t index(0); index != count; ++index)
  67         Copy(pool, lhs.elements[index], rhs.elements[index]);
  68 }
  69
  70 void Copy(apr_pool_t *pool, Type &lhs, Type &rhs) {
  71     lhs.primitive = rhs.primitive;
  72     lhs.name = apr_pstrdup(pool, rhs.name);
  73     lhs.flags = rhs.flags;
  74
  75     if (sig::IsAggregate(rhs.primitive))
  76         Copy(pool, lhs.data.signature, rhs.data.signature);
  77     else {
  78         sig::Type *&lht(lhs.data.data.type);
  79         sig::Type *&rht(rhs.data.data.type);
  80
  81         if (rht == NULL)
  82             lht = NULL;
  83         else {
  84             lht = new(pool) Type;
  85             Copy(pool, *lht, *rht);
  86         }
  87
  88         lhs.data.data.size = rhs.data.data.size;
  89     }
  90 }
  91
  92 void Copy(apr_pool_t *pool, ffi_type &lhs, ffi_type &rhs) {
  93     lhs.size = rhs.size;
  94     lhs.alignment = rhs.alignment;
  95     lhs.type = rhs.type;
  96     if (rhs.elements == NULL)
  97         lhs.elements = NULL;
  98     else {
  99         size_t count(0);
 100         while (rhs.elements[count] != NULL)
 101             ++count;
 102
 103         lhs.elements = new(pool) ffi_type *[count + 1];
 104         lhs.elements[count] = NULL;
 105
 106         for (size_t index(0); index != count; ++index) {
 107             // XXX: if these are libffi native then you can just take them
 108             ffi_type *ffi(new(pool) ffi_type);
 109             lhs.elements[index] = ffi;
 110             sig::Copy(pool, *ffi, *rhs.elements[index]);
 111         }
 112     }
 113 }
 114
 115 }