regtrav.c 2.8 KB

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