aboutsummaryrefslogtreecommitdiff
path: root/libxsde/xsde/cxx/parser/state.hxx
blob: 11ace8d1f47b90f9fdd71503fc86b04454b617d2 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
// file      : xsde/cxx/parser/state.hxx
// author    : Boris Kolpackov <boris@codesynthesis.com>
// copyright : Copyright (c) 2005-2009 Code Synthesis Tools CC
// license   : GNU GPL v2 + exceptions; see accompanying LICENSE file

#ifndef XSDE_CXX_PARSER_STATE_HXX
#define XSDE_CXX_PARSER_STATE_HXX

#include <stddef.h> // size_t

#include <xsde/cxx/parser/elements.hxx>

namespace xsde
{
  namespace cxx
  {
    namespace parser
    {
      // POD stack with pre-allocated first element. You may
      // need to pad your elements to get the proper alignment.
      //
      struct stack
      {
        enum error
        {
          error_none,
          error_no_memory
        };

        ~stack ();
        stack (size_t element_size, void* first_element);

      public:
        void
        pop ();

        error
        push ();

        void*
        top ();

        size_t
        element_size () const;

        void
        clear ();

      private:
        error
        grow ();

      private:
        size_t el_size_;
        void* first_;
        char* data_;
        size_t size_;
        size_t capacity_;
      };

      // Optimized state stack for non-recursive case (one element).
      //
      struct parser_stack
      {
        parser_stack (parser_state& first);

        stack::error
        push (parser_state&);

        void
        pop ();

        parser_state&
        top ();

        void
        clear ();

      private:
        stack stack_;
      };
    }
  }
}


#include <xsde/cxx/parser/state.ixx>

#endif  // XSDE_CXX_PARSER_STATE_HXX