ffi 0.6.3-x86-mingw32 → 1.0.1-x86-mingw32
Sign up to get free protection for your applications and to get access to all the features.
Potentially problematic release.
This version of ffi might be problematic. Click here for more details.
- data/History.txt +7 -0
- data/LICENSE +10 -21
- data/README.rdoc +1 -0
- data/Rakefile +4 -2
- data/ext/ffi_c/AbstractMemory.c +103 -38
- data/ext/ffi_c/AbstractMemory.h +15 -22
- data/ext/ffi_c/Buffer.c +61 -22
- data/ext/ffi_c/Call.c +52 -540
- data/ext/ffi_c/Call.h +1 -1
- data/ext/ffi_c/DataConverter.c +62 -0
- data/ext/ffi_c/DynamicLibrary.c +21 -1
- data/ext/ffi_c/Function.c +315 -30
- data/ext/ffi_c/MappedType.c +146 -0
- data/ext/ffi_c/MappedType.h +57 -0
- data/ext/ffi_c/MemoryPointer.c +12 -33
- data/ext/ffi_c/Platform.c +2 -0
- data/ext/ffi_c/Pointer.c +66 -28
- data/ext/ffi_c/Struct.c +19 -306
- data/ext/ffi_c/Struct.h +6 -0
- data/ext/ffi_c/StructByReference.c +150 -0
- data/ext/ffi_c/StructByReference.h +50 -0
- data/ext/ffi_c/StructLayout.c +25 -14
- data/ext/ffi_c/Type.c +39 -68
- data/ext/ffi_c/Type.h +12 -22
- data/ext/ffi_c/Types.c +20 -5
- data/ext/ffi_c/Types.h +7 -7
- data/ext/ffi_c/Variadic.c +21 -17
- data/ext/ffi_c/extconf.rb +4 -0
- data/ext/ffi_c/ffi.c +8 -2
- data/ext/ffi_c/rbffi.h +1 -0
- data/lib/ffi/autopointer.rb +23 -22
- data/lib/ffi/enum.rb +36 -21
- data/lib/ffi/errno.rb +20 -0
- data/lib/ffi/ffi.rb +13 -80
- data/lib/ffi/io.rb +12 -20
- data/lib/ffi/library.rb +109 -92
- data/lib/ffi/managedstruct.rb +1 -1
- data/lib/ffi/memorypointer.rb +15 -21
- data/lib/ffi/platform.rb +24 -28
- data/lib/ffi/pointer.rb +14 -21
- data/lib/ffi/struct.rb +98 -49
- data/lib/ffi/struct_layout_builder.rb +158 -0
- data/lib/ffi/types.rb +99 -128
- data/lib/ffi/union.rb +20 -0
- data/lib/ffi/variadic.rb +33 -22
- data/lib/ffi_c.so +0 -0
- data/spec/ffi/async_callback_spec.rb +23 -0
- data/spec/ffi/callback_spec.rb +62 -0
- data/spec/ffi/custom_param_type.rb +31 -0
- data/spec/ffi/custom_type_spec.rb +73 -0
- data/spec/ffi/enum_spec.rb +19 -0
- data/spec/ffi/ffi_spec.rb +24 -0
- data/spec/ffi/pointer_spec.rb +15 -0
- data/spec/ffi/rbx/memory_pointer_spec.rb +7 -1
- data/spec/ffi/strptr_spec.rb +36 -0
- data/spec/ffi/struct_packed_spec.rb +46 -0
- data/spec/ffi/struct_spec.rb +19 -5
- data/spec/ffi/typedef_spec.rb +14 -0
- data/tasks/setup.rb +2 -1
- metadata +15 -6
- data/ext/ffi_c/AutoPointer.c +0 -60
- data/ext/ffi_c/AutoPointer.h +0 -18
- data/lib/1.8/ffi_c.so +0 -0
- data/lib/1.9/ffi_c.so +0 -0
@@ -0,0 +1,146 @@
|
|
1
|
+
/*
|
2
|
+
* Copyright (c) 2010, Wayne Meissner
|
3
|
+
* All rights reserved.
|
4
|
+
*
|
5
|
+
* Redistribution and use in source and binary forms, with or without
|
6
|
+
* modification, are permitted provided that the following conditions are met:
|
7
|
+
*
|
8
|
+
* * Redistributions of source code must retain the above copyright notice, this
|
9
|
+
* list of conditions and the following disclaimer.
|
10
|
+
* * Redistributions in binary form must reproduce the above copyright notice
|
11
|
+
* this list of conditions and the following disclaimer in the documentation
|
12
|
+
* and/or other materials provided with the distribution.
|
13
|
+
* * The name of the author or authors may not be used to endorse or promote
|
14
|
+
* products derived from this software without specific prior written permission.
|
15
|
+
*
|
16
|
+
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
17
|
+
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
18
|
+
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
19
|
+
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
|
20
|
+
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
21
|
+
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
22
|
+
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
23
|
+
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
24
|
+
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
25
|
+
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
26
|
+
*/
|
27
|
+
|
28
|
+
#include <ruby.h>
|
29
|
+
|
30
|
+
#include <ffi.h>
|
31
|
+
#include "rbffi.h"
|
32
|
+
|
33
|
+
#include "Type.h"
|
34
|
+
#include "MappedType.h"
|
35
|
+
|
36
|
+
|
37
|
+
static VALUE mapped_allocate(VALUE);
|
38
|
+
static VALUE mapped_initialize(VALUE, VALUE);
|
39
|
+
static void mapped_mark(MappedType *);
|
40
|
+
static ID id_native_type, id_to_native, id_from_native;
|
41
|
+
|
42
|
+
VALUE rbffi_MappedTypeClass = Qnil;
|
43
|
+
|
44
|
+
static VALUE
|
45
|
+
mapped_allocate(VALUE klass)
|
46
|
+
{
|
47
|
+
MappedType* m;
|
48
|
+
|
49
|
+
VALUE obj = Data_Make_Struct(klass, MappedType, mapped_mark, -1, m);
|
50
|
+
|
51
|
+
m->rbConverter = Qnil;
|
52
|
+
m->rbType = Qnil;
|
53
|
+
m->type = NULL;
|
54
|
+
m->base.nativeType = NATIVE_MAPPED;
|
55
|
+
m->base.ffiType = &ffi_type_void;
|
56
|
+
|
57
|
+
return obj;
|
58
|
+
}
|
59
|
+
|
60
|
+
static VALUE
|
61
|
+
mapped_initialize(VALUE self, VALUE rbConverter)
|
62
|
+
{
|
63
|
+
MappedType* m = NULL;
|
64
|
+
Type* t = NULL;
|
65
|
+
|
66
|
+
if (!rb_respond_to(rbConverter, id_native_type)) {
|
67
|
+
rb_raise(rb_eNoMethodError, "native_type method not implemented");
|
68
|
+
}
|
69
|
+
|
70
|
+
if (!rb_respond_to(rbConverter, id_to_native)) {
|
71
|
+
rb_raise(rb_eNoMethodError, "to_native method not implemented");
|
72
|
+
}
|
73
|
+
|
74
|
+
if (!rb_respond_to(rbConverter, id_from_native)) {
|
75
|
+
rb_raise(rb_eNoMethodError, "from_native method not implemented");
|
76
|
+
}
|
77
|
+
|
78
|
+
Data_Get_Struct(self, MappedType, m);
|
79
|
+
m->rbType = rb_funcall2(rbConverter, id_native_type, 0, NULL);
|
80
|
+
if (!(rb_obj_is_kind_of(m->rbType, rbffi_TypeClass))) {
|
81
|
+
rb_raise(rb_eTypeError, "native_type did not return instance of FFI::Type");
|
82
|
+
}
|
83
|
+
|
84
|
+
m->rbConverter = rbConverter;
|
85
|
+
Data_Get_Struct(m->rbType, Type, m->type);
|
86
|
+
m->base.ffiType = m->type->ffiType;
|
87
|
+
|
88
|
+
return self;
|
89
|
+
}
|
90
|
+
|
91
|
+
static void
|
92
|
+
mapped_mark(MappedType* m)
|
93
|
+
{
|
94
|
+
rb_gc_mark(m->rbType);
|
95
|
+
rb_gc_mark(m->rbConverter);
|
96
|
+
}
|
97
|
+
|
98
|
+
static VALUE
|
99
|
+
mapped_native_type(VALUE self)
|
100
|
+
{
|
101
|
+
MappedType*m = NULL;
|
102
|
+
Data_Get_Struct(self, MappedType, m);
|
103
|
+
|
104
|
+
return m->rbType;
|
105
|
+
}
|
106
|
+
|
107
|
+
static VALUE
|
108
|
+
mapped_to_native(int argc, VALUE* argv, VALUE self)
|
109
|
+
{
|
110
|
+
MappedType*m = NULL;
|
111
|
+
|
112
|
+
Data_Get_Struct(self, MappedType, m);
|
113
|
+
|
114
|
+
return rb_funcall2(m->rbConverter, id_to_native, argc, argv);
|
115
|
+
}
|
116
|
+
|
117
|
+
static VALUE
|
118
|
+
mapped_from_native(int argc, VALUE* argv, VALUE self)
|
119
|
+
{
|
120
|
+
MappedType*m = NULL;
|
121
|
+
|
122
|
+
Data_Get_Struct(self, MappedType, m);
|
123
|
+
|
124
|
+
return rb_funcall2(m->rbConverter, id_from_native, argc, argv);
|
125
|
+
}
|
126
|
+
|
127
|
+
void
|
128
|
+
rbffi_MappedType_Init(VALUE moduleFFI)
|
129
|
+
{
|
130
|
+
|
131
|
+
rbffi_MappedTypeClass = rb_define_class_under(rbffi_TypeClass, "Mapped", rbffi_TypeClass);
|
132
|
+
|
133
|
+
rb_global_variable(&rbffi_MappedTypeClass);
|
134
|
+
|
135
|
+
id_native_type = rb_intern("native_type");
|
136
|
+
id_to_native = rb_intern("to_native");
|
137
|
+
id_from_native = rb_intern("from_native");
|
138
|
+
|
139
|
+
rb_define_alloc_func(rbffi_MappedTypeClass, mapped_allocate);
|
140
|
+
rb_define_method(rbffi_MappedTypeClass, "initialize", mapped_initialize, 1);
|
141
|
+
rb_define_method(rbffi_MappedTypeClass, "type", mapped_native_type, 0);
|
142
|
+
rb_define_method(rbffi_MappedTypeClass, "native_type", mapped_native_type, 0);
|
143
|
+
rb_define_method(rbffi_MappedTypeClass, "to_native", mapped_to_native, -1);
|
144
|
+
rb_define_method(rbffi_MappedTypeClass, "from_native", mapped_from_native, -1);
|
145
|
+
}
|
146
|
+
|
@@ -0,0 +1,57 @@
|
|
1
|
+
/*
|
2
|
+
* Copyright (c) 2010, Wayne Meissner
|
3
|
+
* All rights reserved.
|
4
|
+
*
|
5
|
+
* Redistribution and use in source and binary forms, with or without
|
6
|
+
* modification, are permitted provided that the following conditions are met:
|
7
|
+
*
|
8
|
+
* * Redistributions of source code must retain the above copyright notice, this
|
9
|
+
* list of conditions and the following disclaimer.
|
10
|
+
* * Redistributions in binary form must reproduce the above copyright notice
|
11
|
+
* this list of conditions and the following disclaimer in the documentation
|
12
|
+
* and/or other materials provided with the distribution.
|
13
|
+
* * The name of the author or authors may not be used to endorse or promote
|
14
|
+
* products derived from this software without specific prior written permission.
|
15
|
+
*
|
16
|
+
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
17
|
+
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
18
|
+
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
19
|
+
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
|
20
|
+
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
21
|
+
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
22
|
+
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
23
|
+
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
24
|
+
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
25
|
+
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
26
|
+
*/
|
27
|
+
|
28
|
+
#ifndef RBFFI_MAPPEDTYPE_H
|
29
|
+
#define RBFFI_MAPPEDTYPE_H
|
30
|
+
|
31
|
+
|
32
|
+
#include <ruby.h>
|
33
|
+
|
34
|
+
#ifdef __cplusplus
|
35
|
+
extern "C" {
|
36
|
+
#endif
|
37
|
+
|
38
|
+
|
39
|
+
typedef struct MappedType_ {
|
40
|
+
Type base;
|
41
|
+
Type* type;
|
42
|
+
VALUE rbConverter;
|
43
|
+
VALUE rbType;
|
44
|
+
|
45
|
+
} MappedType;
|
46
|
+
|
47
|
+
void rbffi_MappedType_Init(VALUE moduleFFI);
|
48
|
+
|
49
|
+
extern VALUE rbffi_MappedTypeClass;
|
50
|
+
|
51
|
+
|
52
|
+
#ifdef __cplusplus
|
53
|
+
}
|
54
|
+
#endif
|
55
|
+
|
56
|
+
#endif /* RBFFI_MAPPEDTYPE_H */
|
57
|
+
|
data/ext/ffi_c/MemoryPointer.c
CHANGED
@@ -4,27 +4,19 @@
|
|
4
4
|
*
|
5
5
|
* All rights reserved.
|
6
6
|
*
|
7
|
-
*
|
8
|
-
* modification, are permitted provided that the following conditions are met:
|
7
|
+
* This file is part of ruby-ffi.
|
9
8
|
*
|
10
|
-
*
|
11
|
-
*
|
12
|
-
*
|
13
|
-
* this list of conditions and the following disclaimer in the documentation
|
14
|
-
* and/or other materials provided with the distribution.
|
15
|
-
* * The name of the author or authors may not be used to endorse or promote
|
16
|
-
* products derived from this software without specific prior written permission.
|
9
|
+
* This code is free software: you can redistribute it and/or modify it under
|
10
|
+
* the terms of the GNU Lesser General Public License version 3 only, as
|
11
|
+
* published by the Free Software Foundation.
|
17
12
|
*
|
18
|
-
*
|
19
|
-
*
|
20
|
-
*
|
21
|
-
*
|
22
|
-
*
|
23
|
-
*
|
24
|
-
*
|
25
|
-
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
26
|
-
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
27
|
-
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
13
|
+
* This code is distributed in the hope that it will be useful, but WITHOUT
|
14
|
+
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
15
|
+
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License
|
16
|
+
* version 3 for more details.
|
17
|
+
*
|
18
|
+
* You should have received a copy of the GNU Lesser General Public License
|
19
|
+
* version 3 along with this work. If not, see <http://www.gnu.org/licenses/>.
|
28
20
|
*/
|
29
21
|
|
30
22
|
#include <stdbool.h>
|
@@ -63,7 +55,7 @@ memptr_allocate(VALUE klass)
|
|
63
55
|
{
|
64
56
|
MemoryPointer* p;
|
65
57
|
VALUE obj = Data_Make_Struct(klass, MemoryPointer, NULL, memptr_release, p);
|
66
|
-
p->memory.
|
58
|
+
p->memory.flags = MEM_RD | MEM_WR;
|
67
59
|
|
68
60
|
return obj;
|
69
61
|
}
|
@@ -113,18 +105,6 @@ memptr_malloc(VALUE self, long size, long count, bool clear)
|
|
113
105
|
return self;
|
114
106
|
}
|
115
107
|
|
116
|
-
static VALUE
|
117
|
-
memptr_inspect(VALUE self)
|
118
|
-
{
|
119
|
-
MemoryPointer* ptr;
|
120
|
-
char tmp[100];
|
121
|
-
|
122
|
-
Data_Get_Struct(self, MemoryPointer, ptr);
|
123
|
-
|
124
|
-
snprintf(tmp, sizeof(tmp), "#<FFI::MemoryPointer address=%p size=%lu>", ptr->memory.address, ptr->memory.size);
|
125
|
-
return rb_str_new2(tmp);
|
126
|
-
}
|
127
|
-
|
128
108
|
static VALUE
|
129
109
|
memptr_free(VALUE self)
|
130
110
|
{
|
@@ -172,7 +152,6 @@ rbffi_MemoryPointer_Init(VALUE moduleFFI)
|
|
172
152
|
|
173
153
|
rb_define_alloc_func(rbffi_MemoryPointerClass, memptr_allocate);
|
174
154
|
rb_define_method(rbffi_MemoryPointerClass, "initialize", memptr_initialize, -1);
|
175
|
-
rb_define_method(rbffi_MemoryPointerClass, "inspect", memptr_inspect, 0);
|
176
155
|
rb_define_method(rbffi_MemoryPointerClass, "autorelease=", memptr_autorelease, 1);
|
177
156
|
rb_define_method(rbffi_MemoryPointerClass, "free", memptr_free, 0);
|
178
157
|
}
|
data/ext/ffi_c/Platform.c
CHANGED
data/ext/ffi_c/Pointer.c
CHANGED
@@ -3,27 +3,19 @@
|
|
3
3
|
*
|
4
4
|
* All rights reserved.
|
5
5
|
*
|
6
|
-
*
|
7
|
-
* modification, are permitted provided that the following conditions are met:
|
6
|
+
* This file is part of ruby-ffi.
|
8
7
|
*
|
9
|
-
*
|
10
|
-
*
|
11
|
-
*
|
12
|
-
* this list of conditions and the following disclaimer in the documentation
|
13
|
-
* and/or other materials provided with the distribution.
|
14
|
-
* * The name of the author or authors may not be used to endorse or promote
|
15
|
-
* products derived from this software without specific prior written permission.
|
8
|
+
* This code is free software: you can redistribute it and/or modify it under
|
9
|
+
* the terms of the GNU Lesser General Public License version 3 only, as
|
10
|
+
* published by the Free Software Foundation.
|
16
11
|
*
|
17
|
-
*
|
18
|
-
*
|
19
|
-
*
|
20
|
-
*
|
21
|
-
*
|
22
|
-
*
|
23
|
-
*
|
24
|
-
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
25
|
-
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
26
|
-
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
12
|
+
* This code is distributed in the hope that it will be useful, but WITHOUT
|
13
|
+
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
14
|
+
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License
|
15
|
+
* version 3 for more details.
|
16
|
+
*
|
17
|
+
* You should have received a copy of the GNU Lesser General Public License
|
18
|
+
* version 3 along with this work. If not, see <http://www.gnu.org/licenses/>.
|
27
19
|
*/
|
28
20
|
|
29
21
|
#include <stdbool.h>
|
@@ -59,7 +51,7 @@ rbffi_Pointer_NewInstance(void* addr)
|
|
59
51
|
obj = Data_Make_Struct(rbffi_PointerClass, Pointer, NULL, -1, p);
|
60
52
|
p->memory.address = addr;
|
61
53
|
p->memory.size = LONG_MAX;
|
62
|
-
p->memory.
|
54
|
+
p->memory.flags = (addr == NULL) ? 0 : (MEM_RD | MEM_WR);
|
63
55
|
p->memory.typeSize = 1;
|
64
56
|
p->parent = Qnil;
|
65
57
|
|
@@ -72,9 +64,9 @@ ptr_allocate(VALUE klass)
|
|
72
64
|
Pointer* p;
|
73
65
|
VALUE obj;
|
74
66
|
|
75
|
-
obj = Data_Make_Struct(klass, Pointer,
|
67
|
+
obj = Data_Make_Struct(klass, Pointer, ptr_mark, -1, p);
|
76
68
|
p->parent = Qnil;
|
77
|
-
p->memory.
|
69
|
+
p->memory.flags = MEM_RD | MEM_WR;
|
78
70
|
|
79
71
|
return obj;
|
80
72
|
}
|
@@ -106,7 +98,7 @@ ptr_initialize(int argc, VALUE* argv, VALUE self)
|
|
106
98
|
p->memory.address = (void*) (uintptr_t) NUM2LL(rbAddress);
|
107
99
|
p->memory.size = LONG_MAX;
|
108
100
|
if (p->memory.address == NULL) {
|
109
|
-
p->memory.
|
101
|
+
p->memory.flags = 0;
|
110
102
|
}
|
111
103
|
break;
|
112
104
|
|
@@ -143,7 +135,7 @@ slice(VALUE self, long offset, long size)
|
|
143
135
|
|
144
136
|
p->memory.address = ptr->address + offset;
|
145
137
|
p->memory.size = size;
|
146
|
-
p->memory.
|
138
|
+
p->memory.flags = ptr->flags;
|
147
139
|
p->memory.typeSize = ptr->typeSize;
|
148
140
|
p->parent = self;
|
149
141
|
|
@@ -171,12 +163,12 @@ static VALUE
|
|
171
163
|
ptr_inspect(VALUE self)
|
172
164
|
{
|
173
165
|
Pointer* ptr;
|
174
|
-
|
175
|
-
|
166
|
+
|
176
167
|
Data_Get_Struct(self, Pointer, ptr);
|
177
|
-
snprintf(tmp, sizeof(tmp), "#<FFI::Pointer address=%p>", ptr->memory.address);
|
178
168
|
|
179
|
-
return
|
169
|
+
return ptr->memory.size != LONG_MAX
|
170
|
+
? rb_sprintf("#<%s address=%p size=%lu>", rb_obj_classname(self), ptr->memory.address, ptr->memory.size)
|
171
|
+
: rb_sprintf("#<%s address=%p>", rb_obj_classname(self), ptr->memory.address);
|
180
172
|
}
|
181
173
|
|
182
174
|
static VALUE
|
@@ -209,6 +201,50 @@ ptr_address(VALUE self)
|
|
209
201
|
return ULL2NUM((uintptr_t) ptr->memory.address);
|
210
202
|
}
|
211
203
|
|
204
|
+
#if BYTE_ORDER == LITTLE_ENDIAN
|
205
|
+
# define SWAPPED_ORDER BIG_ENDIAN
|
206
|
+
#else
|
207
|
+
# define SWAPPED_ORDER LITTLE_ENDIAN
|
208
|
+
#endif
|
209
|
+
|
210
|
+
static VALUE
|
211
|
+
ptr_order(int argc, VALUE* argv, VALUE self)
|
212
|
+
{
|
213
|
+
Pointer* ptr;
|
214
|
+
|
215
|
+
Data_Get_Struct(self, Pointer, ptr);
|
216
|
+
if (argc == 0) {
|
217
|
+
int order = (ptr->memory.flags & MEM_SWAP) == 0 ? BYTE_ORDER : SWAPPED_ORDER;
|
218
|
+
return order == BIG_ENDIAN ? ID2SYM(rb_intern("big")) : ID2SYM(rb_intern("little"));
|
219
|
+
} else {
|
220
|
+
VALUE rbOrder = Qnil;
|
221
|
+
int order = BYTE_ORDER;
|
222
|
+
|
223
|
+
if (rb_scan_args(argc, argv, "1", &rbOrder) < 1) {
|
224
|
+
rb_raise(rb_eArgError, "need byte order");
|
225
|
+
}
|
226
|
+
if (SYMBOL_P(rbOrder)) {
|
227
|
+
ID id = SYM2ID(rbOrder);
|
228
|
+
if (id == rb_intern("little")) {
|
229
|
+
order = LITTLE_ENDIAN;
|
230
|
+
|
231
|
+
} else if (id == rb_intern("big") || id == rb_intern("network")) {
|
232
|
+
order = BIG_ENDIAN;
|
233
|
+
}
|
234
|
+
}
|
235
|
+
if (order != BYTE_ORDER) {
|
236
|
+
Pointer* p2;
|
237
|
+
VALUE retval = slice(self, 0, ptr->memory.size);
|
238
|
+
|
239
|
+
Data_Get_Struct(retval, Pointer, p2);
|
240
|
+
p2->memory.flags |= MEM_SWAP;
|
241
|
+
return retval;
|
242
|
+
}
|
243
|
+
|
244
|
+
return self;
|
245
|
+
}
|
246
|
+
}
|
247
|
+
|
212
248
|
static void
|
213
249
|
ptr_mark(Pointer* ptr)
|
214
250
|
{
|
@@ -226,12 +262,14 @@ rbffi_Pointer_Init(VALUE moduleFFI)
|
|
226
262
|
rb_define_alloc_func(rbffi_PointerClass, ptr_allocate);
|
227
263
|
rb_define_method(rbffi_PointerClass, "initialize", ptr_initialize, -1);
|
228
264
|
rb_define_method(rbffi_PointerClass, "inspect", ptr_inspect, 0);
|
265
|
+
rb_define_method(rbffi_PointerClass, "to_s", ptr_inspect, 0);
|
229
266
|
rb_define_method(rbffi_PointerClass, "+", ptr_plus, 1);
|
230
267
|
rb_define_method(rbffi_PointerClass, "slice", ptr_slice, 2);
|
231
268
|
rb_define_method(rbffi_PointerClass, "null?", ptr_null_p, 0);
|
232
269
|
rb_define_method(rbffi_PointerClass, "address", ptr_address, 0);
|
233
270
|
rb_define_alias(rbffi_PointerClass, "to_i", "address");
|
234
271
|
rb_define_method(rbffi_PointerClass, "==", ptr_equals, 1);
|
272
|
+
rb_define_method(rbffi_PointerClass, "order", ptr_order, -1);
|
235
273
|
|
236
274
|
rbffi_NullPointerSingleton = rb_class_new_instance(1, &rbNullAddress, rbffi_PointerClass);
|
237
275
|
rb_define_const(rbffi_PointerClass, "NULL", rbffi_NullPointerSingleton);
|
data/ext/ffi_c/Struct.c
CHANGED
@@ -45,16 +45,6 @@
|
|
45
45
|
#include "StructByValue.h"
|
46
46
|
#include "ArrayType.h"
|
47
47
|
|
48
|
-
#define FFI_ALIGN(v, a) (((((size_t) (v))-1) | ((a)-1))+1)
|
49
|
-
|
50
|
-
typedef struct StructLayoutBuilder {
|
51
|
-
VALUE rbFieldNames;
|
52
|
-
VALUE rbFieldMap;
|
53
|
-
unsigned int size;
|
54
|
-
unsigned int alignment;
|
55
|
-
bool isUnion;
|
56
|
-
} StructLayoutBuilder;
|
57
|
-
|
58
48
|
typedef struct InlineArray_ {
|
59
49
|
VALUE rbMemory;
|
60
50
|
VALUE rbField;
|
@@ -69,16 +59,11 @@ typedef struct InlineArray_ {
|
|
69
59
|
|
70
60
|
|
71
61
|
static void struct_mark(Struct *);
|
72
|
-
static void struct_layout_builder_mark(StructLayoutBuilder *);
|
73
|
-
static void struct_layout_builder_free(StructLayoutBuilder *);
|
74
62
|
static VALUE struct_class_layout(VALUE klass);
|
75
63
|
static void struct_malloc(Struct* s);
|
76
64
|
static void inline_array_mark(InlineArray *);
|
77
65
|
|
78
|
-
static inline int align(int offset, int align);
|
79
|
-
|
80
66
|
VALUE rbffi_StructClass = Qnil;
|
81
|
-
static VALUE StructLayoutBuilderClass = Qnil;
|
82
67
|
|
83
68
|
VALUE rbffi_StructInlineArrayClass = Qnil;
|
84
69
|
VALUE rbffi_StructLayoutCharArrayClass = Qnil;
|
@@ -213,6 +198,10 @@ struct_field(Struct* s, VALUE fieldName)
|
|
213
198
|
StructLayout* layout = s->layout;
|
214
199
|
VALUE rbField;
|
215
200
|
|
201
|
+
if (likely(SYMBOL_P(fieldName) && st_lookup(layout->fieldSymbolTable, fieldName, (st_data_t *) &rbField))) {
|
202
|
+
return rbField;
|
203
|
+
}
|
204
|
+
|
216
205
|
rbField = rb_hash_aref(layout->rbFieldMap, fieldName);
|
217
206
|
if (rbField == Qnil) {
|
218
207
|
VALUE str = rb_funcall2(fieldName, id_to_s, 0, NULL);
|
@@ -345,293 +334,35 @@ struct_get_layout(VALUE self)
|
|
345
334
|
return s->rbLayout;
|
346
335
|
}
|
347
336
|
|
348
|
-
static VALUE
|
349
|
-
struct_layout_builder_allocate(VALUE klass)
|
350
|
-
{
|
351
|
-
StructLayoutBuilder* builder;
|
352
|
-
VALUE obj;
|
353
|
-
|
354
|
-
obj = Data_Make_Struct(klass, StructLayoutBuilder, struct_layout_builder_mark, struct_layout_builder_free, builder);
|
355
|
-
|
356
|
-
builder->size = 0;
|
357
|
-
builder->alignment = 1;
|
358
|
-
builder->isUnion = false;
|
359
|
-
builder->rbFieldNames = rb_ary_new();
|
360
|
-
builder->rbFieldMap = rb_hash_new();
|
361
|
-
|
362
|
-
return obj;
|
363
|
-
}
|
364
|
-
|
365
|
-
static void
|
366
|
-
struct_layout_builder_mark(StructLayoutBuilder* builder)
|
367
|
-
{
|
368
|
-
rb_gc_mark(builder->rbFieldNames);
|
369
|
-
rb_gc_mark(builder->rbFieldMap);
|
370
|
-
}
|
371
|
-
|
372
|
-
static void
|
373
|
-
struct_layout_builder_free(StructLayoutBuilder* builder)
|
374
|
-
{
|
375
|
-
xfree(builder);
|
376
|
-
}
|
377
|
-
|
378
|
-
static VALUE
|
379
|
-
struct_layout_builder_initialize(VALUE self)
|
380
|
-
{
|
381
|
-
StructLayoutBuilder* builder;
|
382
|
-
|
383
|
-
Data_Get_Struct(self, StructLayoutBuilder, builder);
|
384
|
-
|
385
|
-
return self;
|
386
|
-
}
|
387
|
-
|
388
|
-
static VALUE
|
389
|
-
struct_layout_builder_get_size(VALUE self)
|
390
|
-
{
|
391
|
-
StructLayoutBuilder* builder;
|
392
|
-
|
393
|
-
Data_Get_Struct(self, StructLayoutBuilder, builder);
|
394
|
-
|
395
|
-
return UINT2NUM(builder->size);
|
396
|
-
}
|
397
|
-
|
398
|
-
static VALUE
|
399
|
-
struct_layout_builder_set_size(VALUE self, VALUE rbSize)
|
400
|
-
{
|
401
|
-
StructLayoutBuilder* builder;
|
402
|
-
unsigned int size = NUM2UINT(rbSize);
|
403
|
-
|
404
|
-
Data_Get_Struct(self, StructLayoutBuilder, builder);
|
405
|
-
builder->size = MAX(size, builder->size);
|
406
|
-
|
407
|
-
return UINT2NUM(builder->size);
|
408
|
-
}
|
409
|
-
|
410
|
-
static VALUE
|
411
|
-
struct_layout_builder_get_alignment(VALUE self)
|
412
|
-
{
|
413
|
-
StructLayoutBuilder* builder;
|
414
|
-
|
415
|
-
Data_Get_Struct(self, StructLayoutBuilder, builder);
|
416
|
-
|
417
|
-
return UINT2NUM(builder->alignment);
|
418
|
-
}
|
419
|
-
|
420
|
-
static VALUE
|
421
|
-
struct_layout_builder_set_alignment(VALUE self, VALUE rbAlign)
|
422
|
-
{
|
423
|
-
StructLayoutBuilder* builder;
|
424
|
-
unsigned int align = NUM2UINT(rbAlign);
|
425
|
-
|
426
|
-
Data_Get_Struct(self, StructLayoutBuilder, builder);
|
427
|
-
builder->size = MAX(align, builder->alignment);
|
428
|
-
|
429
|
-
return UINT2NUM(builder->alignment);
|
430
|
-
}
|
431
337
|
|
432
338
|
static VALUE
|
433
|
-
|
339
|
+
struct_null_p(VALUE self)
|
434
340
|
{
|
435
|
-
|
436
|
-
|
341
|
+
Struct* s;
|
437
342
|
|
438
|
-
Data_Get_Struct(self,
|
439
|
-
builder->isUnion = RTEST(rbUnion);
|
343
|
+
Data_Get_Struct(self, Struct, s);
|
440
344
|
|
441
|
-
return
|
345
|
+
return s->pointer->address == NULL ? Qtrue : Qfalse;
|
442
346
|
}
|
443
347
|
|
444
348
|
static VALUE
|
445
|
-
|
446
|
-
{
|
447
|
-
StructLayoutBuilder* builder;
|
448
|
-
|
449
|
-
|
450
|
-
Data_Get_Struct(self, StructLayoutBuilder, builder);
|
451
|
-
|
452
|
-
|
453
|
-
return builder->isUnion ? Qtrue : Qfalse;
|
454
|
-
}
|
455
|
-
|
456
|
-
static void
|
457
|
-
store_field(StructLayoutBuilder* builder, VALUE rbName, VALUE rbField,
|
458
|
-
unsigned int offset, unsigned int size, unsigned int alignment)
|
349
|
+
struct_order(int argc, VALUE* argv, VALUE self)
|
459
350
|
{
|
460
|
-
|
461
|
-
rb_hash_aset(builder->rbFieldMap, rbName, rbField);
|
462
|
-
|
463
|
-
builder->alignment = MAX(builder->alignment, alignment);
|
351
|
+
Struct* s;
|
464
352
|
|
465
|
-
|
466
|
-
|
467
|
-
|
468
|
-
builder->size = MAX(builder->size, offset + size);
|
469
|
-
}
|
470
|
-
}
|
353
|
+
Data_Get_Struct(self, Struct, s);
|
354
|
+
if (argc == 0) {
|
355
|
+
return rb_funcall(s->rbPointer, rb_intern("order"), 0);
|
471
356
|
|
472
|
-
static int
|
473
|
-
calculate_offset(StructLayoutBuilder* builder, int alignment, VALUE rbOffset)
|
474
|
-
{
|
475
|
-
if (rbOffset != Qnil) {
|
476
|
-
return NUM2UINT(rbOffset);
|
477
357
|
} else {
|
478
|
-
|
479
|
-
|
480
|
-
|
481
|
-
|
482
|
-
static VALUE
|
483
|
-
struct_layout_builder_add_field(int argc, VALUE* argv, VALUE self)
|
484
|
-
{
|
485
|
-
StructLayoutBuilder* builder;
|
486
|
-
VALUE rbName = Qnil, rbType = Qnil, rbOffset = Qnil, rbField = Qnil;
|
487
|
-
unsigned int size, alignment, offset;
|
488
|
-
int nargs;
|
489
|
-
|
490
|
-
nargs = rb_scan_args(argc, argv, "21", &rbName, &rbType, &rbOffset);
|
491
|
-
|
492
|
-
Data_Get_Struct(self, StructLayoutBuilder, builder);
|
493
|
-
|
494
|
-
alignment = NUM2UINT(rb_funcall2(rbType, rb_intern("alignment"), 0, NULL));
|
495
|
-
size = NUM2UINT(rb_funcall2(rbType, rb_intern("size"), 0, NULL));
|
496
|
-
|
497
|
-
offset = calculate_offset(builder, alignment, rbOffset);
|
498
|
-
|
499
|
-
//
|
500
|
-
// If a primitive type was passed in as the type arg, try and convert
|
501
|
-
//
|
502
|
-
if (!rb_obj_is_kind_of(rbType, rbffi_StructLayoutFieldClass)) {
|
503
|
-
VALUE fargv[3], rbFieldClass;
|
504
|
-
fargv[0] = rbName;
|
505
|
-
fargv[1] = UINT2NUM(offset);
|
506
|
-
fargv[2] = rbType;
|
358
|
+
VALUE retval = rb_obj_dup(self);
|
359
|
+
VALUE rbPointer = rb_funcall2(s->rbPointer, rb_intern("order"), argc, argv);
|
360
|
+
struct_set_pointer(retval, rbPointer);
|
507
361
|
|
508
|
-
|
509
|
-
|
510
|
-
rbFieldClass = rbffi_StructLayoutFunctionFieldClass;
|
511
|
-
|
512
|
-
} else if (rb_obj_is_kind_of(rbType, rbffi_StructByValueClass)) {
|
513
|
-
|
514
|
-
rbFieldClass = rb_const_get(rbffi_StructLayoutClass, rb_intern("InlineStruct"));
|
515
|
-
|
516
|
-
} else if (rb_obj_is_kind_of(rbType, rbffi_ArrayTypeClass)) {
|
517
|
-
|
518
|
-
rbFieldClass = rbffi_StructLayoutArrayFieldClass;
|
519
|
-
|
520
|
-
} else if (rb_obj_is_kind_of(rbType, rbffi_EnumTypeClass)) {
|
521
|
-
|
522
|
-
rbFieldClass = rb_const_get(rbffi_StructLayoutClass, rb_intern("Enum"));
|
523
|
-
|
524
|
-
} else {
|
525
|
-
rbFieldClass = rbffi_StructLayoutFieldClass;
|
526
|
-
}
|
527
|
-
|
528
|
-
if (!RTEST(rbFieldClass)) {
|
529
|
-
rb_raise(rb_eTypeError, "invalid struct field type (%s)", rb_obj_classname(rbType));
|
530
|
-
return Qnil;
|
531
|
-
}
|
532
|
-
|
533
|
-
rbField = rb_class_new_instance(3, fargv, rbFieldClass);
|
534
|
-
} else {
|
535
|
-
rbField = rbType;
|
536
|
-
}
|
537
|
-
|
538
|
-
store_field(builder, rbName, rbField, offset, size, alignment);
|
539
|
-
|
540
|
-
return self;
|
541
|
-
}
|
542
|
-
|
543
|
-
static VALUE
|
544
|
-
struct_layout_builder_add_struct(int argc, VALUE* argv, VALUE self)
|
545
|
-
{
|
546
|
-
StructLayoutBuilder* builder;
|
547
|
-
VALUE rbName = Qnil, rbType = Qnil, rbOffset = Qnil, rbField = Qnil;
|
548
|
-
VALUE rbFieldClass = Qnil, rbStructClass = Qnil;
|
549
|
-
VALUE fargv[3];
|
550
|
-
unsigned int size, alignment, offset;
|
551
|
-
int nargs;
|
552
|
-
|
553
|
-
nargs = rb_scan_args(argc, argv, "21", &rbName, &rbStructClass, &rbOffset);
|
554
|
-
|
555
|
-
if (!rb_obj_is_instance_of(rbStructClass, rb_cClass) || !rb_class_inherited(rbStructClass, rbffi_StructClass)) {
|
556
|
-
rb_raise(rb_eTypeError, "wrong argument type. Expected subclass of FFI::Struct");
|
557
|
-
}
|
558
|
-
|
559
|
-
rbType = rb_class_new_instance(1, &rbStructClass, rbffi_StructByValueClass);
|
560
|
-
|
561
|
-
alignment = NUM2UINT(rb_funcall2(rbType, rb_intern("alignment"), 0, NULL));
|
562
|
-
size = NUM2UINT(rb_funcall2(rbType, rb_intern("size"), 0, NULL));
|
563
|
-
|
564
|
-
Data_Get_Struct(self, StructLayoutBuilder, builder);
|
565
|
-
|
566
|
-
offset = calculate_offset(builder, alignment, rbOffset);
|
567
|
-
|
568
|
-
fargv[0] = rbName;
|
569
|
-
fargv[1] = UINT2NUM(offset);
|
570
|
-
fargv[2] = rbType;
|
571
|
-
rbFieldClass = rb_const_get(rbffi_StructLayoutClass, rb_intern("InlineStruct"));
|
572
|
-
if (!RTEST(rbFieldClass)) {
|
573
|
-
rb_raise(rb_eRuntimeError, "could not locate StructLayout::InlineStruct");
|
574
|
-
return Qnil;
|
362
|
+
return retval;
|
575
363
|
}
|
576
|
-
|
577
|
-
rbField = rb_class_new_instance(3, fargv, rbFieldClass);
|
578
|
-
|
579
|
-
store_field(builder, rbName, rbField, offset, size, alignment);
|
580
|
-
|
581
|
-
return self;
|
582
|
-
}
|
583
|
-
|
584
|
-
static VALUE
|
585
|
-
struct_layout_builder_add_array(int argc, VALUE* argv, VALUE self)
|
586
|
-
{
|
587
|
-
StructLayoutBuilder* builder;
|
588
|
-
VALUE rbName = Qnil, rbType = Qnil, rbLength = Qnil, rbOffset = Qnil, rbField;
|
589
|
-
VALUE fargv[3], aargv[2];
|
590
|
-
unsigned int size, alignment, offset;
|
591
|
-
int nargs;
|
592
|
-
|
593
|
-
nargs = rb_scan_args(argc, argv, "31", &rbName, &rbType, &rbLength, &rbOffset);
|
594
|
-
|
595
|
-
Data_Get_Struct(self, StructLayoutBuilder, builder);
|
596
|
-
|
597
|
-
alignment = NUM2UINT(rb_funcall2(rbType, rb_intern("alignment"), 0, NULL));
|
598
|
-
size = NUM2UINT(rb_funcall2(rbType, rb_intern("size"), 0, NULL)) * NUM2UINT(rbLength);
|
599
|
-
|
600
|
-
offset = calculate_offset(builder, alignment, rbOffset);
|
601
|
-
|
602
|
-
aargv[0] = rbType;
|
603
|
-
aargv[1] = rbLength;
|
604
|
-
fargv[0] = rbName;
|
605
|
-
fargv[1] = UINT2NUM(offset);
|
606
|
-
fargv[2] = rb_class_new_instance(2, aargv, rbffi_ArrayTypeClass);
|
607
|
-
rbField = rb_class_new_instance(3, fargv, rbffi_StructLayoutArrayFieldClass);
|
608
|
-
|
609
|
-
store_field(builder, rbName, rbField, offset, size, alignment);
|
610
|
-
|
611
|
-
return self;
|
612
364
|
}
|
613
365
|
|
614
|
-
static inline int
|
615
|
-
align(int offset, int align)
|
616
|
-
{
|
617
|
-
return align + ((offset - 1) & ~(align - 1));
|
618
|
-
}
|
619
|
-
|
620
|
-
static VALUE
|
621
|
-
struct_layout_builder_build(VALUE self)
|
622
|
-
{
|
623
|
-
StructLayoutBuilder* builder;
|
624
|
-
VALUE argv[4];
|
625
|
-
|
626
|
-
Data_Get_Struct(self, StructLayoutBuilder, builder);
|
627
|
-
|
628
|
-
argv[0] = builder->rbFieldNames;
|
629
|
-
argv[1] = builder->rbFieldMap;
|
630
|
-
argv[2] = UINT2NUM(align(builder->size, builder->alignment)); // tail padding
|
631
|
-
argv[3] = UINT2NUM(builder->alignment);
|
632
|
-
|
633
|
-
return rb_class_new_instance(4, argv, rbffi_StructLayoutClass);
|
634
|
-
}
|
635
366
|
|
636
367
|
static VALUE
|
637
368
|
inline_array_allocate(VALUE klass)
|
@@ -848,10 +579,6 @@ rbffi_Struct_Init(VALUE moduleFFI)
|
|
848
579
|
rbffi_StructClass = StructClass = rb_define_class_under(moduleFFI, "Struct", rb_cObject);
|
849
580
|
rb_global_variable(&rbffi_StructClass);
|
850
581
|
|
851
|
-
|
852
|
-
StructLayoutBuilderClass = rb_define_class_under(moduleFFI, "StructLayoutBuilder", rb_cObject);
|
853
|
-
rb_global_variable(&StructLayoutBuilderClass);
|
854
|
-
|
855
582
|
rbffi_StructInlineArrayClass = rb_define_class_under(rbffi_StructClass, "InlineArray", rb_cObject);
|
856
583
|
rb_global_variable(&rbffi_StructInlineArrayClass);
|
857
584
|
|
@@ -862,6 +589,7 @@ rbffi_Struct_Init(VALUE moduleFFI)
|
|
862
589
|
|
863
590
|
rb_define_alloc_func(StructClass, struct_allocate);
|
864
591
|
rb_define_method(StructClass, "initialize", struct_initialize, -1);
|
592
|
+
rb_define_method(StructClass, "order", struct_order, -1);
|
865
593
|
|
866
594
|
rb_define_alias(rb_singleton_class(StructClass), "alloc_in", "new");
|
867
595
|
rb_define_alias(rb_singleton_class(StructClass), "alloc_out", "new");
|
@@ -878,22 +606,7 @@ rbffi_Struct_Init(VALUE moduleFFI)
|
|
878
606
|
|
879
607
|
rb_define_method(StructClass, "[]", struct_aref, 1);
|
880
608
|
rb_define_method(StructClass, "[]=", struct_aset, 2);
|
881
|
-
|
882
|
-
|
883
|
-
|
884
|
-
rb_define_alloc_func(StructLayoutBuilderClass, struct_layout_builder_allocate);
|
885
|
-
rb_define_method(StructLayoutBuilderClass, "initialize", struct_layout_builder_initialize, 0);
|
886
|
-
rb_define_method(StructLayoutBuilderClass, "build", struct_layout_builder_build, 0);
|
887
|
-
|
888
|
-
rb_define_method(StructLayoutBuilderClass, "alignment", struct_layout_builder_get_alignment, 0);
|
889
|
-
rb_define_method(StructLayoutBuilderClass, "alignment=", struct_layout_builder_set_alignment, 1);
|
890
|
-
rb_define_method(StructLayoutBuilderClass, "size", struct_layout_builder_get_size, 0);
|
891
|
-
rb_define_method(StructLayoutBuilderClass, "size=", struct_layout_builder_set_size, 1);
|
892
|
-
rb_define_method(StructLayoutBuilderClass, "union=", struct_layout_builder_set_union, 1);
|
893
|
-
rb_define_method(StructLayoutBuilderClass, "union?", struct_layout_builder_union_p, 0);
|
894
|
-
rb_define_method(StructLayoutBuilderClass, "add_field", struct_layout_builder_add_field, -1);
|
895
|
-
rb_define_method(StructLayoutBuilderClass, "add_array", struct_layout_builder_add_array, -1);
|
896
|
-
rb_define_method(StructLayoutBuilderClass, "add_struct", struct_layout_builder_add_struct, -1);
|
609
|
+
rb_define_method(StructClass, "null?", struct_null_p, 0);
|
897
610
|
|
898
611
|
rb_include_module(rbffi_StructInlineArrayClass, rb_mEnumerable);
|
899
612
|
rb_define_alloc_func(rbffi_StructInlineArrayClass, inline_array_allocate);
|