ffi 1.9.21 → 1.9.22
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.
- checksums.yaml +5 -5
- checksums.yaml.gz.sig +3 -0
- data.tar.gz.sig +0 -0
- data/.gitignore +22 -0
- data/.gitmodules +3 -0
- data/.travis.yml +52 -0
- data/.yardopts +5 -0
- data/Gemfile +15 -0
- data/{spec/ffi/LICENSE.SPECS → LICENSE.SPECS} +1 -1
- data/README.md +1 -1
- data/Rakefile +28 -3
- data/appveyor.yml +22 -0
- data/ext/ffi_c/Call.c +1 -22
- data/ext/ffi_c/Call.h +0 -9
- data/ext/ffi_c/Closure.c +54 -0
- data/ext/ffi_c/{ClosurePool.h → Closure.h} +13 -23
- data/ext/ffi_c/Function.c +16 -25
- data/ext/ffi_c/Function.h +1 -2
- data/ext/ffi_c/FunctionInfo.c +0 -4
- data/ext/ffi_c/MethodHandle.c +33 -268
- data/ext/ffi_c/extconf.rb +3 -3
- data/ext/ffi_c/ffi.c +2 -2
- data/ext/ffi_c/libffi.bsd.mk +3 -3
- data/ext/ffi_c/libffi.darwin.mk +1 -1
- data/ext/ffi_c/libffi.gnu.mk +1 -1
- data/ext/ffi_c/libffi.mk +2 -2
- data/ext/ffi_c/libffi.vc.mk +1 -1
- data/ext/ffi_c/libffi.vc64.mk +1 -1
- data/ext/ffi_c/libffi/.appveyor.yml +48 -0
- data/ext/ffi_c/libffi/.gitignore +36 -0
- data/ext/ffi_c/libffi/.travis.yml +30 -0
- data/ext/ffi_c/libffi/.travis/install.sh +14 -0
- data/ext/ffi_c/libffi/Makefile.am +5 -3
- data/ext/ffi_c/libffi/acinclude.m4 +6 -0
- data/ext/ffi_c/libffi/autogen.sh +1 -1
- data/ext/ffi_c/libffi/config.guess +1466 -0
- data/ext/ffi_c/libffi/config.sub +1836 -0
- data/ext/ffi_c/libffi/configure.ac +2 -2
- data/ext/ffi_c/libffi/configure.host +15 -3
- data/ext/ffi_c/libffi/generate-darwin-source-and-headers.py +11 -15
- data/ext/ffi_c/libffi/include/ffi.h.in +6 -1
- data/ext/ffi_c/libffi/libffi.xcodeproj/project.pbxproj +465 -59
- data/ext/ffi_c/libffi/src/aarch64/ffi.c +33 -10
- data/ext/ffi_c/libffi/src/aarch64/sysv.S +2 -2
- data/ext/ffi_c/libffi/src/arm/ffi.c +12 -1
- data/ext/ffi_c/libffi/src/arm/sysv.S +1 -1
- data/ext/ffi_c/libffi/src/closures.c +143 -97
- data/ext/ffi_c/libffi/src/ia64/unix.S +2 -0
- data/ext/ffi_c/libffi/src/mips/ffi.c +8 -0
- data/ext/ffi_c/libffi/src/mips/ffitarget.h +1 -1
- data/ext/ffi_c/libffi/src/mips/n32.S +2 -0
- data/ext/ffi_c/libffi/src/powerpc/aix.S +239 -1
- data/ext/ffi_c/libffi/src/powerpc/aix_closure.S +250 -3
- data/ext/ffi_c/libffi/src/powerpc/ffi_darwin.c +86 -5
- data/ext/ffi_c/libffi/src/powerpc/ffitarget.h +3 -0
- data/ext/ffi_c/libffi/src/x86/ffi.c +3 -1
- data/ext/ffi_c/libffi/src/x86/ffi64.c +26 -5
- data/ext/ffi_c/libffi/src/x86/sysv.S +2 -2
- data/ext/ffi_c/libffi/src/x86/unix64.S +1 -1
- data/ext/ffi_c/libffi/src/x86/win64.S +1 -1
- data/ext/ffi_c/libffi/testsuite/Makefile.am +2 -1
- data/ext/ffi_c/libffi/testsuite/lib/libffi.exp +2 -1
- data/ext/ffi_c/libffi/testsuite/libffi.call/cls_3float.c +95 -0
- data/ffi.gemspec +14 -1
- data/lib/ffi/library.rb +1 -1
- data/lib/ffi/version.rb +1 -1
- data/samples/getlogin.rb +8 -0
- data/samples/getpid.rb +8 -0
- data/samples/gettimeofday.rb +18 -0
- data/samples/hello.rb +7 -0
- data/samples/inotify.rb +60 -0
- data/samples/pty.rb +76 -0
- data/samples/qsort.rb +21 -0
- data/samples/sample_helper.rb +6 -0
- metadata +59 -81
- metadata.gz.sig +0 -0
- data/ext/ffi_c/ClosurePool.c +0 -283
- data/gen/Rakefile +0 -30
- data/libtest/Benchmark.c +0 -52
- data/libtest/BoolTest.c +0 -34
- data/libtest/BufferTest.c +0 -31
- data/libtest/ClosureTest.c +0 -205
- data/libtest/EnumTest.c +0 -51
- data/libtest/FunctionTest.c +0 -70
- data/libtest/GNUmakefile +0 -149
- data/libtest/GlobalVariable.c +0 -62
- data/libtest/LastErrorTest.c +0 -21
- data/libtest/NumberTest.c +0 -132
- data/libtest/PointerTest.c +0 -63
- data/libtest/ReferenceTest.c +0 -23
- data/libtest/StringTest.c +0 -34
- data/libtest/StructTest.c +0 -243
- data/libtest/UnionTest.c +0 -43
- data/libtest/VariadicTest.c +0 -99
- data/spec/ffi/async_callback_spec.rb +0 -35
- data/spec/ffi/bitmask_spec.rb +0 -575
- data/spec/ffi/bool_spec.rb +0 -32
- data/spec/ffi/buffer_spec.rb +0 -279
- data/spec/ffi/callback_spec.rb +0 -773
- data/spec/ffi/custom_param_type.rb +0 -37
- data/spec/ffi/custom_type_spec.rb +0 -74
- data/spec/ffi/dup_spec.rb +0 -52
- data/spec/ffi/enum_spec.rb +0 -423
- data/spec/ffi/errno_spec.rb +0 -20
- data/spec/ffi/ffi_spec.rb +0 -28
- data/spec/ffi/fixtures/Benchmark.c +0 -52
- data/spec/ffi/fixtures/BitmaskTest.c +0 -51
- data/spec/ffi/fixtures/BoolTest.c +0 -34
- data/spec/ffi/fixtures/BufferTest.c +0 -31
- data/spec/ffi/fixtures/ClosureTest.c +0 -205
- data/spec/ffi/fixtures/EnumTest.c +0 -51
- data/spec/ffi/fixtures/FunctionTest.c +0 -142
- data/spec/ffi/fixtures/GNUmakefile +0 -149
- data/spec/ffi/fixtures/GlobalVariable.c +0 -62
- data/spec/ffi/fixtures/LastErrorTest.c +0 -21
- data/spec/ffi/fixtures/NumberTest.c +0 -132
- data/spec/ffi/fixtures/PipeHelper.h +0 -21
- data/spec/ffi/fixtures/PipeHelperPosix.c +0 -41
- data/spec/ffi/fixtures/PipeHelperWindows.c +0 -72
- data/spec/ffi/fixtures/PointerTest.c +0 -63
- data/spec/ffi/fixtures/ReferenceTest.c +0 -23
- data/spec/ffi/fixtures/StringTest.c +0 -34
- data/spec/ffi/fixtures/StructTest.c +0 -243
- data/spec/ffi/fixtures/UnionTest.c +0 -43
- data/spec/ffi/fixtures/VariadicTest.c +0 -99
- data/spec/ffi/fixtures/classes.rb +0 -438
- data/spec/ffi/function_spec.rb +0 -97
- data/spec/ffi/io_spec.rb +0 -16
- data/spec/ffi/library_spec.rb +0 -286
- data/spec/ffi/long_double.rb +0 -30
- data/spec/ffi/managed_struct_spec.rb +0 -68
- data/spec/ffi/memorypointer_spec.rb +0 -78
- data/spec/ffi/number_spec.rb +0 -247
- data/spec/ffi/platform_spec.rb +0 -114
- data/spec/ffi/pointer_spec.rb +0 -285
- data/spec/ffi/rbx/attach_function_spec.rb +0 -34
- data/spec/ffi/rbx/memory_pointer_spec.rb +0 -198
- data/spec/ffi/rbx/spec_helper.rb +0 -6
- data/spec/ffi/rbx/struct_spec.rb +0 -18
- data/spec/ffi/spec_helper.rb +0 -93
- data/spec/ffi/string_spec.rb +0 -118
- data/spec/ffi/strptr_spec.rb +0 -50
- data/spec/ffi/struct_by_ref_spec.rb +0 -43
- data/spec/ffi/struct_callback_spec.rb +0 -69
- data/spec/ffi/struct_initialize_spec.rb +0 -35
- data/spec/ffi/struct_packed_spec.rb +0 -50
- data/spec/ffi/struct_spec.rb +0 -882
- data/spec/ffi/typedef_spec.rb +0 -91
- data/spec/ffi/union_spec.rb +0 -67
- data/spec/ffi/variadic_spec.rb +0 -132
- data/spec/spec.opts +0 -4
metadata.gz.sig
ADDED
Binary file
|
data/ext/ffi_c/ClosurePool.c
DELETED
@@ -1,283 +0,0 @@
|
|
1
|
-
/*
|
2
|
-
* Copyright (c) 2009, 2010 Wayne Meissner
|
3
|
-
* Copyright (c) 2008-2013, Ruby FFI project contributors
|
4
|
-
* All rights reserved.
|
5
|
-
*
|
6
|
-
* Redistribution and use in source and binary forms, with or without
|
7
|
-
* modification, are permitted provided that the following conditions are met:
|
8
|
-
* * Redistributions of source code must retain the above copyright
|
9
|
-
* notice, this list of conditions and the following disclaimer.
|
10
|
-
* * Redistributions in binary form must reproduce the above copyright
|
11
|
-
* notice, this list of conditions and the following disclaimer in the
|
12
|
-
* documentation and/or other materials provided with the distribution.
|
13
|
-
* * Neither the name of the Ruby FFI project nor the
|
14
|
-
* names of its contributors may be used to endorse or promote products
|
15
|
-
* derived from this software without specific prior written permission.
|
16
|
-
*
|
17
|
-
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
18
|
-
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
19
|
-
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
20
|
-
* DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
|
21
|
-
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
22
|
-
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
23
|
-
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
24
|
-
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
25
|
-
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
26
|
-
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
27
|
-
*/
|
28
|
-
|
29
|
-
#ifndef _MSC_VER
|
30
|
-
#include <sys/param.h>
|
31
|
-
#endif
|
32
|
-
#include <sys/types.h>
|
33
|
-
#if defined(__CYGWIN__) || !defined(_WIN32)
|
34
|
-
# include <sys/mman.h>
|
35
|
-
#endif
|
36
|
-
#include <stdio.h>
|
37
|
-
#ifndef _MSC_VER
|
38
|
-
# include <stdint.h>
|
39
|
-
# include <stdbool.h>
|
40
|
-
#else
|
41
|
-
# include "win32/stdbool.h"
|
42
|
-
# include "win32/stdint.h"
|
43
|
-
#endif
|
44
|
-
#if defined(__CYGWIN__) || !defined(_WIN32)
|
45
|
-
# include <unistd.h>
|
46
|
-
#else
|
47
|
-
# include <winsock2.h>
|
48
|
-
# define _WINSOCKAPI_
|
49
|
-
# include <windows.h>
|
50
|
-
#endif
|
51
|
-
#include <errno.h>
|
52
|
-
#include <ruby.h>
|
53
|
-
|
54
|
-
#if defined(_MSC_VER) && !defined(INT8_MIN)
|
55
|
-
# include "win32/stdint.h"
|
56
|
-
#endif
|
57
|
-
#include <ffi.h>
|
58
|
-
#include "rbffi.h"
|
59
|
-
#include "compat.h"
|
60
|
-
|
61
|
-
#include "Function.h"
|
62
|
-
#include "Types.h"
|
63
|
-
#include "Type.h"
|
64
|
-
#include "LastError.h"
|
65
|
-
#include "Call.h"
|
66
|
-
|
67
|
-
#include "ClosurePool.h"
|
68
|
-
|
69
|
-
|
70
|
-
#ifndef roundup
|
71
|
-
# define roundup(x, y) ((((x)+((y)-1))/(y))*(y))
|
72
|
-
#endif
|
73
|
-
#ifdef _WIN32
|
74
|
-
typedef char* caddr_t;
|
75
|
-
#endif
|
76
|
-
|
77
|
-
typedef struct Memory {
|
78
|
-
void* code;
|
79
|
-
void* data;
|
80
|
-
struct Memory* next;
|
81
|
-
} Memory;
|
82
|
-
|
83
|
-
struct ClosurePool_ {
|
84
|
-
void* ctx;
|
85
|
-
int closureSize;
|
86
|
-
bool (*prep)(void* ctx, void *code, Closure* closure, char* errbuf, size_t errbufsize);
|
87
|
-
struct Memory* blocks; /* Keeps track of all the allocated memory for this pool */
|
88
|
-
Closure* list;
|
89
|
-
long refcnt;
|
90
|
-
};
|
91
|
-
|
92
|
-
static long pageSize;
|
93
|
-
|
94
|
-
static void* allocatePage(void);
|
95
|
-
static bool freePage(void *);
|
96
|
-
static bool protectPage(void *);
|
97
|
-
|
98
|
-
ClosurePool*
|
99
|
-
rbffi_ClosurePool_New(int closureSize,
|
100
|
-
bool (*prep)(void* ctx, void *code, Closure* closure, char* errbuf, size_t errbufsize),
|
101
|
-
void* ctx)
|
102
|
-
{
|
103
|
-
ClosurePool* pool;
|
104
|
-
|
105
|
-
pool = xcalloc(1, sizeof(*pool));
|
106
|
-
pool->closureSize = closureSize;
|
107
|
-
pool->ctx = ctx;
|
108
|
-
pool->prep = prep;
|
109
|
-
pool->refcnt = 1;
|
110
|
-
|
111
|
-
return pool;
|
112
|
-
}
|
113
|
-
|
114
|
-
void
|
115
|
-
cleanup_closure_pool(ClosurePool* pool)
|
116
|
-
{
|
117
|
-
Memory* memory;
|
118
|
-
|
119
|
-
for (memory = pool->blocks; memory != NULL; ) {
|
120
|
-
Memory* next = memory->next;
|
121
|
-
freePage(memory->code);
|
122
|
-
free(memory->data);
|
123
|
-
free(memory);
|
124
|
-
memory = next;
|
125
|
-
}
|
126
|
-
xfree(pool);
|
127
|
-
}
|
128
|
-
|
129
|
-
void
|
130
|
-
rbffi_ClosurePool_Free(ClosurePool* pool)
|
131
|
-
{
|
132
|
-
if (pool != NULL) {
|
133
|
-
long refcnt = --(pool->refcnt);
|
134
|
-
if (refcnt == 0) {
|
135
|
-
cleanup_closure_pool(pool);
|
136
|
-
}
|
137
|
-
}
|
138
|
-
}
|
139
|
-
|
140
|
-
Closure*
|
141
|
-
rbffi_Closure_Alloc(ClosurePool* pool)
|
142
|
-
{
|
143
|
-
Closure *list = NULL;
|
144
|
-
Memory* block = NULL;
|
145
|
-
caddr_t code = NULL;
|
146
|
-
char errmsg[256];
|
147
|
-
int nclosures;
|
148
|
-
long trampolineSize;
|
149
|
-
int i;
|
150
|
-
|
151
|
-
if (pool->list != NULL) {
|
152
|
-
Closure* closure = pool->list;
|
153
|
-
pool->list = pool->list->next;
|
154
|
-
pool->refcnt++;
|
155
|
-
|
156
|
-
return closure;
|
157
|
-
}
|
158
|
-
|
159
|
-
trampolineSize = roundup(pool->closureSize, 8);
|
160
|
-
nclosures = (int) (pageSize / trampolineSize);
|
161
|
-
block = calloc(1, sizeof(*block));
|
162
|
-
list = calloc(nclosures, sizeof(*list));
|
163
|
-
code = allocatePage();
|
164
|
-
|
165
|
-
if (block == NULL || list == NULL || code == NULL) {
|
166
|
-
snprintf(errmsg, sizeof(errmsg), "failed to allocate a page. errno=%d (%s)", errno, strerror(errno));
|
167
|
-
goto error;
|
168
|
-
}
|
169
|
-
|
170
|
-
for (i = 0; i < nclosures; ++i) {
|
171
|
-
Closure* closure = &list[i];
|
172
|
-
closure->next = &list[i + 1];
|
173
|
-
closure->pool = pool;
|
174
|
-
closure->code = (code + (i * trampolineSize));
|
175
|
-
|
176
|
-
if (!(*pool->prep)(pool->ctx, closure->code, closure, errmsg, sizeof(errmsg))) {
|
177
|
-
goto error;
|
178
|
-
}
|
179
|
-
}
|
180
|
-
|
181
|
-
if (!protectPage(code)) {
|
182
|
-
goto error;
|
183
|
-
}
|
184
|
-
|
185
|
-
/* Track the allocated page + Closure memory area */
|
186
|
-
block->data = list;
|
187
|
-
block->code = code;
|
188
|
-
block->next = pool->blocks;
|
189
|
-
pool->blocks = block;
|
190
|
-
|
191
|
-
/* Thread the new block onto the free list, apart from the first one. */
|
192
|
-
list[nclosures - 1].next = pool->list;
|
193
|
-
pool->list = list->next;
|
194
|
-
pool->refcnt++;
|
195
|
-
|
196
|
-
/* Use the first one as the new handle */
|
197
|
-
return list;
|
198
|
-
|
199
|
-
error:
|
200
|
-
free(block);
|
201
|
-
free(list);
|
202
|
-
if (code != NULL) {
|
203
|
-
freePage(code);
|
204
|
-
}
|
205
|
-
|
206
|
-
|
207
|
-
rb_raise(rb_eRuntimeError, "%s", errmsg);
|
208
|
-
return NULL;
|
209
|
-
}
|
210
|
-
|
211
|
-
void
|
212
|
-
rbffi_Closure_Free(Closure* closure)
|
213
|
-
{
|
214
|
-
if (closure != NULL) {
|
215
|
-
ClosurePool* pool = closure->pool;
|
216
|
-
long refcnt;
|
217
|
-
/* Just push it on the front of the free list */
|
218
|
-
closure->next = pool->list;
|
219
|
-
pool->list = closure;
|
220
|
-
refcnt = --(pool->refcnt);
|
221
|
-
if (refcnt == 0) {
|
222
|
-
cleanup_closure_pool(pool);
|
223
|
-
}
|
224
|
-
}
|
225
|
-
}
|
226
|
-
|
227
|
-
void*
|
228
|
-
rbffi_Closure_CodeAddress(Closure* handle)
|
229
|
-
{
|
230
|
-
return handle->code;
|
231
|
-
}
|
232
|
-
|
233
|
-
|
234
|
-
static long
|
235
|
-
getPageSize()
|
236
|
-
{
|
237
|
-
#if !defined(__CYGWIN__) && (defined(_WIN32) || defined(__WIN32__))
|
238
|
-
SYSTEM_INFO si;
|
239
|
-
GetSystemInfo(&si);
|
240
|
-
return si.dwPageSize;
|
241
|
-
#else
|
242
|
-
return sysconf(_SC_PAGESIZE);
|
243
|
-
#endif
|
244
|
-
}
|
245
|
-
|
246
|
-
static void*
|
247
|
-
allocatePage(void)
|
248
|
-
{
|
249
|
-
#if !defined(__CYGWIN__) && (defined(_WIN32) || defined(__WIN32__))
|
250
|
-
return VirtualAlloc(NULL, pageSize, MEM_COMMIT | MEM_RESERVE, PAGE_READWRITE);
|
251
|
-
#else
|
252
|
-
caddr_t page = mmap(NULL, pageSize, PROT_READ | PROT_WRITE, MAP_ANON | MAP_PRIVATE, -1, 0);
|
253
|
-
return (page != (caddr_t) -1) ? page : NULL;
|
254
|
-
#endif
|
255
|
-
}
|
256
|
-
|
257
|
-
static bool
|
258
|
-
freePage(void *addr)
|
259
|
-
{
|
260
|
-
#if !defined(__CYGWIN__) && (defined(_WIN32) || defined(__WIN32__))
|
261
|
-
return VirtualFree(addr, 0, MEM_RELEASE);
|
262
|
-
#else
|
263
|
-
return munmap(addr, pageSize) == 0;
|
264
|
-
#endif
|
265
|
-
}
|
266
|
-
|
267
|
-
static bool
|
268
|
-
protectPage(void* page)
|
269
|
-
{
|
270
|
-
#if !defined(__CYGWIN__) && (defined(_WIN32) || defined(__WIN32__))
|
271
|
-
DWORD oldProtect;
|
272
|
-
return VirtualProtect(page, pageSize, PAGE_EXECUTE_READ, &oldProtect);
|
273
|
-
#else
|
274
|
-
return mprotect(page, pageSize, PROT_READ | PROT_EXEC) == 0;
|
275
|
-
#endif
|
276
|
-
}
|
277
|
-
|
278
|
-
void
|
279
|
-
rbffi_ClosurePool_Init(VALUE module)
|
280
|
-
{
|
281
|
-
pageSize = getPageSize();
|
282
|
-
}
|
283
|
-
|
data/gen/Rakefile
DELETED
@@ -1,30 +0,0 @@
|
|
1
|
-
$LOAD_PATH.unshift File.join(File.dirname(__FILE__), '..', 'lib')
|
2
|
-
require 'fileutils'
|
3
|
-
require 'ffi'
|
4
|
-
require 'ffi/platform'
|
5
|
-
require 'ffi/tools/types_generator'
|
6
|
-
types_conf = File.expand_path(File.join(FFI::Platform::CONF_DIR, 'types.conf'))
|
7
|
-
|
8
|
-
logfile = File.join(File.dirname(__FILE__), 'log')
|
9
|
-
|
10
|
-
file types_conf do |task|
|
11
|
-
options = {}
|
12
|
-
FileUtils.mkdir_p(File.dirname(task.name), { :mode => 0755 })
|
13
|
-
File.open(task.name, File::CREAT|File::TRUNC|File::RDWR, 0644) do |f|
|
14
|
-
f.puts FFI::TypesGenerator.generate(options)
|
15
|
-
end
|
16
|
-
File.open(logfile, 'w') do |log|
|
17
|
-
log.puts(types_conf)
|
18
|
-
end
|
19
|
-
end
|
20
|
-
|
21
|
-
task :default => types_conf do
|
22
|
-
end
|
23
|
-
|
24
|
-
task :clean do
|
25
|
-
File.readlines(logfile).each do |file|
|
26
|
-
file.strip!
|
27
|
-
rm_f file
|
28
|
-
end
|
29
|
-
rm_f logfile
|
30
|
-
end
|
data/libtest/Benchmark.c
DELETED
@@ -1,52 +0,0 @@
|
|
1
|
-
/*
|
2
|
-
* Copyright (c) 2007 Wayne Meissner. All rights reserved.
|
3
|
-
*
|
4
|
-
* For licensing, see LICENSE.SPECS
|
5
|
-
*/
|
6
|
-
#include <sys/types.h>
|
7
|
-
#include <stdint.h>
|
8
|
-
|
9
|
-
void returnVoid() {
|
10
|
-
|
11
|
-
}
|
12
|
-
|
13
|
-
void returnVoidI(int arg) {
|
14
|
-
|
15
|
-
}
|
16
|
-
int returnInt() {
|
17
|
-
return 0;
|
18
|
-
}
|
19
|
-
|
20
|
-
int returnIntI(int arg) {
|
21
|
-
return arg;
|
22
|
-
}
|
23
|
-
|
24
|
-
typedef int8_t s8;
|
25
|
-
typedef uint8_t u8;
|
26
|
-
typedef int16_t s16;
|
27
|
-
typedef uint16_t u16;
|
28
|
-
typedef int32_t s32;
|
29
|
-
typedef uint32_t u32;
|
30
|
-
typedef int64_t s64;
|
31
|
-
typedef uint64_t u64;
|
32
|
-
typedef float f32;
|
33
|
-
typedef double f64;
|
34
|
-
typedef void v;
|
35
|
-
typedef char* S;
|
36
|
-
typedef void* P;
|
37
|
-
|
38
|
-
#define B6(R, T1, T2, T3, T4, T5, T6) R bench_##T1##T2##T3##T4##T5##T6##_##R(T1 a1, T2 a2, T3 a3, T4 a4, T5 a5, T6 a6) {}
|
39
|
-
#define B5(R, T1, T2, T3, T4, T5) R bench_##T1##T2##T3##T4##T5##_##R(T1 a1, T2 a2, T3 a3, T4 a4, T5 a5) {}
|
40
|
-
#define B4(R, T1, T2, T3, T4) R bench_##T1##T2##T3##T4##_##R(T1 a1, T2 a2, T3 a3, T4 a4) {}
|
41
|
-
#define B3(R, T1, T2, T3) R bench_##T1##T2##T3##_##R(T1 a1, T2 a2, T3 a3) {}
|
42
|
-
#define B2(R, T1, T2) R bench_##T1##T2##_##R(T1 a1, T2 a2) {}
|
43
|
-
#define B1(R, T1) R bench_##T1##_##R(T1 a1) {}
|
44
|
-
#define BrV(T) B1(v, T); B2(v, T, T); B3(v, T, T, T); B4(v, T, T, T, T); B5(v, T, T, T, T, T); B6(v, T, T, T, T, T, T);
|
45
|
-
BrV(u32);
|
46
|
-
BrV(s32);
|
47
|
-
BrV(s64);
|
48
|
-
BrV(u64);
|
49
|
-
BrV(f32);
|
50
|
-
BrV(f64);
|
51
|
-
BrV(S);
|
52
|
-
BrV(P);
|
data/libtest/BoolTest.c
DELETED
@@ -1,34 +0,0 @@
|
|
1
|
-
/*
|
2
|
-
* Copyright (c) 2007 Wayne Meissner.
|
3
|
-
* Copyright (c) 2009 Aman Gupta.
|
4
|
-
*
|
5
|
-
* All rights reserved.
|
6
|
-
*
|
7
|
-
* For licensing, see LICENSE.SPECS
|
8
|
-
*/
|
9
|
-
|
10
|
-
#include <stdbool.h>
|
11
|
-
|
12
|
-
bool
|
13
|
-
bool_return_true()
|
14
|
-
{
|
15
|
-
return true;
|
16
|
-
}
|
17
|
-
|
18
|
-
bool
|
19
|
-
bool_return_false()
|
20
|
-
{
|
21
|
-
return false;
|
22
|
-
}
|
23
|
-
|
24
|
-
bool
|
25
|
-
bool_return_val(bool value)
|
26
|
-
{
|
27
|
-
return value;
|
28
|
-
}
|
29
|
-
|
30
|
-
bool
|
31
|
-
bool_reverse_val(bool value)
|
32
|
-
{
|
33
|
-
return value ? false : true;
|
34
|
-
}
|
data/libtest/BufferTest.c
DELETED
@@ -1,31 +0,0 @@
|
|
1
|
-
/*
|
2
|
-
* Copyright (c) 2007 Wayne Meissner. All rights reserved.
|
3
|
-
*
|
4
|
-
* For licensing, see LICENSE.SPECS
|
5
|
-
*/
|
6
|
-
|
7
|
-
|
8
|
-
#define MEMSET(buf, value, size) do { \
|
9
|
-
int i; for (i = 0; i < size; ++i) buf[i] = value; \
|
10
|
-
} while(0)
|
11
|
-
#define MEMCPY(dst, src, size) do { \
|
12
|
-
int i; for (i = 0; i < size; ++i) dst[i] = src[i]; \
|
13
|
-
} while(0)
|
14
|
-
|
15
|
-
#define FILL(JTYPE, CTYPE) \
|
16
|
-
void fill##JTYPE##Buffer(CTYPE* buf, CTYPE value, int size) { MEMSET(buf, value, size); }
|
17
|
-
|
18
|
-
#define COPY(JTYPE, CTYPE) \
|
19
|
-
void copy##JTYPE##Buffer(CTYPE* dst, CTYPE* src, int size) { MEMCPY(dst, src, size); }
|
20
|
-
|
21
|
-
#define FUNC(JTYPE, CTYPE) \
|
22
|
-
FILL(JTYPE, CTYPE); \
|
23
|
-
COPY(JTYPE, CTYPE)
|
24
|
-
|
25
|
-
FUNC(Byte, char);
|
26
|
-
FUNC(Short, short);
|
27
|
-
FUNC(Int, int);
|
28
|
-
FUNC(Long, long long);
|
29
|
-
FUNC(Float, float);
|
30
|
-
FUNC(Double, double);
|
31
|
-
|
data/libtest/ClosureTest.c
DELETED
@@ -1,205 +0,0 @@
|
|
1
|
-
/*
|
2
|
-
* Copyright (c) 2007 Wayne Meissner. All rights reserved.
|
3
|
-
*
|
4
|
-
* For licensing, see LICENSE.SPECS
|
5
|
-
*/
|
6
|
-
|
7
|
-
#include <stdlib.h>
|
8
|
-
#include <stdbool.h>
|
9
|
-
#ifndef _WIN32
|
10
|
-
# include <pthread.h>
|
11
|
-
#else
|
12
|
-
# include <windows.h>
|
13
|
-
# include <process.h>
|
14
|
-
#endif
|
15
|
-
|
16
|
-
#define R(T, rtype) rtype testClosureVr##T(rtype (*closure)(void)) { \
|
17
|
-
return closure != NULL ? (*closure)() : (rtype) 0; \
|
18
|
-
}
|
19
|
-
|
20
|
-
#define P(T, ptype) void testClosure##T##rV(void (*closure)(ptype), ptype a1) { \
|
21
|
-
if (closure != NULL) (*closure)(a1); \
|
22
|
-
}
|
23
|
-
|
24
|
-
void testClosureVrV(void (*closure)(void))
|
25
|
-
{
|
26
|
-
(*closure)();
|
27
|
-
}
|
28
|
-
|
29
|
-
R(Z, bool);
|
30
|
-
R(B, char);
|
31
|
-
R(S, short);
|
32
|
-
R(I, int);
|
33
|
-
R(L, long);
|
34
|
-
R(J, long long);
|
35
|
-
R(LL, long long);
|
36
|
-
R(F, float);
|
37
|
-
R(D, double);
|
38
|
-
R(P, const void*);
|
39
|
-
|
40
|
-
|
41
|
-
P(Z, bool);
|
42
|
-
P(B, char);
|
43
|
-
P(S, short);
|
44
|
-
P(I, int);
|
45
|
-
P(L, long);
|
46
|
-
P(J, long long);
|
47
|
-
P(LL, long long);
|
48
|
-
P(F, float);
|
49
|
-
P(D, double);
|
50
|
-
P(P, const void*);
|
51
|
-
P(UL, unsigned long);
|
52
|
-
|
53
|
-
#if defined(_WIN32) && !defined(_WIN64)
|
54
|
-
bool __stdcall testClosureStdcall(long *a1, void __stdcall(*closure)(void *, long), long a2) { \
|
55
|
-
void* sp_pre;
|
56
|
-
void* sp_post;
|
57
|
-
|
58
|
-
asm volatile (" movl %%esp,%0" : "=g" (sp_pre));
|
59
|
-
(*closure)(a1, a2);
|
60
|
-
asm volatile (" movl %%esp,%0" : "=g" (sp_post));
|
61
|
-
|
62
|
-
/* %esp before pushing parameters on the stack and after the call returns
|
63
|
-
* should be equal, if both sides respects the stdcall convention */
|
64
|
-
return sp_pre == sp_post;
|
65
|
-
}
|
66
|
-
#endif
|
67
|
-
|
68
|
-
void testOptionalClosureBrV(void (*closure)(char), char a1)
|
69
|
-
{
|
70
|
-
if (closure) {
|
71
|
-
(*closure)(a1);
|
72
|
-
}
|
73
|
-
}
|
74
|
-
|
75
|
-
|
76
|
-
struct ThreadVrV {
|
77
|
-
void (*closure)(void);
|
78
|
-
int count;
|
79
|
-
};
|
80
|
-
|
81
|
-
static void *
|
82
|
-
threadVrV(void *arg)
|
83
|
-
{
|
84
|
-
struct ThreadVrV* t = (struct ThreadVrV *) arg;
|
85
|
-
|
86
|
-
int i;
|
87
|
-
for (i = 0; i < t->count; i++) {
|
88
|
-
(*t->closure)();
|
89
|
-
}
|
90
|
-
|
91
|
-
return NULL;
|
92
|
-
}
|
93
|
-
|
94
|
-
void testThreadedClosureVrV(void (*closure)(void), int n)
|
95
|
-
{
|
96
|
-
struct ThreadVrV arg = {closure, n};
|
97
|
-
#ifndef _WIN32
|
98
|
-
pthread_t t;
|
99
|
-
pthread_create(&t, NULL, threadVrV, &arg);
|
100
|
-
pthread_join(t, NULL);
|
101
|
-
#else
|
102
|
-
HANDLE hThread = (HANDLE) _beginthread((void (*)(void *))threadVrV, 0, &arg);
|
103
|
-
WaitForSingleObject(hThread, INFINITE);
|
104
|
-
#endif
|
105
|
-
}
|
106
|
-
|
107
|
-
struct s8f32s32 {
|
108
|
-
char s8;
|
109
|
-
float f32;
|
110
|
-
int s32;
|
111
|
-
};
|
112
|
-
|
113
|
-
// Takes a struct argument
|
114
|
-
void testClosureTrV(void (*closure)(struct s8f32s32 s), struct s8f32s32* s)
|
115
|
-
{
|
116
|
-
(*closure)(*s);
|
117
|
-
}
|
118
|
-
|
119
|
-
// Returns a struct value
|
120
|
-
struct s8f32s32 testClosureVrT(struct s8f32s32 (*closure)())
|
121
|
-
{
|
122
|
-
return (*closure)();
|
123
|
-
}
|
124
|
-
|
125
|
-
typedef int (*returnTypeClosure_t)(int) ;
|
126
|
-
typedef returnTypeClosure_t (*lookupClosure_t)();
|
127
|
-
|
128
|
-
int testReturnsClosure(lookupClosure_t lookup, int val)
|
129
|
-
{
|
130
|
-
returnTypeClosure_t func = lookup ? (*lookup)() : NULL;
|
131
|
-
return func ? (*func)(val) : 0;
|
132
|
-
}
|
133
|
-
|
134
|
-
static int multiplyByTwo(int value)
|
135
|
-
{
|
136
|
-
return value * 2;
|
137
|
-
}
|
138
|
-
|
139
|
-
returnTypeClosure_t testReturnsFunctionPointer()
|
140
|
-
{
|
141
|
-
return multiplyByTwo;
|
142
|
-
}
|
143
|
-
|
144
|
-
typedef int (*argumentClosure_t)(int);
|
145
|
-
typedef int (*withArgumentClosure_t)(argumentClosure_t, int);
|
146
|
-
|
147
|
-
int testArgumentClosure(withArgumentClosure_t closure_with, argumentClosure_t closure_arg, int val)
|
148
|
-
{
|
149
|
-
return (*closure_with)(closure_arg, val);
|
150
|
-
}
|
151
|
-
|
152
|
-
|
153
|
-
//
|
154
|
-
// These macros produce functions of the form:
|
155
|
-
// testClosureBIrV(void (*closure)(char, int), char a1, int a2) {}
|
156
|
-
//
|
157
|
-
#define C2_(J1, J2, N1, N2) \
|
158
|
-
void testClosure##J1##J2##rV(void (*closure)(N1, N2), N1 a1, N2 a2) \
|
159
|
-
{ \
|
160
|
-
if (closure != NULL) (*closure)(a1, a2); \
|
161
|
-
}
|
162
|
-
|
163
|
-
#define C2(J, N) \
|
164
|
-
C2_(B, J, char, N) \
|
165
|
-
C2_(S, J, short, N) \
|
166
|
-
C2_(I, J, int, N) \
|
167
|
-
C2_(LL, J, long long, N) \
|
168
|
-
C2_(F, J, float, N) \
|
169
|
-
C2_(D, J, double, N) \
|
170
|
-
|
171
|
-
|
172
|
-
C2(B, char);
|
173
|
-
C2(S, short);
|
174
|
-
C2(I, int);
|
175
|
-
C2(LL, long long);
|
176
|
-
C2(F, float);
|
177
|
-
C2(D, double);
|
178
|
-
|
179
|
-
#define C3_(J1, J2, J3, N1, N2, N3) \
|
180
|
-
void testClosure##J1##J2##J3##rV(void (*closure)(N1, N2, N3), N1 a1, N2 a2, N3 a3) \
|
181
|
-
{ \
|
182
|
-
(*closure)(a1, a2, a3); \
|
183
|
-
}
|
184
|
-
|
185
|
-
|
186
|
-
#define C3(J, N) \
|
187
|
-
C3_(B, J, B, char, N, char) \
|
188
|
-
C3_(S, J, S, short, N, short) \
|
189
|
-
C3_(I, J, I, int, N, int) \
|
190
|
-
C3_(LL, J, LL, long long, N, long long) \
|
191
|
-
C3_(F, J, F, float, N, float) \
|
192
|
-
C3_(D, J, D, double, N, double) \
|
193
|
-
|
194
|
-
C3(B, char);
|
195
|
-
C3(S, short);
|
196
|
-
C3(I, int);
|
197
|
-
C3(LL, long long);
|
198
|
-
C3(F, float);
|
199
|
-
C3(D, double);
|
200
|
-
C3_(B, S, I, char, short, int);
|
201
|
-
C3_(B, S, LL, char, short, long long);
|
202
|
-
C3_(LL, S, B, long long, short, char);
|
203
|
-
C3_(LL, B, S, long long, char, short);
|
204
|
-
|
205
|
-
|