xref: /freebsd/contrib/lutok/stack_cleaner.cpp (revision c697fb7f7cc9bedc5beee44d35b771c4e87b335a)
1*c697fb7fSBrooks Davis // Copyright 2011 Google Inc.
2*c697fb7fSBrooks Davis // All rights reserved.
3*c697fb7fSBrooks Davis //
4*c697fb7fSBrooks Davis // Redistribution and use in source and binary forms, with or without
5*c697fb7fSBrooks Davis // modification, are permitted provided that the following conditions are
6*c697fb7fSBrooks Davis // met:
7*c697fb7fSBrooks Davis //
8*c697fb7fSBrooks Davis // * Redistributions of source code must retain the above copyright
9*c697fb7fSBrooks Davis //   notice, this list of conditions and the following disclaimer.
10*c697fb7fSBrooks Davis // * Redistributions in binary form must reproduce the above copyright
11*c697fb7fSBrooks Davis //   notice, this list of conditions and the following disclaimer in the
12*c697fb7fSBrooks Davis //   documentation and/or other materials provided with the distribution.
13*c697fb7fSBrooks Davis // * Neither the name of Google Inc. nor the names of its contributors
14*c697fb7fSBrooks Davis //   may be used to endorse or promote products derived from this software
15*c697fb7fSBrooks Davis //   without specific prior written permission.
16*c697fb7fSBrooks Davis //
17*c697fb7fSBrooks Davis // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18*c697fb7fSBrooks Davis // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19*c697fb7fSBrooks Davis // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20*c697fb7fSBrooks Davis // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21*c697fb7fSBrooks Davis // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22*c697fb7fSBrooks Davis // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23*c697fb7fSBrooks Davis // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24*c697fb7fSBrooks Davis // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25*c697fb7fSBrooks Davis // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26*c697fb7fSBrooks Davis // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27*c697fb7fSBrooks Davis // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28*c697fb7fSBrooks Davis 
29*c697fb7fSBrooks Davis #include <cassert>
30*c697fb7fSBrooks Davis #include <cstring>
31*c697fb7fSBrooks Davis 
32*c697fb7fSBrooks Davis #include "stack_cleaner.hpp"
33*c697fb7fSBrooks Davis #include "state.ipp"
34*c697fb7fSBrooks Davis 
35*c697fb7fSBrooks Davis 
36*c697fb7fSBrooks Davis /// Internal implementation for lutok::stack_cleaner.
37*c697fb7fSBrooks Davis struct lutok::stack_cleaner::impl {
38*c697fb7fSBrooks Davis     /// Reference to the Lua state this stack_cleaner refers to.
39*c697fb7fSBrooks Davis     state& state_ref;
40*c697fb7fSBrooks Davis 
41*c697fb7fSBrooks Davis     /// The depth of the Lua stack to be restored.
42*c697fb7fSBrooks Davis     unsigned int original_depth;
43*c697fb7fSBrooks Davis 
44*c697fb7fSBrooks Davis     /// Constructor.
45*c697fb7fSBrooks Davis     ///
46*c697fb7fSBrooks Davis     /// \param state_ref_ Reference to the Lua state.
47*c697fb7fSBrooks Davis     /// \param original_depth_ The depth of the Lua stack.
impllutok::stack_cleaner::impl48*c697fb7fSBrooks Davis     impl(state& state_ref_, const unsigned int original_depth_) :
49*c697fb7fSBrooks Davis         state_ref(state_ref_),
50*c697fb7fSBrooks Davis         original_depth(original_depth_)
51*c697fb7fSBrooks Davis     {
52*c697fb7fSBrooks Davis     }
53*c697fb7fSBrooks Davis };
54*c697fb7fSBrooks Davis 
55*c697fb7fSBrooks Davis 
56*c697fb7fSBrooks Davis /// Creates a new stack cleaner.
57*c697fb7fSBrooks Davis ///
58*c697fb7fSBrooks Davis /// This gathers the current height of the stack so that extra elements can be
59*c697fb7fSBrooks Davis /// popped during destruction.
60*c697fb7fSBrooks Davis ///
61*c697fb7fSBrooks Davis /// \param state_ The Lua state.
stack_cleaner(state & state_)62*c697fb7fSBrooks Davis lutok::stack_cleaner::stack_cleaner(state& state_) :
63*c697fb7fSBrooks Davis     _pimpl(new impl(state_, state_.get_top()))
64*c697fb7fSBrooks Davis {
65*c697fb7fSBrooks Davis }
66*c697fb7fSBrooks Davis 
67*c697fb7fSBrooks Davis 
68*c697fb7fSBrooks Davis /// Pops any values from the stack not known at construction time.
69*c697fb7fSBrooks Davis ///
70*c697fb7fSBrooks Davis /// \pre The current height of the stack must be equal or greater to the height
71*c697fb7fSBrooks Davis /// of the stack when this object was instantiated.
~stack_cleaner(void)72*c697fb7fSBrooks Davis lutok::stack_cleaner::~stack_cleaner(void)
73*c697fb7fSBrooks Davis {
74*c697fb7fSBrooks Davis     const unsigned int current_depth = _pimpl->state_ref.get_top();
75*c697fb7fSBrooks Davis     assert(current_depth >= _pimpl->original_depth);
76*c697fb7fSBrooks Davis     const unsigned int diff = current_depth - _pimpl->original_depth;
77*c697fb7fSBrooks Davis     if (diff > 0)
78*c697fb7fSBrooks Davis         _pimpl->state_ref.pop(diff);
79*c697fb7fSBrooks Davis }
80*c697fb7fSBrooks Davis 
81*c697fb7fSBrooks Davis 
82*c697fb7fSBrooks Davis /// Forgets about any elements currently in the stack.
83*c697fb7fSBrooks Davis ///
84*c697fb7fSBrooks Davis /// This allows a function to return values on the stack because all the
85*c697fb7fSBrooks Davis /// elements that are currently in the stack will not be touched during
86*c697fb7fSBrooks Davis /// destruction when the function is called.
87*c697fb7fSBrooks Davis void
forget(void)88*c697fb7fSBrooks Davis lutok::stack_cleaner::forget(void)
89*c697fb7fSBrooks Davis {
90*c697fb7fSBrooks Davis     _pimpl->original_depth = _pimpl->state_ref.get_top();
91*c697fb7fSBrooks Davis }
92