1 | /**********************************************************************
|
---|
2 | regtrav.c - Onigmo (Oniguruma-mod) (regular expression library)
|
---|
3 | **********************************************************************/
|
---|
4 | /*-
|
---|
5 | * Copyright (c) 2002-2004 K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
|
---|
6 | * Copyright (c) 2011 K.Takata <kentkt AT csc DOT jp>
|
---|
7 | * All rights reserved.
|
---|
8 | *
|
---|
9 | * Redistribution and use in source and binary forms, with or without
|
---|
10 | * modification, are permitted provided that the following conditions
|
---|
11 | * are met:
|
---|
12 | * 1. Redistributions of source code must retain the above copyright
|
---|
13 | * notice, this list of conditions and the following disclaimer.
|
---|
14 | * 2. Redistributions in binary form must reproduce the above copyright
|
---|
15 | * notice, this list of conditions and the following disclaimer in the
|
---|
16 | * documentation and/or other materials provided with the distribution.
|
---|
17 | *
|
---|
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
---|
19 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
---|
20 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
---|
21 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
---|
22 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
---|
23 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
---|
24 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
---|
25 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
---|
26 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
---|
27 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
---|
28 | * SUCH DAMAGE.
|
---|
29 | */
|
---|
30 |
|
---|
31 | #include "regint.h"
|
---|
32 |
|
---|
33 | #ifdef USE_CAPTURE_HISTORY
|
---|
34 |
|
---|
35 | static int
|
---|
36 | capture_tree_traverse(OnigCaptureTreeNode* node, int at,
|
---|
37 | int(*callback_func)(int,OnigPosition,OnigPosition,int,int,void*),
|
---|
38 | int level, void* arg)
|
---|
39 | {
|
---|
40 | int r, i;
|
---|
41 |
|
---|
42 | if (node == (OnigCaptureTreeNode* )0)
|
---|
43 | return 0;
|
---|
44 |
|
---|
45 | if ((at & ONIG_TRAVERSE_CALLBACK_AT_FIRST) != 0) {
|
---|
46 | r = (*callback_func)(node->group, node->beg, node->end,
|
---|
47 | level, ONIG_TRAVERSE_CALLBACK_AT_FIRST, arg);
|
---|
48 | if (r != 0) return r;
|
---|
49 | }
|
---|
50 |
|
---|
51 | for (i = 0; i < node->num_childs; i++) {
|
---|
52 | r = capture_tree_traverse(node->childs[i], at,
|
---|
53 | callback_func, level + 1, arg);
|
---|
54 | if (r != 0) return r;
|
---|
55 | }
|
---|
56 |
|
---|
57 | if ((at & ONIG_TRAVERSE_CALLBACK_AT_LAST) != 0) {
|
---|
58 | r = (*callback_func)(node->group, node->beg, node->end,
|
---|
59 | level, ONIG_TRAVERSE_CALLBACK_AT_LAST, arg);
|
---|
60 | if (r != 0) return r;
|
---|
61 | }
|
---|
62 |
|
---|
63 | return 0;
|
---|
64 | }
|
---|
65 | #endif /* USE_CAPTURE_HISTORY */
|
---|
66 |
|
---|
67 | extern int
|
---|
68 | onig_capture_tree_traverse(OnigRegion* region, int at,
|
---|
69 | int(*callback_func)(int,OnigPosition,OnigPosition,int,int,void*),
|
---|
70 | void* arg)
|
---|
71 | {
|
---|
72 | #ifdef USE_CAPTURE_HISTORY
|
---|
73 | return capture_tree_traverse(region->history_root, at,
|
---|
74 | callback_func, 0, arg);
|
---|
75 | #else
|
---|
76 | return ONIG_NO_SUPPORT_CONFIG;
|
---|
77 | #endif
|
---|
78 | }
|
---|