debugger-ruby_core_source 1.1.2 → 1.1.3

Sign up to get free protection for your applications and to get access to all the features.
Files changed (37) hide show
  1. data/CHANGELOG.md +3 -0
  2. data/README.md +3 -0
  3. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/debug.h +36 -0
  4. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/dln.h +41 -0
  5. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/encdb.h +163 -0
  6. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/eval_intern.h +232 -0
  7. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/gc.h +77 -0
  8. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/id.h +170 -0
  9. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/insns.inc +179 -0
  10. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/insns_info.inc +695 -0
  11. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/iseq.h +104 -0
  12. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/known_errors.inc +731 -0
  13. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/method.h +103 -0
  14. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/node.h +483 -0
  15. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/node_name.inc +208 -0
  16. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/opt_sc.inc +670 -0
  17. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/optinsn.inc +30 -0
  18. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/optunifs.inc +116 -0
  19. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/parse.h +186 -0
  20. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/regenc.h +211 -0
  21. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/regint.h +841 -0
  22. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/regparse.h +354 -0
  23. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/revision.h +1 -0
  24. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/thread_pthread.h +27 -0
  25. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/thread_win32.h +33 -0
  26. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/timev.h +21 -0
  27. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/transcode_data.h +109 -0
  28. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/transdb.h +179 -0
  29. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/version.h +55 -0
  30. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/vm.inc +3055 -0
  31. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/vm_core.h +706 -0
  32. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/vm_exec.h +184 -0
  33. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/vm_insnhelper.h +208 -0
  34. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/vm_opts.h +51 -0
  35. data/lib/debugger/ruby_core_source/ruby-1.9.2-p320/vmtc.inc +97 -0
  36. data/lib/debugger/ruby_core_source/version.rb +1 -1
  37. metadata +36 -3
@@ -0,0 +1,354 @@
1
+ #ifndef ONIGURUMA_REGPARSE_H
2
+ #define ONIGURUMA_REGPARSE_H
3
+ /**********************************************************************
4
+ regparse.h - Oniguruma (regular expression library)
5
+ **********************************************************************/
6
+ /*-
7
+ * Copyright (c) 2002-2007 K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
8
+ * All rights reserved.
9
+ *
10
+ * Redistribution and use in source and binary forms, with or without
11
+ * modification, are permitted provided that the following conditions
12
+ * are met:
13
+ * 1. Redistributions of source code must retain the above copyright
14
+ * notice, this list of conditions and the following disclaimer.
15
+ * 2. Redistributions in binary form must reproduce the above copyright
16
+ * notice, this list of conditions and the following disclaimer in the
17
+ * documentation and/or other materials provided with the distribution.
18
+ *
19
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
23
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29
+ * SUCH DAMAGE.
30
+ */
31
+
32
+ #include "regint.h"
33
+
34
+ /* node type */
35
+ #define NT_STR 0
36
+ #define NT_CCLASS 1
37
+ #define NT_CTYPE 2
38
+ #define NT_CANY 3
39
+ #define NT_BREF 4
40
+ #define NT_QTFR 5
41
+ #define NT_ENCLOSE 6
42
+ #define NT_ANCHOR 7
43
+ #define NT_LIST 8
44
+ #define NT_ALT 9
45
+ #define NT_CALL 10
46
+
47
+ /* node type bit */
48
+ #define NTYPE2BIT(type) (1<<(type))
49
+
50
+ #define BIT_NT_STR NTYPE2BIT(NT_STR)
51
+ #define BIT_NT_CCLASS NTYPE2BIT(NT_CCLASS)
52
+ #define BIT_NT_CTYPE NTYPE2BIT(NT_CTYPE)
53
+ #define BIT_NT_CANY NTYPE2BIT(NT_CANY)
54
+ #define BIT_NT_BREF NTYPE2BIT(NT_BREF)
55
+ #define BIT_NT_QTFR NTYPE2BIT(NT_QTFR)
56
+ #define BIT_NT_ENCLOSE NTYPE2BIT(NT_ENCLOSE)
57
+ #define BIT_NT_ANCHOR NTYPE2BIT(NT_ANCHOR)
58
+ #define BIT_NT_LIST NTYPE2BIT(NT_LIST)
59
+ #define BIT_NT_ALT NTYPE2BIT(NT_ALT)
60
+ #define BIT_NT_CALL NTYPE2BIT(NT_CALL)
61
+
62
+ #define IS_NODE_TYPE_SIMPLE(type) \
63
+ ((NTYPE2BIT(type) & (BIT_NT_STR | BIT_NT_CCLASS | BIT_NT_CTYPE |\
64
+ BIT_NT_CANY | BIT_NT_BREF)) != 0)
65
+
66
+ #define NTYPE(node) ((node)->u.base.type)
67
+ #define SET_NTYPE(node, ntype) (node)->u.base.type = (ntype)
68
+
69
+ #define NSTR(node) (&((node)->u.str))
70
+ #define NCCLASS(node) (&((node)->u.cclass))
71
+ #define NCTYPE(node) (&((node)->u.ctype))
72
+ #define NBREF(node) (&((node)->u.bref))
73
+ #define NQTFR(node) (&((node)->u.qtfr))
74
+ #define NENCLOSE(node) (&((node)->u.enclose))
75
+ #define NANCHOR(node) (&((node)->u.anchor))
76
+ #define NCONS(node) (&((node)->u.cons))
77
+ #define NCALL(node) (&((node)->u.call))
78
+
79
+ #define NCAR(node) (NCONS(node)->car)
80
+ #define NCDR(node) (NCONS(node)->cdr)
81
+
82
+
83
+
84
+ #define ANCHOR_ANYCHAR_STAR_MASK (ANCHOR_ANYCHAR_STAR | ANCHOR_ANYCHAR_STAR_ML)
85
+ #define ANCHOR_END_BUF_MASK (ANCHOR_END_BUF | ANCHOR_SEMI_END_BUF)
86
+
87
+ #define ENCLOSE_MEMORY (1<<0)
88
+ #define ENCLOSE_OPTION (1<<1)
89
+ #define ENCLOSE_STOP_BACKTRACK (1<<2)
90
+
91
+ #define NODE_STR_MARGIN 16
92
+ #define NODE_STR_BUF_SIZE 24 /* sizeof(CClassNode) - sizeof(int)*4 */
93
+ #define NODE_BACKREFS_SIZE 6
94
+
95
+ #define NSTR_RAW (1<<0) /* by backslashed number */
96
+ #define NSTR_AMBIG (1<<1)
97
+ #define NSTR_DONT_GET_OPT_INFO (1<<2)
98
+
99
+ #define NSTRING_LEN(node) ((node)->u.str.end - (node)->u.str.s)
100
+ #define NSTRING_SET_RAW(node) (node)->u.str.flag |= NSTR_RAW
101
+ #define NSTRING_CLEAR_RAW(node) (node)->u.str.flag &= ~NSTR_RAW
102
+ #define NSTRING_SET_AMBIG(node) (node)->u.str.flag |= NSTR_AMBIG
103
+ #define NSTRING_SET_DONT_GET_OPT_INFO(node) \
104
+ (node)->u.str.flag |= NSTR_DONT_GET_OPT_INFO
105
+ #define NSTRING_IS_RAW(node) (((node)->u.str.flag & NSTR_RAW) != 0)
106
+ #define NSTRING_IS_AMBIG(node) (((node)->u.str.flag & NSTR_AMBIG) != 0)
107
+ #define NSTRING_IS_DONT_GET_OPT_INFO(node) \
108
+ (((node)->u.str.flag & NSTR_DONT_GET_OPT_INFO) != 0)
109
+
110
+ #define BACKREFS_P(br) \
111
+ (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static);
112
+
113
+ #define NQ_TARGET_ISNOT_EMPTY 0
114
+ #define NQ_TARGET_IS_EMPTY 1
115
+ #define NQ_TARGET_IS_EMPTY_MEM 2
116
+ #define NQ_TARGET_IS_EMPTY_REC 3
117
+
118
+ /* status bits */
119
+ #define NST_MIN_FIXED (1<<0)
120
+ #define NST_MAX_FIXED (1<<1)
121
+ #define NST_CLEN_FIXED (1<<2)
122
+ #define NST_MARK1 (1<<3)
123
+ #define NST_MARK2 (1<<4)
124
+ #define NST_MEM_BACKREFED (1<<5)
125
+ #define NST_STOP_BT_SIMPLE_REPEAT (1<<6)
126
+ #define NST_RECURSION (1<<7)
127
+ #define NST_CALLED (1<<8)
128
+ #define NST_ADDR_FIXED (1<<9)
129
+ #define NST_NAMED_GROUP (1<<10)
130
+ #define NST_NAME_REF (1<<11)
131
+ #define NST_IN_REPEAT (1<<12) /* STK_REPEAT is nested in stack. */
132
+ #define NST_NEST_LEVEL (1<<13)
133
+ #define NST_BY_NUMBER (1<<14) /* {n,m} */
134
+
135
+ #define SET_ENCLOSE_STATUS(node,f) (node)->u.enclose.state |= (f)
136
+ #define CLEAR_ENCLOSE_STATUS(node,f) (node)->u.enclose.state &= ~(f)
137
+
138
+ #define IS_ENCLOSE_CALLED(en) (((en)->state & NST_CALLED) != 0)
139
+ #define IS_ENCLOSE_ADDR_FIXED(en) (((en)->state & NST_ADDR_FIXED) != 0)
140
+ #define IS_ENCLOSE_RECURSION(en) (((en)->state & NST_RECURSION) != 0)
141
+ #define IS_ENCLOSE_MARK1(en) (((en)->state & NST_MARK1) != 0)
142
+ #define IS_ENCLOSE_MARK2(en) (((en)->state & NST_MARK2) != 0)
143
+ #define IS_ENCLOSE_MIN_FIXED(en) (((en)->state & NST_MIN_FIXED) != 0)
144
+ #define IS_ENCLOSE_MAX_FIXED(en) (((en)->state & NST_MAX_FIXED) != 0)
145
+ #define IS_ENCLOSE_CLEN_FIXED(en) (((en)->state & NST_CLEN_FIXED) != 0)
146
+ #define IS_ENCLOSE_STOP_BT_SIMPLE_REPEAT(en) \
147
+ (((en)->state & NST_STOP_BT_SIMPLE_REPEAT) != 0)
148
+ #define IS_ENCLOSE_NAMED_GROUP(en) (((en)->state & NST_NAMED_GROUP) != 0)
149
+
150
+ #define SET_CALL_RECURSION(node) (node)->u.call.state |= NST_RECURSION
151
+ #define IS_CALL_RECURSION(cn) (((cn)->state & NST_RECURSION) != 0)
152
+ #define IS_CALL_NAME_REF(cn) (((cn)->state & NST_NAME_REF) != 0)
153
+ #define IS_BACKREF_NAME_REF(bn) (((bn)->state & NST_NAME_REF) != 0)
154
+ #define IS_BACKREF_NEST_LEVEL(bn) (((bn)->state & NST_NEST_LEVEL) != 0)
155
+ #define IS_QUANTIFIER_IN_REPEAT(qn) (((qn)->state & NST_IN_REPEAT) != 0)
156
+ #define IS_QUANTIFIER_BY_NUMBER(qn) (((qn)->state & NST_BY_NUMBER) != 0)
157
+
158
+ #define CALLNODE_REFNUM_UNDEF -1
159
+
160
+ typedef struct {
161
+ NodeBase base;
162
+ UChar* s;
163
+ UChar* end;
164
+ unsigned int flag;
165
+ int capa; /* (allocated size - 1) or 0: use buf[] */
166
+ UChar buf[NODE_STR_BUF_SIZE];
167
+ } StrNode;
168
+
169
+ typedef struct {
170
+ NodeBase base;
171
+ int state;
172
+ struct _Node* target;
173
+ int lower;
174
+ int upper;
175
+ int greedy;
176
+ int target_empty_info;
177
+ struct _Node* head_exact;
178
+ struct _Node* next_head_exact;
179
+ int is_refered; /* include called node. don't eliminate even if {0} */
180
+ #ifdef USE_COMBINATION_EXPLOSION_CHECK
181
+ int comb_exp_check_num; /* 1,2,3...: check, 0: no check */
182
+ #endif
183
+ } QtfrNode;
184
+
185
+ typedef struct {
186
+ NodeBase base;
187
+ int state;
188
+ int type;
189
+ int regnum;
190
+ OnigOptionType option;
191
+ struct _Node* target;
192
+ AbsAddrType call_addr;
193
+ /* for multiple call reference */
194
+ OnigDistance min_len; /* min length (byte) */
195
+ OnigDistance max_len; /* max length (byte) */
196
+ int char_len; /* character length */
197
+ int opt_count; /* referenced count in optimize_node_left() */
198
+ } EncloseNode;
199
+
200
+ #ifdef USE_SUBEXP_CALL
201
+
202
+ typedef struct {
203
+ int offset;
204
+ struct _Node* target;
205
+ } UnsetAddr;
206
+
207
+ typedef struct {
208
+ int num;
209
+ int alloc;
210
+ UnsetAddr* us;
211
+ } UnsetAddrList;
212
+
213
+ typedef struct {
214
+ NodeBase base;
215
+ int state;
216
+ int group_num;
217
+ UChar* name;
218
+ UChar* name_end;
219
+ struct _Node* target; /* EncloseNode : ENCLOSE_MEMORY */
220
+ UnsetAddrList* unset_addr_list;
221
+ } CallNode;
222
+
223
+ #endif
224
+
225
+ typedef struct {
226
+ NodeBase base;
227
+ int state;
228
+ int back_num;
229
+ int back_static[NODE_BACKREFS_SIZE];
230
+ int* back_dynamic;
231
+ int nest_level;
232
+ } BRefNode;
233
+
234
+ typedef struct {
235
+ NodeBase base;
236
+ int type;
237
+ struct _Node* target;
238
+ int char_len;
239
+ } AnchorNode;
240
+
241
+ typedef struct {
242
+ NodeBase base;
243
+ struct _Node* car;
244
+ struct _Node* cdr;
245
+ } ConsAltNode;
246
+
247
+ typedef struct {
248
+ NodeBase base;
249
+ int ctype;
250
+ int not;
251
+ } CtypeNode;
252
+
253
+ typedef struct _Node {
254
+ union {
255
+ NodeBase base;
256
+ StrNode str;
257
+ CClassNode cclass;
258
+ QtfrNode qtfr;
259
+ EncloseNode enclose;
260
+ BRefNode bref;
261
+ AnchorNode anchor;
262
+ ConsAltNode cons;
263
+ CtypeNode ctype;
264
+ #ifdef USE_SUBEXP_CALL
265
+ CallNode call;
266
+ #endif
267
+ } u;
268
+ } Node;
269
+
270
+
271
+ #define NULL_NODE ((Node* )0)
272
+
273
+ #define SCANENV_MEMNODES_SIZE 8
274
+ #define SCANENV_MEM_NODES(senv) \
275
+ (IS_NOT_NULL((senv)->mem_nodes_dynamic) ? \
276
+ (senv)->mem_nodes_dynamic : (senv)->mem_nodes_static)
277
+
278
+ typedef struct {
279
+ OnigOptionType option;
280
+ OnigCaseFoldType case_fold_flag;
281
+ OnigEncoding enc;
282
+ const OnigSyntaxType* syntax;
283
+ BitStatusType capture_history;
284
+ BitStatusType bt_mem_start;
285
+ BitStatusType bt_mem_end;
286
+ BitStatusType backrefed_mem;
287
+ UChar* pattern;
288
+ UChar* pattern_end;
289
+ UChar* error;
290
+ UChar* error_end;
291
+ regex_t* reg; /* for reg->names only */
292
+ int num_call;
293
+ #ifdef USE_SUBEXP_CALL
294
+ UnsetAddrList* unset_addr_list;
295
+ #endif
296
+ int num_mem;
297
+ #ifdef USE_NAMED_GROUP
298
+ int num_named;
299
+ #endif
300
+ int mem_alloc;
301
+ Node* mem_nodes_static[SCANENV_MEMNODES_SIZE];
302
+ Node** mem_nodes_dynamic;
303
+ #ifdef USE_COMBINATION_EXPLOSION_CHECK
304
+ int num_comb_exp_check;
305
+ int comb_exp_max_regnum;
306
+ int curr_max_regnum;
307
+ int has_recursion;
308
+ #endif
309
+ int warnings_flag;
310
+ const char* sourcefile;
311
+ int sourceline;
312
+ } ScanEnv;
313
+
314
+
315
+ #define IS_SYNTAX_OP(syn, opm) (((syn)->op & (opm)) != 0)
316
+ #define IS_SYNTAX_OP2(syn, opm) (((syn)->op2 & (opm)) != 0)
317
+ #define IS_SYNTAX_BV(syn, bvm) (((syn)->behavior & (bvm)) != 0)
318
+
319
+ #ifdef USE_NAMED_GROUP
320
+ typedef struct {
321
+ int new_val;
322
+ } GroupNumRemap;
323
+
324
+ extern int onig_renumber_name_table P_((regex_t* reg, GroupNumRemap* map));
325
+ #endif
326
+
327
+ extern int onig_strncmp P_((const UChar* s1, const UChar* s2, int n));
328
+ extern void onig_strcpy P_((UChar* dest, const UChar* src, const UChar* end));
329
+ extern void onig_scan_env_set_error_string P_((ScanEnv* env, int ecode, UChar* arg, UChar* arg_end));
330
+ extern int onig_scan_unsigned_number P_((UChar** src, const UChar* end, OnigEncoding enc));
331
+ extern void onig_reduce_nested_quantifier P_((Node* pnode, Node* cnode));
332
+ extern void onig_node_conv_to_str_node P_((Node* node, int raw));
333
+ extern int onig_node_str_cat P_((Node* node, const UChar* s, const UChar* end));
334
+ extern int onig_node_str_set P_((Node* node, const UChar* s, const UChar* end));
335
+ extern void onig_node_free P_((Node* node));
336
+ extern Node* onig_node_new_enclose P_((int type));
337
+ extern Node* onig_node_new_anchor P_((int type));
338
+ extern Node* onig_node_new_str P_((const UChar* s, const UChar* end));
339
+ extern Node* onig_node_new_list P_((Node* left, Node* right));
340
+ extern Node* onig_node_list_add P_((Node* list, Node* x));
341
+ extern Node* onig_node_new_alt P_((Node* left, Node* right));
342
+ extern void onig_node_str_clear P_((Node* node));
343
+ extern int onig_free_node_list P_((void));
344
+ extern int onig_names_free P_((regex_t* reg));
345
+ extern int onig_parse_make_tree P_((Node** root, const UChar* pattern, const UChar* end, regex_t* reg, ScanEnv* env));
346
+ extern int onig_free_shared_cclass_table P_((void));
347
+
348
+ #ifdef ONIG_DEBUG
349
+ #ifdef USE_NAMED_GROUP
350
+ extern int onig_print_names(FILE*, regex_t*);
351
+ #endif
352
+ #endif
353
+
354
+ #endif /* ONIGURUMA_REGPARSE_H */
@@ -0,0 +1 @@
1
+ #define RUBY_REVISION 35421
@@ -0,0 +1,27 @@
1
+ /**********************************************************************
2
+
3
+ thread_pthread.h -
4
+
5
+ $Author: naruse $
6
+
7
+ Copyright (C) 2004-2007 Koichi Sasada
8
+
9
+ **********************************************************************/
10
+
11
+ #ifndef RUBY_THREAD_PTHREAD_H
12
+ #define RUBY_THREAD_PTHREAD_H
13
+
14
+ #include <pthread.h>
15
+ #ifdef HAVE_PTHREAD_NP_H
16
+ #include <pthread_np.h>
17
+ #endif
18
+ typedef pthread_t rb_thread_id_t;
19
+ typedef pthread_mutex_t rb_thread_lock_t;
20
+ typedef pthread_cond_t rb_thread_cond_t;
21
+
22
+ typedef struct native_thread_data_struct {
23
+ void *signal_thread_list;
24
+ pthread_cond_t sleep_cond;
25
+ } native_thread_data_t;
26
+
27
+ #endif /* RUBY_THREAD_PTHREAD_H */
@@ -0,0 +1,33 @@
1
+ /**********************************************************************
2
+
3
+ thread_win32.h -
4
+
5
+ $Author: akr $
6
+
7
+ Copyright (C) 2004-2007 Koichi Sasada
8
+
9
+ **********************************************************************/
10
+
11
+ /* interface */
12
+ #ifndef RUBY_THREAD_WIN32_H
13
+ #define RUBY_THREAD_WIN32_H
14
+
15
+ #include <windows.h>
16
+
17
+ # ifdef __CYGWIN__
18
+ # undef _WIN32
19
+ # endif
20
+
21
+ WINBASEAPI BOOL WINAPI
22
+ TryEnterCriticalSection(IN OUT LPCRITICAL_SECTION lpCriticalSection);
23
+
24
+ typedef HANDLE rb_thread_id_t;
25
+ typedef CRITICAL_SECTION rb_thread_lock_t;
26
+ typedef struct rb_thread_cond_struct rb_thread_cond_t;
27
+
28
+ typedef struct native_thread_data_struct {
29
+ HANDLE interrupt_event;
30
+ } native_thread_data_t;
31
+
32
+ #endif /* RUBY_THREAD_WIN32_H */
33
+
@@ -0,0 +1,21 @@
1
+ #ifndef RUBY_TIMEV_H
2
+ #define RUBY_TIMEV_H
3
+
4
+ struct vtm {
5
+ VALUE year; /* 2000 for example. Integer. */
6
+ int mon; /* 1..12 */
7
+ int mday; /* 1..31 */
8
+ int hour; /* 0..23 */
9
+ int min; /* 0..59 */
10
+ int sec; /* 0..60 */
11
+ VALUE subsecx; /* 0 <= subsecx < TIME_SCALE. possibly Rational. */
12
+ VALUE utc_offset; /* -3600 as -01:00 for example. possibly Rational. */
13
+ int wday; /* 0:Sunday, 1:Monday, ..., 6:Saturday */
14
+ int yday; /* 1..366 */
15
+ int isdst; /* 0:StandardTime 1:DayLightSavingTime */
16
+ const char *zone; /* "JST", "EST", "EDT", etc. */
17
+ };
18
+
19
+ #define TIME_SCALE 1000000000
20
+
21
+ #endif
@@ -0,0 +1,109 @@
1
+ /**********************************************************************
2
+
3
+ transcode_data.h -
4
+
5
+ $Author: duerst $
6
+ created at: Mon 10 Dec 2007 14:01:47 JST 2007
7
+
8
+ Copyright (C) 2007 Martin Duerst
9
+
10
+ **********************************************************************/
11
+
12
+ #include "ruby/ruby.h"
13
+
14
+ #ifndef RUBY_TRANSCODE_DATA_H
15
+ #define RUBY_TRANSCODE_DATA_H 1
16
+
17
+ #define WORDINDEX_SHIFT_BITS 2
18
+ #define WORDINDEX2INFO(widx) ((widx) << WORDINDEX_SHIFT_BITS)
19
+ #define INFO2WORDINDEX(info) ((info) >> WORDINDEX_SHIFT_BITS)
20
+ #define BYTE_LOOKUP_BASE(bl) ((bl)[0])
21
+ #define BYTE_LOOKUP_INFO(bl) ((bl)[1])
22
+
23
+ #define PType (unsigned int)
24
+
25
+ #define NOMAP (PType 0x01) /* direct map */
26
+ #define ONEbt (0x02) /* one byte payload */
27
+ #define TWObt (0x03) /* two bytes payload */
28
+ #define THREEbt (0x05) /* three bytes payload */
29
+ #define FOURbt (0x06) /* four bytes payload, UTF-8 only, macros start at getBT0 */
30
+ #define INVALID (PType 0x07) /* invalid byte sequence */
31
+ #define UNDEF (PType 0x09) /* legal but undefined */
32
+ #define ZERObt (PType 0x0A) /* zero bytes of payload, i.e. remove */
33
+ #define FUNii (PType 0x0B) /* function from info to info */
34
+ #define FUNsi (PType 0x0D) /* function from start to info */
35
+ #define FUNio (PType 0x0E) /* function from info to output */
36
+ #define FUNso (PType 0x0F) /* function from start to output */
37
+ #define STR1 (PType 0x11) /* string 4 <= len <= 259 bytes: 1byte length + content */
38
+ #define GB4bt (PType 0x12) /* GB18030 four bytes payload */
39
+ #define FUNsio (PType 0x13) /* function from start and info to output */
40
+
41
+ #define STR1_LENGTH(byte_addr) (unsigned int)(*(byte_addr) + 4)
42
+ #define STR1_BYTEINDEX(w) ((w) >> 6)
43
+ #define makeSTR1(bi) (((bi) << 6) | STR1)
44
+ #define makeSTR1LEN(len) ((len)-4)
45
+
46
+ #define o1(b1) (PType((((unsigned char)(b1))<<8)|ONEbt))
47
+ #define o2(b1,b2) (PType((((unsigned char)(b1))<<8)|(((unsigned char)(b2))<<16)|TWObt))
48
+ #define o3(b1,b2,b3) (PType(((((unsigned char)(b1))<<8)|(((unsigned char)(b2))<<16)|(((unsigned int)(unsigned char)(b3))<<24)|THREEbt)&0xffffffffU))
49
+ #define o4(b0,b1,b2,b3) (PType(((((unsigned char)(b1))<<8)|(((unsigned char)(b2))<<16)|(((unsigned char)(b3))<<24)|((((unsigned char)(b0))&0x07)<<5)|FOURbt)&0xffffffffU))
50
+ #define g4(b0,b1,b2,b3) (PType(((((unsigned char)(b0))<<8)|(((unsigned char)(b2))<<16)|((((unsigned char)(b1))&0x0f)<<24)|((((unsigned int)(unsigned char)(b3))&0x0f)<<28)|GB4bt)&0xffffffffU))
51
+ #define funsio(diff) (PType((((unsigned int)(diff))<<8)|FUNsio))
52
+
53
+ #define getBT1(a) ((unsigned char)((a)>> 8))
54
+ #define getBT2(a) ((unsigned char)((a)>>16))
55
+ #define getBT3(a) ((unsigned char)((a)>>24))
56
+ #define getBT0(a) (((unsigned char)((a)>> 5)&0x07)|0xF0) /* for UTF-8 only!!! */
57
+
58
+ #define getGB4bt0(a) ((unsigned char)((a)>> 8))
59
+ #define getGB4bt1(a) ((unsigned char)((a)>>24)&0x0F|0x30)
60
+ #define getGB4bt2(a) ((unsigned char)((a)>>16))
61
+ #define getGB4bt3(a) ((unsigned char)((a)>>28)&0x0F|0x30)
62
+
63
+ #define o2FUNii(b1,b2) (PType((((unsigned char)(b1))<<8)|(((unsigned char)(b2))<<16)|FUNii))
64
+
65
+ /* do we need these??? maybe not, can be done with simple tables */
66
+ #define ONETRAIL /* legal but undefined if one more trailing UTF-8 */
67
+ #define TWOTRAIL /* legal but undefined if two more trailing UTF-8 */
68
+ #define THREETRAIL /* legal but undefined if three more trailing UTF-8 */
69
+
70
+ typedef enum {
71
+ asciicompat_converter, /* ASCII-compatible -> ASCII-compatible */
72
+ asciicompat_decoder, /* ASCII-incompatible -> ASCII-compatible */
73
+ asciicompat_encoder /* ASCII-compatible -> ASCII-incompatible */
74
+ /* ASCII-incompatible -> ASCII-incompatible is intentionally omitted. */
75
+ } rb_transcoder_asciicompat_type_t;
76
+
77
+ typedef struct rb_transcoder rb_transcoder;
78
+
79
+ /* static structure, one per supported encoding pair */
80
+ struct rb_transcoder {
81
+ const char *src_encoding;
82
+ const char *dst_encoding;
83
+ unsigned int conv_tree_start;
84
+ const unsigned char *byte_array;
85
+ unsigned int byte_array_length;
86
+ const unsigned int *word_array;
87
+ unsigned int word_array_length;
88
+ int word_size;
89
+ int input_unit_length;
90
+ int max_input;
91
+ int max_output;
92
+ rb_transcoder_asciicompat_type_t asciicompat_type;
93
+ size_t state_size;
94
+ int (*state_init_func)(void*); /* ret==0:success ret!=0:failure(errno) */
95
+ int (*state_fini_func)(void*); /* ret==0:success ret!=0:failure(errno) */
96
+ VALUE (*func_ii)(void*, VALUE); /* info -> info */
97
+ VALUE (*func_si)(void*, const unsigned char*, size_t); /* start -> info */
98
+ ssize_t (*func_io)(void*, VALUE, const unsigned char*, size_t); /* info -> output */
99
+ ssize_t (*func_so)(void*, const unsigned char*, size_t, unsigned char*, size_t); /* start -> output */
100
+ ssize_t (*finish_func)(void*, unsigned char*, size_t); /* -> output */
101
+ ssize_t (*resetsize_func)(void*); /* -> len */
102
+ ssize_t (*resetstate_func)(void*, unsigned char*, size_t); /* -> output */
103
+ ssize_t (*func_sio)(void*, const unsigned char*, size_t, VALUE, unsigned char*, size_t); /* start -> output */
104
+ };
105
+
106
+ void rb_declare_transcoder(const char *enc1, const char *enc2, const char *lib);
107
+ void rb_register_transcoder(const rb_transcoder *);
108
+
109
+ #endif /* RUBY_TRANSCODE_DATA_H */