1 // Copyright 2011 Google Inc.
2 // All rights reserved.
3 //
4 // Redistribution and use in source and binary forms, with or without
5 // modification, are permitted provided that the following conditions are
6 // met:
7 //
8 // * Redistributions of source code must retain the above copyright
9 // notice, this list of conditions and the following disclaimer.
10 // * Redistributions in binary form must reproduce the above copyright
11 // notice, this list of conditions and the following disclaimer in the
12 // documentation and/or other materials provided with the distribution.
13 // * Neither the name of Google Inc. nor the names of its contributors
14 // may be used to endorse or promote products derived from this software
15 // without specific prior written permission.
16 //
17 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28
29 #include "stack_cleaner.hpp"
30
31 #include <atf-c++.hpp>
32
33
34 ATF_TEST_CASE_WITHOUT_HEAD(empty);
ATF_TEST_CASE_BODY(empty)35 ATF_TEST_CASE_BODY(empty)
36 {
37 lutok::state state;
38 {
39 lutok::stack_cleaner cleaner(state);
40 ATF_REQUIRE_EQ(0, state.get_top());
41 }
42 ATF_REQUIRE_EQ(0, state.get_top());
43 }
44
45
46 ATF_TEST_CASE_WITHOUT_HEAD(some);
ATF_TEST_CASE_BODY(some)47 ATF_TEST_CASE_BODY(some)
48 {
49 lutok::state state;
50 {
51 lutok::stack_cleaner cleaner(state);
52 state.push_integer(15);
53 ATF_REQUIRE_EQ(1, state.get_top());
54 state.push_integer(30);
55 ATF_REQUIRE_EQ(2, state.get_top());
56 }
57 ATF_REQUIRE_EQ(0, state.get_top());
58 }
59
60
61 ATF_TEST_CASE_WITHOUT_HEAD(nested);
ATF_TEST_CASE_BODY(nested)62 ATF_TEST_CASE_BODY(nested)
63 {
64 lutok::state state;
65 {
66 lutok::stack_cleaner cleaner1(state);
67 state.push_integer(10);
68 ATF_REQUIRE_EQ(1, state.get_top());
69 ATF_REQUIRE_EQ(10, state.to_integer(-1));
70 {
71 lutok::stack_cleaner cleaner2(state);
72 state.push_integer(20);
73 ATF_REQUIRE_EQ(2, state.get_top());
74 ATF_REQUIRE_EQ(20, state.to_integer(-1));
75 ATF_REQUIRE_EQ(10, state.to_integer(-2));
76 }
77 ATF_REQUIRE_EQ(1, state.get_top());
78 ATF_REQUIRE_EQ(10, state.to_integer(-1));
79 }
80 ATF_REQUIRE_EQ(0, state.get_top());
81 }
82
83
84 ATF_TEST_CASE_WITHOUT_HEAD(forget);
ATF_TEST_CASE_BODY(forget)85 ATF_TEST_CASE_BODY(forget)
86 {
87 lutok::state state;
88 {
89 lutok::stack_cleaner cleaner(state);
90 state.push_integer(15);
91 state.push_integer(30);
92 cleaner.forget();
93 state.push_integer(60);
94 ATF_REQUIRE_EQ(3, state.get_top());
95 }
96 ATF_REQUIRE_EQ(2, state.get_top());
97 ATF_REQUIRE_EQ(30, state.to_integer(-1));
98 state.pop(2);
99 }
100
101
ATF_INIT_TEST_CASES(tcs)102 ATF_INIT_TEST_CASES(tcs)
103 {
104 ATF_ADD_TEST_CASE(tcs, empty);
105 ATF_ADD_TEST_CASE(tcs, some);
106 ATF_ADD_TEST_CASE(tcs, nested);
107 ATF_ADD_TEST_CASE(tcs, forget);
108 }
109