Loading [MathJax]/extensions/tex2jax.js
ug4
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
lua_stack_check.h
Go to the documentation of this file.
1/*
2 * Copyright (c) 2011: G-CSC, Goethe University Frankfurt
3 * Author: Martin Rupp
4 *
5 * This file is part of UG4.
6 *
7 * UG4 is free software: you can redistribute it and/or modify it under the
8 * terms of the GNU Lesser General Public License version 3 (as published by the
9 * Free Software Foundation) with the following additional attribution
10 * requirements (according to LGPL/GPL v3 §7):
11 *
12 * (1) The following notice must be displayed in the Appropriate Legal Notices
13 * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
14 *
15 * (2) The following notice must be displayed at a prominent place in the
16 * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
17 *
18 * (3) The following bibliography is recommended for citation and must be
19 * preserved in all covered files:
20 * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
21 * parallel geometric multigrid solver on hierarchically distributed grids.
22 * Computing and visualization in science 16, 4 (2013), 151-164"
23 * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
24 * flexible software system for simulating pde based models on high performance
25 * computers. Computing and visualization in science 16, 4 (2013), 165-179"
26 *
27 * This program is distributed in the hope that it will be useful,
28 * but WITHOUT ANY WARRANTY; without even the implied warranty of
29 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
30 * GNU Lesser General Public License for more details.
31 */
32
33#ifndef LUA_STACK_CHECK_H_
34#define LUA_STACK_CHECK_H_
35
36namespace ug
37{
38namespace bridge
39{
40
41#ifndef NDEBUG
43{
44public:
45 LuaStackCheck(lua_State *L, const char *msg, int growth=0)
46 {
47 m_L = L;
48 m_topBefore = lua_gettop(L);
49 m_growth = growth;
50 m_msg = msg;
51 }
53 {
54 int m_topAfter = lua_gettop(m_L);
55 UG_ASSERT(m_topBefore+m_growth == m_topAfter, m_msg << ": " << m_topBefore << " + " << m_growth << " != " << m_topAfter << "\n");
56 }
57private:
61 const char *m_msg;
62};
63
64#define LUA_STACK_CHECK_STRINGIFY(x) #x
65#define LUA_STACK_CHECK_TOSTRING(x) LUA_STACK_CHECK_STRINGIFY(x)
66
67#define LUA_STACK_CHECK(L, growth) ::ug::bridge::LuaStackCheck check##__LINE__(L, __FILE__ ":" LUA_STACK_CHECK_TOSTRING(__LINE__), growth)
68
69#else
70
71#define LUA_STACK_CHECK(L, growth)
72
73#endif
74
75
76}
77}
78#endif /* LUA_STACK_CHECK_H_ */
Definition lua_stack_check.h:43
const char * m_msg
Definition lua_stack_check.h:61
int m_growth
Definition lua_stack_check.h:60
LuaStackCheck(lua_State *L, const char *msg, int growth=0)
Definition lua_stack_check.h:45
~LuaStackCheck()
Definition lua_stack_check.h:52
int m_topBefore
Definition lua_stack_check.h:59
lua_State * m_L
Definition lua_stack_check.h:58
#define UG_ASSERT(expr, msg)
Definition assert.h:70
struct lua_State lua_State
Definition lua_table_handle.h:40
the ug namespace