head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.1 netbsd-11-0-RC3:1.1.1.1 netbsd-11-0-RC2:1.1.1.1 netbsd-11-0-RC1:1.1.1.1 perseant-exfatfs-base-20250801:1.1.1.1 netbsd-11:1.1.1.1.0.50 netbsd-11-base:1.1.1.1 netbsd-10-1-RELEASE:1.1.1.1 perseant-exfatfs-base-20240630:1.1.1.1 perseant-exfatfs:1.1.1.1.0.48 perseant-exfatfs-base:1.1.1.1 netbsd-8-3-RELEASE:1.1.1.1 netbsd-9-4-RELEASE:1.1.1.1 netbsd-10-0-RELEASE:1.1.1.1 netbsd-10-0-RC6:1.1.1.1 netbsd-10-0-RC5:1.1.1.1 netbsd-10-0-RC4:1.1.1.1 netbsd-10-0-RC3:1.1.1.1 netbsd-10-0-RC2:1.1.1.1 netbsd-10-0-RC1:1.1.1.1 netbsd-10:1.1.1.1.0.46 netbsd-10-base:1.1.1.1 netbsd-9-3-RELEASE:1.1.1.1 cjep_sun2x-base1:1.1.1.1 cjep_sun2x:1.1.1.1.0.44 cjep_sun2x-base:1.1.1.1 cjep_staticlib_x-base1:1.1.1.1 netbsd-9-2-RELEASE:1.1.1.1 cjep_staticlib_x:1.1.1.1.0.42 cjep_staticlib_x-base:1.1.1.1 netbsd-9-1-RELEASE:1.1.1.1 phil-wifi-20200421:1.1.1.1 phil-wifi-20200411:1.1.1.1 is-mlppp:1.1.1.1.0.40 is-mlppp-base:1.1.1.1 phil-wifi-20200406:1.1.1.1 netbsd-8-2-RELEASE:1.1.1.1 netbsd-9-0-RELEASE:1.1.1.1 netbsd-9-0-RC2:1.1.1.1 netbsd-9-0-RC1:1.1.1.1 phil-wifi-20191119:1.1.1.1 netbsd-9:1.1.1.1.0.38 netbsd-9-base:1.1.1.1 phil-wifi-20190609:1.1.1.1 netbsd-8-1-RELEASE:1.1.1.1 netbsd-8-1-RC1:1.1.1.1 pgoyette-compat-merge-20190127:1.1.1.1 pgoyette-compat-20190127:1.1.1.1 pgoyette-compat-20190118:1.1.1.1 pgoyette-compat-1226:1.1.1.1 pgoyette-compat-1126:1.1.1.1 pgoyette-compat-1020:1.1.1.1 pgoyette-compat-0930:1.1.1.1 pgoyette-compat-0906:1.1.1.1 netbsd-7-2-RELEASE:1.1.1.1 pgoyette-compat-0728:1.1.1.1 netbsd-8-0-RELEASE:1.1.1.1 phil-wifi:1.1.1.1.0.36 phil-wifi-base:1.1.1.1 pgoyette-compat-0625:1.1.1.1 netbsd-8-0-RC2:1.1.1.1 pgoyette-compat-0521:1.1.1.1 pgoyette-compat-0502:1.1.1.1 pgoyette-compat-0422:1.1.1.1 netbsd-8-0-RC1:1.1.1.1 pgoyette-compat-0415:1.1.1.1 pgoyette-compat-0407:1.1.1.1 pgoyette-compat-0330:1.1.1.1 pgoyette-compat-0322:1.1.1.1 pgoyette-compat-0315:1.1.1.1 netbsd-7-1-2-RELEASE:1.1.1.1 pgoyette-compat:1.1.1.1.0.34 pgoyette-compat-base:1.1.1.1 netbsd-7-1-1-RELEASE:1.1.1.1 matt-nb8-mediatek:1.1.1.1.0.32 matt-nb8-mediatek-base:1.1.1.1 perseant-stdc-iso10646:1.1.1.1.0.30 perseant-stdc-iso10646-base:1.1.1.1 netbsd-8:1.1.1.1.0.28 netbsd-8-base:1.1.1.1 prg-localcount2-base3:1.1.1.1 prg-localcount2-base2:1.1.1.1 prg-localcount2-base1:1.1.1.1 prg-localcount2:1.1.1.1.0.26 prg-localcount2-base:1.1.1.1 pgoyette-localcount-20170426:1.1.1.1 bouyer-socketcan-base1:1.1.1.1 pgoyette-localcount-20170320:1.1.1.1 netbsd-7-1:1.1.1.1.0.24 netbsd-7-1-RELEASE:1.1.1.1 netbsd-7-1-RC2:1.1.1.1 netbsd-7-nhusb-base-20170116:1.1.1.1 bouyer-socketcan:1.1.1.1.0.22 bouyer-socketcan-base:1.1.1.1 pgoyette-localcount-20170107:1.1.1.1 netbsd-7-1-RC1:1.1.1.1 pgoyette-localcount-20161104:1.1.1.1 netbsd-7-0-2-RELEASE:1.1.1.1 localcount-20160914:1.1.1.1 netbsd-7-nhusb:1.1.1.1.0.20 netbsd-7-nhusb-base:1.1.1.1 pgoyette-localcount-20160806:1.1.1.1 pgoyette-localcount-20160726:1.1.1.1 pgoyette-localcount:1.1.1.1.0.18 pgoyette-localcount-base:1.1.1.1 netbsd-7-0-1-RELEASE:1.1.1.1 netbsd-7-0:1.1.1.1.0.16 netbsd-7-0-RELEASE:1.1.1.1 netbsd-7-0-RC3:1.1.1.1 netbsd-7-0-RC2:1.1.1.1 netbsd-7-0-RC1:1.1.1.1 netbsd-7:1.1.1.1.0.14 netbsd-7-base:1.1.1.1 yamt-pagecache:1.1.1.1.0.12 yamt-pagecache-base9:1.1.1.1 tls-earlyentropy:1.1.1.1.0.10 tls-earlyentropy-base:1.1.1.1 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.1 riastradh-drm2-base3:1.1.1.1 lutok-0-3:1.1.1.1 riastradh-drm2-base2:1.1.1.1 riastradh-drm2-base1:1.1.1.1 riastradh-drm2:1.1.1.1.0.2 riastradh-drm2-base:1.1.1.1 khorben-n900:1.1.1.1.0.8 agc-symver:1.1.1.1.0.6 agc-symver-base:1.1.1.1 tls-maxphys-base:1.1.1.1 tls-maxphys:1.1.1.1.0.4 lutok-0-2:1.1.1.1 GOOGLE-CODE:1.1.1; locks; strict; comment @// @; 1.1 date 2013.02.16.15.06.52; author jmmv; state Exp; branches 1.1.1.1; next ; 1.1.1.1 date 2013.02.16.15.06.52; author jmmv; state Exp; branches 1.1.1.1.4.1 1.1.1.1.12.1; next ; 1.1.1.1.4.1 date 2013.02.16.15.06.52; author tls; state dead; branches; next 1.1.1.1.4.2; 1.1.1.1.4.2 date 2013.02.25.00.26.42; author tls; state Exp; branches; next ; 1.1.1.1.12.1 date 2013.02.16.15.06.52; author yamt; state dead; branches; next 1.1.1.1.12.2; commitid p2kNxjwDaLpR8yBx; 1.1.1.1.12.2 date 2014.05.22.15.49.33; author yamt; state Exp; branches; next ; commitid p2kNxjwDaLpR8yBx; desc @@ 1.1 log @Initial revision @ text @// Copyright 2012 Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // * Neither the name of Google Inc. nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. /// \file examples/bindings.cpp /// Showcases how to define Lua functions from C++ code. /// /// A major selling point of Lua is that it is very easy too hook native C and /// C++ functions into the runtime environment so that Lua can call them. The /// purpose of this example program is to show how this is done by using Lutok. #include #include #include #include #include #include #include #include #include #include /// Calculates the factorial of a given number. /// /// \param i The postivie number to calculate the factorial of. /// /// \return The factorial of i. static int factorial(const int i) { assert(i >= 0); if (i == 0) return 1; else return i * factorial(i - 1); } /// A custom factorial function for Lua. /// /// \pre stack(-1) contains the number to calculate the factorial of. /// \post stack(-1) contains the result of the operation. /// /// \param state The Lua state from which to get the function arguments and into /// which to push the results. /// /// \return The number of results pushed onto the stack, i.e. 1. /// /// \throw std::runtime_error If the input parameters are invalid. Note that /// Lutok will convert this exception to lutok::error. static int lua_factorial(lutok::state& state) { if (!state.is_number()) throw std::runtime_error("Argument to factorial must be an integer"); const int i = state.to_integer(); if (i < 0) throw std::runtime_error("Argument to factorial must be positive"); state.push_integer(factorial(i)); return 1; } /// Program's entry point. /// /// \param argc Length of argv. Must be 2. /// \param argv Command-line arguments to the program. The first argument to /// the tool has to be a number. /// /// \return A system exit code. int main(int argc, char** argv) { if (argc != 2) { std::cerr << "Usage: bindings \n"; return EXIT_FAILURE; } // Create a new Lua session and load the print() function. lutok::state state; state.open_base(); // Construct a 'module' that contains an entry point to our native factorial // function. A module is just a Lua table that contains a mapping of names // to functions. Instead of creating a module by using our create_module() // helper function, we could have used push_cxx_function on the state to // define the function ourselves. std::map< std::string, lutok::cxx_function > module; module["factorial"] = lua_factorial; lutok::create_module(state, "native", module); // Use a little Lua script to call our native factorial function providing // it the first argument passed to the program. Note that this will error // out in a controlled manner if the passed argument is not an integer. The // important thing to notice is that the exception comes from our own C++ // binding and that it has been converted to a lutok::error. std::ostringstream script; script << "print(native.factorial(" << argv[1] << "))"; try { lutok::do_string(state, script.str()); return EXIT_SUCCESS; } catch (const lutok::error& e) { std::cerr << "ERROR: " << e.what() << '\n'; return EXIT_FAILURE; } } @ 1.1.1.1 log @Initial import of Lutok, version 0.2. This is a required component of Kyua and its build will be guarded by the MKKYUA knob. core@@ has approved this import. Description: Lutok is a lightweight C++ API library for Lua. Lutok provides thin C++ wrappers around the Lua C API to ease the interaction between C++ and Lua. These wrappers make intensive use of RAII to prevent resource leakage, expose C++-friendly data types, report errors by means of exceptions and ensure that the Lua stack is always left untouched in the face of errors. The library also provides a small subset of miscellaneous utility functions built on top of the wrappers. Lutok focuses on providing a clean and safe C++ interface; the drawback is that it is not suitable for performance-critical environments. In order to implement error-safe C++ wrappers on top of a Lua C binary library, Lutok adds several layers or abstraction and error checking that go against the original spirit of the Lua C API and thus degrade performance. @ text @@ 1.1.1.1.12.1 log @file bindings.cpp was added on branch yamt-pagecache on 2014-05-22 15:49:33 +0000 @ text @d1 133 @ 1.1.1.1.12.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 133 // Copyright 2012 Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // * Neither the name of Google Inc. nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. /// \file examples/bindings.cpp /// Showcases how to define Lua functions from C++ code. /// /// A major selling point of Lua is that it is very easy too hook native C and /// C++ functions into the runtime environment so that Lua can call them. The /// purpose of this example program is to show how this is done by using Lutok. #include #include #include #include #include #include #include #include #include #include /// Calculates the factorial of a given number. /// /// \param i The postivie number to calculate the factorial of. /// /// \return The factorial of i. static int factorial(const int i) { assert(i >= 0); if (i == 0) return 1; else return i * factorial(i - 1); } /// A custom factorial function for Lua. /// /// \pre stack(-1) contains the number to calculate the factorial of. /// \post stack(-1) contains the result of the operation. /// /// \param state The Lua state from which to get the function arguments and into /// which to push the results. /// /// \return The number of results pushed onto the stack, i.e. 1. /// /// \throw std::runtime_error If the input parameters are invalid. Note that /// Lutok will convert this exception to lutok::error. static int lua_factorial(lutok::state& state) { if (!state.is_number()) throw std::runtime_error("Argument to factorial must be an integer"); const int i = state.to_integer(); if (i < 0) throw std::runtime_error("Argument to factorial must be positive"); state.push_integer(factorial(i)); return 1; } /// Program's entry point. /// /// \param argc Length of argv. Must be 2. /// \param argv Command-line arguments to the program. The first argument to /// the tool has to be a number. /// /// \return A system exit code. int main(int argc, char** argv) { if (argc != 2) { std::cerr << "Usage: bindings \n"; return EXIT_FAILURE; } // Create a new Lua session and load the print() function. lutok::state state; state.open_base(); // Construct a 'module' that contains an entry point to our native factorial // function. A module is just a Lua table that contains a mapping of names // to functions. Instead of creating a module by using our create_module() // helper function, we could have used push_cxx_function on the state to // define the function ourselves. std::map< std::string, lutok::cxx_function > module; module["factorial"] = lua_factorial; lutok::create_module(state, "native", module); // Use a little Lua script to call our native factorial function providing // it the first argument passed to the program. Note that this will error // out in a controlled manner if the passed argument is not an integer. The // important thing to notice is that the exception comes from our own C++ // binding and that it has been converted to a lutok::error. std::ostringstream script; script << "print(native.factorial(" << argv[1] << "))"; try { lutok::do_string(state, script.str()); return EXIT_SUCCESS; } catch (const lutok::error& e) { std::cerr << "ERROR: " << e.what() << '\n'; return EXIT_FAILURE; } } @ 1.1.1.1.4.1 log @file bindings.cpp was added on branch tls-maxphys on 2013-02-25 00:26:42 +0000 @ text @d1 133 @ 1.1.1.1.4.2 log @resync with head @ text @a0 133 // Copyright 2012 Google Inc. // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // * Neither the name of Google Inc. nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. /// \file examples/bindings.cpp /// Showcases how to define Lua functions from C++ code. /// /// A major selling point of Lua is that it is very easy too hook native C and /// C++ functions into the runtime environment so that Lua can call them. The /// purpose of this example program is to show how this is done by using Lutok. #include #include #include #include #include #include #include #include #include #include /// Calculates the factorial of a given number. /// /// \param i The postivie number to calculate the factorial of. /// /// \return The factorial of i. static int factorial(const int i) { assert(i >= 0); if (i == 0) return 1; else return i * factorial(i - 1); } /// A custom factorial function for Lua. /// /// \pre stack(-1) contains the number to calculate the factorial of. /// \post stack(-1) contains the result of the operation. /// /// \param state The Lua state from which to get the function arguments and into /// which to push the results. /// /// \return The number of results pushed onto the stack, i.e. 1. /// /// \throw std::runtime_error If the input parameters are invalid. Note that /// Lutok will convert this exception to lutok::error. static int lua_factorial(lutok::state& state) { if (!state.is_number()) throw std::runtime_error("Argument to factorial must be an integer"); const int i = state.to_integer(); if (i < 0) throw std::runtime_error("Argument to factorial must be positive"); state.push_integer(factorial(i)); return 1; } /// Program's entry point. /// /// \param argc Length of argv. Must be 2. /// \param argv Command-line arguments to the program. The first argument to /// the tool has to be a number. /// /// \return A system exit code. int main(int argc, char** argv) { if (argc != 2) { std::cerr << "Usage: bindings \n"; return EXIT_FAILURE; } // Create a new Lua session and load the print() function. lutok::state state; state.open_base(); // Construct a 'module' that contains an entry point to our native factorial // function. A module is just a Lua table that contains a mapping of names // to functions. Instead of creating a module by using our create_module() // helper function, we could have used push_cxx_function on the state to // define the function ourselves. std::map< std::string, lutok::cxx_function > module; module["factorial"] = lua_factorial; lutok::create_module(state, "native", module); // Use a little Lua script to call our native factorial function providing // it the first argument passed to the program. Note that this will error // out in a controlled manner if the passed argument is not an integer. The // important thing to notice is that the exception comes from our own C++ // binding and that it has been converted to a lutok::error. std::ostringstream script; script << "print(native.factorial(" << argv[1] << "))"; try { lutok::do_string(state, script.str()); return EXIT_SUCCESS; } catch (const lutok::error& e) { std::cerr << "ERROR: " << e.what() << '\n'; return EXIT_FAILURE; } } @